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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 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:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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.3M 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-09b-LTLCardinality-00
FORMULA_NAME ASLink-PT-09b-LTLCardinality-01
FORMULA_NAME ASLink-PT-09b-LTLCardinality-02
FORMULA_NAME ASLink-PT-09b-LTLCardinality-03
FORMULA_NAME ASLink-PT-09b-LTLCardinality-04
FORMULA_NAME ASLink-PT-09b-LTLCardinality-05
FORMULA_NAME ASLink-PT-09b-LTLCardinality-06
FORMULA_NAME ASLink-PT-09b-LTLCardinality-07
FORMULA_NAME ASLink-PT-09b-LTLCardinality-08
FORMULA_NAME ASLink-PT-09b-LTLCardinality-09
FORMULA_NAME ASLink-PT-09b-LTLCardinality-10
FORMULA_NAME ASLink-PT-09b-LTLCardinality-11
FORMULA_NAME ASLink-PT-09b-LTLCardinality-12
FORMULA_NAME ASLink-PT-09b-LTLCardinality-13
FORMULA_NAME ASLink-PT-09b-LTLCardinality-14
FORMULA_NAME ASLink-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779486232429

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 21:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:43:54] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2026-05-22 21:43:54] [INFO ] Transformed 4014 places.
[2026-05-22 21:43:54] [INFO ] Transformed 4932 transitions.
[2026-05-22 21:43:54] [INFO ] Found NUPN structural information;
[2026-05-22 21:43:54] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-09b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 4014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Discarding 246 places :
Symmetric choice reduction at 0 with 246 rule applications. Total rules 246 place count 3768 transition count 4686
Iterating global reduction 0 with 246 rules applied. Total rules applied 492 place count 3768 transition count 4686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 493 place count 3768 transition count 4685
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 589 place count 3672 transition count 4536
Iterating global reduction 1 with 96 rules applied. Total rules applied 685 place count 3672 transition count 4536
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 715 place count 3672 transition count 4506
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 727 place count 3660 transition count 4494
Iterating global reduction 2 with 12 rules applied. Total rules applied 739 place count 3660 transition count 4494
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 743 place count 3656 transition count 4483
Iterating global reduction 2 with 4 rules applied. Total rules applied 747 place count 3656 transition count 4483
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 750 place count 3653 transition count 4480
Iterating global reduction 2 with 3 rules applied. Total rules applied 753 place count 3653 transition count 4480
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 756 place count 3650 transition count 4470
Iterating global reduction 2 with 3 rules applied. Total rules applied 759 place count 3650 transition count 4470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 760 place count 3649 transition count 4462
Iterating global reduction 2 with 1 rules applied. Total rules applied 761 place count 3649 transition count 4462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 762 place count 3648 transition count 4461
Iterating global reduction 2 with 1 rules applied. Total rules applied 763 place count 3648 transition count 4461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 764 place count 3647 transition count 4453
Iterating global reduction 2 with 1 rules applied. Total rules applied 765 place count 3647 transition count 4453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 766 place count 3646 transition count 4445
Iterating global reduction 2 with 1 rules applied. Total rules applied 767 place count 3646 transition count 4445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 768 place count 3645 transition count 4444
Iterating global reduction 2 with 1 rules applied. Total rules applied 769 place count 3645 transition count 4444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 770 place count 3644 transition count 4436
Iterating global reduction 2 with 1 rules applied. Total rules applied 771 place count 3644 transition count 4436
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 772 place count 3643 transition count 4428
Iterating global reduction 2 with 1 rules applied. Total rules applied 773 place count 3643 transition count 4428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 774 place count 3642 transition count 4427
Iterating global reduction 2 with 1 rules applied. Total rules applied 775 place count 3642 transition count 4427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 776 place count 3641 transition count 4419
Iterating global reduction 2 with 1 rules applied. Total rules applied 777 place count 3641 transition count 4419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 778 place count 3640 transition count 4411
Iterating global reduction 2 with 1 rules applied. Total rules applied 779 place count 3640 transition count 4411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 780 place count 3639 transition count 4410
Iterating global reduction 2 with 1 rules applied. Total rules applied 781 place count 3639 transition count 4410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 782 place count 3638 transition count 4402
Iterating global reduction 2 with 1 rules applied. Total rules applied 783 place count 3638 transition count 4402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 784 place count 3637 transition count 4394
Iterating global reduction 2 with 1 rules applied. Total rules applied 785 place count 3637 transition count 4394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 786 place count 3636 transition count 4393
Iterating global reduction 2 with 1 rules applied. Total rules applied 787 place count 3636 transition count 4393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 788 place count 3635 transition count 4385
Iterating global reduction 2 with 1 rules applied. Total rules applied 789 place count 3635 transition count 4385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 790 place count 3634 transition count 4377
Iterating global reduction 2 with 1 rules applied. Total rules applied 791 place count 3634 transition count 4377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 792 place count 3633 transition count 4376
Iterating global reduction 2 with 1 rules applied. Total rules applied 793 place count 3633 transition count 4376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 794 place count 3632 transition count 4368
Iterating global reduction 2 with 1 rules applied. Total rules applied 795 place count 3632 transition count 4368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 796 place count 3631 transition count 4360
Iterating global reduction 2 with 1 rules applied. Total rules applied 797 place count 3631 transition count 4360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 798 place count 3630 transition count 4359
Iterating global reduction 2 with 1 rules applied. Total rules applied 799 place count 3630 transition count 4359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 800 place count 3629 transition count 4351
Iterating global reduction 2 with 1 rules applied. Total rules applied 801 place count 3629 transition count 4351
Applied a total of 801 rules in 10405 ms. Remains 3629 /4014 variables (removed 385) and now considering 4351/4932 (removed 581) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6323397210174351242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4470405015968490259.kers'
[2026-05-22 21:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6323397210174351242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4470405015968490259.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4351 rows 3629 cols 13414 entries
Finished phase 1 with 2337 SingleSign rule and 898 generalized
[2026-05-22 21:44:05] [INFO ] Computed 394 invariants in 39 ms
Computed 394 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-4470405015968490259.kers
Total runtime 46 ms.
[2026-05-22 21:44:09] [INFO ] Implicit Places using invariants in 4150 ms returned [3463, 3474, 3485, 3493, 3501, 3509, 3517, 3528, 3536, 3544, 3555]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4238 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3618/4014 places, 4351/4932 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3605 transition count 4338
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3605 transition count 4338
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3594 transition count 4327
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3594 transition count 4327
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 3587 transition count 4320
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 3587 transition count 4320
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 3583 transition count 4316
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 3583 transition count 4316
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 3581 transition count 4314
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 3581 transition count 4314
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3579 transition count 4312
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3579 transition count 4312
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3577 transition count 4310
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3577 transition count 4310
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3575 transition count 4308
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3575 transition count 4308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3574 transition count 4307
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3574 transition count 4307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3573 transition count 4306
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3573 transition count 4306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3572 transition count 4305
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3572 transition count 4305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3571 transition count 4304
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3571 transition count 4304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3570 transition count 4303
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3570 transition count 4303
Applied a total of 96 rules in 4307 ms. Remains 3570 /3618 variables (removed 48) and now considering 4303/4351 (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-17840345762741303694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2953628388727785633.kers'
[2026-05-22 21:44:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17840345762741303694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2953628388727785633.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4303 rows 3570 cols 13262 entries
Finished phase 1 with 2322 SingleSign rule and 865 generalized
[2026-05-22 21:44:13] [INFO ] Computed 383 invariants in 40 ms
Computed 383 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-2953628388727785633.kers
Total runtime 50 ms.
[2026-05-22 21:44:18] [INFO ] Implicit Places using invariants in 5064 ms returned []
[2026-05-22 21:44:18] [INFO ] Invariant cache hit.
[2026-05-22 21:44:35] [INFO ] Implicit Places using invariants and state equation in 16173 ms returned []
Implicit Place search using SMT with State Equation took 21288 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3570/4014 places, 4303/4932 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40260 ms. Remains : 3570/4014 places, 4303/4932 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Applied a total of 0 rules in 329 ms. Remains 3570 /3570 variables (removed 0) and now considering 4303/4303 (removed 0) transitions.
[2026-05-22 21:44:35] [INFO ] Invariant cache hit.
[2026-05-22 21:44:38] [INFO ] Implicit Places using invariants in 3332 ms returned []
[2026-05-22 21:44:38] [INFO ] Invariant cache hit.
[2026-05-22 21:44:56] [INFO ] Implicit Places using invariants and state equation in 17134 ms returned []
Implicit Place search using SMT with State Equation took 20476 ms to find 0 implicit places.
Running 4302 sub problems to find dead transitions.
[2026-05-22 21:44:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3569 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3569/7873 variables, and 230 constraints, problems are : Problem set: 0 solved, 4302 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3570 constraints, PredecessorRefiner: 4302/4302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3569 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3569/7873 variables, and 230 constraints, problems are : Problem set: 0 solved, 4302 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3570 constraints, PredecessorRefiner: 0/4302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62504ms problems are : Problem set: 0 solved, 4302 unsolved
Search for dead transitions found 0 dead transitions in 62551ms
Finished structural reductions in LTL mode , in 1 iterations and 83455 ms. Remains : 3570/3570 places, 4303/4303 transitions.
Support contains 33 out of 3570 places after structural reductions.
[2026-05-22 21:45:59] [INFO ] Flatten gal took : 263 ms
[2026-05-22 21:45:59] [INFO ] Flatten gal took : 176 ms
[2026-05-22 21:45:59] [INFO ] Input system was already deterministic with 4303 transitions.
RANDOM walk for 40000 steps (52 resets) in 1792 ms. (22 steps per ms) remains 8/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
[2026-05-22 21:46:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 209/226 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1100/1326 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1326 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2102/3428 variables, 259/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3428 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 142/3570 variables, 46/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3570 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4303/7873 variables, 3570/3953 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7873/7873 variables, and 3953 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 305/305 constraints, State Equation: 3570/3570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 209/226 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1100/1326 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1326 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1326 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2102/3428 variables, 259/338 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 10340ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 3570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 653 transitions
Trivial Post-agglo rules discarded 653 transitions
Performed 653 trivial Post agglomeration. Transition count delta: 653
Iterating post reduction 0 with 653 rules applied. Total rules applied 653 place count 3570 transition count 3650
Reduce places removed 653 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 656 rules applied. Total rules applied 1309 place count 2917 transition count 3647
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 1317 place count 2915 transition count 3641
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1323 place count 2909 transition count 3641
Performed 957 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 957 Pre rules applied. Total rules applied 1323 place count 2909 transition count 2684
Deduced a syphon composed of 957 places in 10 ms
Ensure Unique test removed 93 places
Reduce places removed 1050 places and 0 transitions.
Iterating global reduction 4 with 2007 rules applied. Total rules applied 3330 place count 1859 transition count 2684
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 4 with 62 rules applied. Total rules applied 3392 place count 1851 transition count 2630
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 3446 place count 1797 transition count 2630
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 3446 place count 1797 transition count 2593
Deduced a syphon composed of 37 places in 9 ms
Ensure Unique test removed 35 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 109 rules applied. Total rules applied 3555 place count 1725 transition count 2593
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3557 place count 1724 transition count 2592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3558 place count 1723 transition count 2592
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 34 Pre rules applied. Total rules applied 3558 place count 1723 transition count 2558
Deduced a syphon composed of 34 places in 19 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 3626 place count 1689 transition count 2558
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 3629 place count 1686 transition count 2555
Iterating global reduction 8 with 3 rules applied. Total rules applied 3632 place count 1686 transition count 2555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3632 place count 1686 transition count 2554
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3634 place count 1685 transition count 2554
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 287
Deduced a syphon composed of 287 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 8 with 576 rules applied. Total rules applied 4210 place count 1396 transition count 2267
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 4214 place count 1392 transition count 2263
Ensure Unique test removed 1 places
Iterating global reduction 8 with 5 rules applied. Total rules applied 4219 place count 1391 transition count 2263
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 1 rules applied. Total rules applied 4220 place count 1391 transition count 2262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4221 place count 1390 transition count 2262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4221 place count 1390 transition count 2261
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4223 place count 1389 transition count 2261
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 4225 place count 1387 transition count 2259
Iterating global reduction 10 with 2 rules applied. Total rules applied 4227 place count 1387 transition count 2259
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 10 with 2 rules applied. Total rules applied 4229 place count 1387 transition count 2257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4230 place count 1386 transition count 2257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4232 place count 1385 transition count 2262
Free-agglomeration rule applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 4242 place count 1385 transition count 2252
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4252 place count 1375 transition count 2252
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 13 with 10 rules applied. Total rules applied 4262 place count 1375 transition count 2242
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4272 place count 1365 transition count 2242
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 4281 place count 1365 transition count 2242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 4282 place count 1364 transition count 2241
Reduce places removed 17 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 14 with 24 rules applied. Total rules applied 4306 place count 1347 transition count 2234
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 8 rules applied. Total rules applied 4314 place count 1340 transition count 2233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 4315 place count 1339 transition count 2233
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 26 Pre rules applied. Total rules applied 4315 place count 1339 transition count 2207
Deduced a syphon composed of 26 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 17 with 53 rules applied. Total rules applied 4368 place count 1312 transition count 2207
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 17 with 9 rules applied. Total rules applied 4377 place count 1303 transition count 2207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 4377 place count 1303 transition count 2206
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 4379 place count 1302 transition count 2206
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 18 with 34 rules applied. Total rules applied 4413 place count 1285 transition count 2189
Discarding 8 places :
Symmetric choice reduction at 18 with 8 rule applications. Total rules 4421 place count 1277 transition count 2181
Iterating global reduction 18 with 8 rules applied. Total rules applied 4429 place count 1277 transition count 2181
Free-agglomeration rule applied 7 times.
Iterating global reduction 18 with 7 rules applied. Total rules applied 4436 place count 1277 transition count 2174
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 4443 place count 1270 transition count 2174
Applied a total of 4443 rules in 1764 ms. Remains 1270 /3570 variables (removed 2300) and now considering 2174/4303 (removed 2129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1764 ms. Remains : 1270/3570 places, 2174/4303 transitions.
RANDOM walk for 40000 steps (416 resets) in 543 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (38 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 229 ms. (173 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (38 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14555226277833570804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13109940439618596768.kers'
[2026-05-22 21:46:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14555226277833570804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13109940439618596768.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 1 ms.
// Phase 1: matrix 2174 rows 1249 cols 8507 entries
Finished phase 1 with 355 SingleSign rule and 699 generalized
[2026-05-22 21:46:13] [INFO ] Computed 216 invariants in 20 ms
Computed 216 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-13109940439618596768.kers
Total runtime 23 ms.
[2026-05-22 21:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/159 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 19/178 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 334/512 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 130/642 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 53/695 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 345/1040 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 148/1188 variables, 30/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1188 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 8/1196 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 18/1214 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1214 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 56/1270 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1270 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 2174/3444 variables, 1270/1486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3444 variables, 1/1487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3444 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/3444 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3444/3444 variables, and 1487 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1270/1270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/159 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 19/178 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 334/512 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 130/642 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 53/695 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 345/1040 variables, 75/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 148/1188 variables, 30/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1188 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 8/1196 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 18/1214 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1214 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 56/1270 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1270 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 2174/3444 variables, 1270/1486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3444 variables, 1/1487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3444 variables, 7/1494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3444 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 0/3444 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3444/3444 variables, and 1494 constraints, problems are : Problem set: 0 solved, 7 unsolved in 36805 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1270/1270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40297ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 42184 ms.
Support contains 13 out of 1270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1270/1270 places, 2174/2174 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1270 transition count 2171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1267 transition count 2171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1267 transition count 2170
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 1265 transition count 2170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1264 transition count 2169
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1264 transition count 2168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 1263 transition count 2168
Applied a total of 13 rules in 178 ms. Remains 1263 /1270 variables (removed 7) and now considering 2168/2174 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 1263/1270 places, 2168/2174 transitions.
RANDOM walk for 40000 steps (381 resets) in 435 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 156322 steps, run timeout after 3010 ms. (steps per millisecond=51 ) properties seen :0 out of 7
Probabilistic random walk after 156322 steps, saw 34879 distinct states, run finished after 3035 ms. (steps per millisecond=51 ) 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-15624292689211686218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-972276346914812230.kers'
[2026-05-22 21:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15624292689211686218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-972276346914812230.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 1 ms.
// Phase 1: matrix 2168 rows 1242 cols 8495 entries
Finished phase 1 with 348 SingleSign rule and 700 generalized
[2026-05-22 21:47:39] [INFO ] Computed 215 invariants in 21 ms
Computed 215 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-972276346914812230.kers
Total runtime 37 ms.
[2026-05-22 21:47:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/144 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/147 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/149 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 338/487 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 146/633 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/633 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 55/688 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 305/993 variables, 67/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/993 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 137/1130 variables, 25/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 5/1135 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1135 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 1/1136 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1136 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 103/1239 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 20/1259 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1259 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 4/1263 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1263 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 2168/3431 variables, 1263/1478 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3431 variables, 1/1479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 0/1479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 0/3431 variables, 0/1479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1479 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3983 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 1263/1263 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/144 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/147 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/149 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 338/487 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 146/633 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/633 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 55/688 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 305/993 variables, 67/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/993 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/993 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 137/1130 variables, 25/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1130 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 5/1135 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 1/1136 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1136 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 103/1239 variables, 22/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1239 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 20/1259 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1259 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 4/1263 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1263 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 2168/3431 variables, 1263/1479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 1/1480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3431 variables, 7/1487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3431 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3431 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 0/3431 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1488 constraints, problems are : Problem set: 0 solved, 7 unsolved in 41969 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 1263/1263 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46058ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26707 ms.
Support contains 13 out of 1263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 2168/2168 transitions.
Applied a total of 0 rules in 56 ms. Remains 1263 /1263 variables (removed 0) and now considering 2168/2168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1263/1263 places, 2168/2168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 2168/2168 transitions.
Applied a total of 0 rules in 51 ms. Remains 1263 /1263 variables (removed 0) and now considering 2168/2168 (removed 0) transitions.
[2026-05-22 21:48:52] [INFO ] Invariant cache hit.
[2026-05-22 21:48:54] [INFO ] Implicit Places using invariants in 1677 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 388, 392, 393, 406, 407, 409, 426, 444, 513, 517, 518, 529, 530, 532, 549, 567, 602, 642, 646, 647, 658, 659, 679, 697, 766, 770, 771, 782, 783, 785, 802, 820, 890, 894, 895, 906, 907, 909, 926, 944, 1017, 1021, 1022, 1033, 1034, 1036, 1053, 1071, 1140, 1144, 1145, 1148, 1159, 1160, 1161, 1179, 1201, 1204, 1205]
[2026-05-22 21:48:54] [INFO ] Actually due to overlaps returned [1179, 1161, 48, 170, 276, 293, 426, 549, 679, 802, 926, 1053, 31, 151, 409, 532, 785, 909, 1036, 148, 273, 406, 529, 658, 782, 906, 1033, 1159, 149, 274, 407, 530, 659, 783, 907, 1034, 1160, 1201, 1, 18, 261, 262, 392, 393, 517, 518, 646, 647, 770, 771, 894, 895, 1021, 1022, 1144, 1145, 66, 188, 311, 444, 567, 697, 820, 944, 1071, 1204, 19, 766, 1148, 1205]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1698 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1193/1263 places, 2168/2168 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 1185 transition count 2022
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 155 rules applied. Total rules applied 309 place count 1039 transition count 2013
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 312 place count 1036 transition count 2013
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 312 place count 1036 transition count 1975
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 388 place count 998 transition count 1975
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 389 place count 997 transition count 1974
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 997 transition count 1974
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 391 place count 996 transition count 1973
Iterating global reduction 3 with 1 rules applied. Total rules applied 392 place count 996 transition count 1973
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 393 place count 995 transition count 1972
Iterating global reduction 3 with 1 rules applied. Total rules applied 394 place count 995 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 995 transition count 1971
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 5 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 525 place count 930 transition count 1906
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 532 place count 923 transition count 1899
Iterating global reduction 4 with 7 rules applied. Total rules applied 539 place count 923 transition count 1899
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 546 place count 923 transition count 1892
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 550 place count 921 transition count 1893
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 921 transition count 1892
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 5 with 26 rules applied. Total rules applied 577 place count 921 transition count 1866
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 604 place count 894 transition count 1866
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 605 place count 894 transition count 1865
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 633 place count 894 transition count 1865
Applied a total of 633 rules in 580 ms. Remains 894 /1193 variables (removed 299) and now considering 1865/2168 (removed 303) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12041861970500799131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1941440621305557297.kers'
[2026-05-22 21:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12041861970500799131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1941440621305557297.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 1865 rows 892 cols 7611 entries
Finished phase 1 with 280 SingleSign rule and 478 generalized
[2026-05-22 21:48:54] [INFO ] Computed 136 invariants in 17 ms
Computed 136 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-1941440621305557297.kers
Total runtime 32 ms.
[2026-05-22 21:48:56] [INFO ] Implicit Places using invariants in 1504 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 160, 176, 182, 185, 187, 192, 193, 246, 263, 269, 272, 274, 283, 284, 339, 355, 361, 364, 366, 371, 372, 425, 433, 447, 453, 456, 458, 463, 464, 521, 541, 547, 550, 552, 557, 558, 612, 628, 634, 637, 639, 644, 645, 716, 722, 725, 727, 733, 734, 787, 803, 809, 812, 814, 881, 884, 887, 890, 893]
[2026-05-22 21:48:56] [INFO ] Actually due to overlaps returned [104, 192, 283, 371, 463, 557, 644, 733, 105, 193, 284, 372, 464, 558, 645, 734, 89, 95, 100, 176, 182, 187, 263, 269, 274, 355, 361, 366, 447, 453, 458, 541, 547, 552, 628, 634, 639, 716, 722, 727, 803, 809, 814, 73, 101, 160, 246, 339, 425, 433, 521, 612, 787, 881, 884, 887, 890, 893]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1517 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 836/1263 places, 1865/2168 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 796 transition count 1825
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 796 transition count 1825
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 92 place count 784 transition count 1813
Iterating global reduction 0 with 12 rules applied. Total rules applied 104 place count 784 transition count 1813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 784 transition count 1810
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 139 place count 768 transition count 1794
Free-agglomeration rule applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 166 place count 768 transition count 1767
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 193 place count 741 transition count 1767
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 200 place count 741 transition count 1760
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 207 place count 734 transition count 1760
Applied a total of 207 rules in 367 ms. Remains 734 /836 variables (removed 102) and now considering 1760/1865 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-27999622938680172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2566296265831108229.kers'
[2026-05-22 21:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-27999622938680172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2566296265831108229.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1760 rows 733 cols 7126 entries
Finished phase 1 with 187 SingleSign rule and 469 generalized
[2026-05-22 21:48:56] [INFO ] Computed 78 invariants in 34 ms
Computed 78 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-2566296265831108229.kers
Total runtime 37 ms.
[2026-05-22 21:48:59] [INFO ] Implicit Places using invariants in 2698 ms returned []
[2026-05-22 21:48:59] [INFO ] Invariant cache hit.
[2026-05-22 21:49:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 21:49:01] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 5057 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 734/1263 places, 1760/2168 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9278 ms. Remains : 734/1263 places, 1760/2168 transitions.
Computed a total of 149 stabilizing places and 149 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' '!(F(p0))'
Support contains 2 out of 3570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 669 rules applied. Total rules applied 669 place count 3569 transition count 3633
Reduce places removed 669 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 672 rules applied. Total rules applied 1341 place count 2900 transition count 3630
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1343 place count 2898 transition count 3630
Performed 962 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 962 Pre rules applied. Total rules applied 1343 place count 2898 transition count 2668
Deduced a syphon composed of 962 places in 9 ms
Ensure Unique test removed 94 places
Reduce places removed 1056 places and 0 transitions.
Iterating global reduction 3 with 2018 rules applied. Total rules applied 3361 place count 1842 transition count 2668
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3428 place count 1833 transition count 2610
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3486 place count 1775 transition count 2610
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3486 place count 1775 transition count 2573
Deduced a syphon composed of 37 places in 9 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3597 place count 1701 transition count 2573
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3597 place count 1701 transition count 2537
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3669 place count 1665 transition count 2537
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 3676 place count 1658 transition count 2530
Iterating global reduction 5 with 7 rules applied. Total rules applied 3683 place count 1658 transition count 2530
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 3683 place count 1658 transition count 2526
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3691 place count 1654 transition count 2526
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 5 with 562 rules applied. Total rules applied 4253 place count 1372 transition count 2246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4257 place count 1368 transition count 2242
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4262 place count 1367 transition count 2242
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 4263 place count 1367 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4264 place count 1366 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4264 place count 1366 transition count 2240
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4266 place count 1365 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4268 place count 1363 transition count 2238
Iterating global reduction 7 with 2 rules applied. Total rules applied 4270 place count 1363 transition count 2238
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 4272 place count 1363 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4273 place count 1362 transition count 2236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4275 place count 1361 transition count 2241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4277 place count 1359 transition count 2239
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4304 place count 1341 transition count 2230
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4313 place count 1332 transition count 2230
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4313 place count 1332 transition count 2203
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4368 place count 1304 transition count 2203
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 4387 place count 1285 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4387 place count 1285 transition count 2202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4389 place count 1284 transition count 2202
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 4445 place count 1256 transition count 2174
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 4463 place count 1238 transition count 2156
Iterating global reduction 12 with 18 rules applied. Total rules applied 4481 place count 1238 transition count 2156
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 4490 place count 1229 transition count 2147
Iterating global reduction 12 with 9 rules applied. Total rules applied 4499 place count 1229 transition count 2147
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4508 place count 1229 transition count 2138
Applied a total of 4508 rules in 1051 ms. Remains 1229 /3570 variables (removed 2341) and now considering 2138/4303 (removed 2165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14031906680392147967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10209068576946147637.kers'
[2026-05-22 21:49:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14031906680392147967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10209068576946147637.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 2138 rows 1200 cols 8317 entries
Finished phase 1 with 276 SingleSign rule and 751 generalized
[2026-05-22 21:49:03] [INFO ] Computed 202 invariants in 22 ms
Computed 202 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-10209068576946147637.kers
Total runtime 37 ms.
[2026-05-22 21:49:04] [INFO ] Implicit Places using invariants in 1605 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, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 816, 867, 868, 880, 881, 883, 900, 918, 938, 989, 990, 1002, 1003, 1005, 1022, 1040, 1060, 1111, 1112, 1115, 1126, 1127, 1128, 1146, 1167, 1168, 1169, 1170]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1611 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1148/3570 places, 2138/4303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1148 transition count 1990
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 296 place count 1000 transition count 1990
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 296 place count 1000 transition count 1947
Deduced a syphon composed of 43 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 383 place count 956 transition count 1947
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 395 place count 952 transition count 1939
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 403 place count 944 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 406 place count 941 transition count 1936
Iterating global reduction 4 with 3 rules applied. Total rules applied 409 place count 941 transition count 1936
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 412 place count 941 transition count 1933
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 550 place count 872 transition count 1864
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 554 place count 870 transition count 1865
Applied a total of 554 rules in 215 ms. Remains 870 /1148 variables (removed 278) and now considering 1865/2138 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11243634659543932632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11500311341880384080.kers'
[2026-05-22 21:49:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11243634659543932632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11500311341880384080.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1865 rows 870 cols 7510 entries
Finished phase 1 with 245 SingleSign rule and 509 generalized
[2026-05-22 21:49:05] [INFO ] Computed 116 invariants in 52 ms
Computed 116 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-11500311341880384080.kers
Total runtime 57 ms.
[2026-05-22 21:49:05] [INFO ] Implicit Places using invariants in 829 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 615, 621, 626, 703, 709, 714, 791, 797, 802, 867]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 831 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 842/3570 places, 1865/4303 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 842 transition count 1864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 841 transition count 1864
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 823 transition count 1846
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 823 transition count 1846
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 805 transition count 1828
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 805 transition count 1828
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 796 transition count 1819
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 796 transition count 1819
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 787 transition count 1810
Applied a total of 110 rules in 144 ms. Remains 787 /842 variables (removed 55) and now considering 1810/1865 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2105630096185370621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11913548324171985209.kers'
[2026-05-22 21:49:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2105630096185370621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11913548324171985209.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1810 rows 787 cols 7307 entries
Finished phase 1 with 227 SingleSign rule and 472 generalized
[2026-05-22 21:49:05] [INFO ] Computed 88 invariants in 37 ms
Computed 88 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-11913548324171985209.kers
Total runtime 39 ms.
[2026-05-22 21:49:06] [INFO ] Implicit Places using invariants in 820 ms returned []
[2026-05-22 21:49:06] [INFO ] Invariant cache hit.
[2026-05-22 21:49:08] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 787/3570 places, 1810/4303 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6828 ms. Remains : 787/3570 places, 1810/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 217 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-02
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-09b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLCardinality-02 finished in 7167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3569 transition count 3636
Reduce places removed 666 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 669 rules applied. Total rules applied 1335 place count 2903 transition count 3633
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 1338 place count 2901 transition count 3632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1339 place count 2900 transition count 3632
Performed 962 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 962 Pre rules applied. Total rules applied 1339 place count 2900 transition count 2670
Deduced a syphon composed of 962 places in 8 ms
Ensure Unique test removed 93 places
Reduce places removed 1055 places and 0 transitions.
Iterating global reduction 4 with 2017 rules applied. Total rules applied 3356 place count 1845 transition count 2670
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 4 with 67 rules applied. Total rules applied 3423 place count 1836 transition count 2612
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 3481 place count 1778 transition count 2612
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 36 Pre rules applied. Total rules applied 3481 place count 1778 transition count 2576
Deduced a syphon composed of 36 places in 8 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 3589 place count 1706 transition count 2576
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 35 Pre rules applied. Total rules applied 3589 place count 1706 transition count 2541
Deduced a syphon composed of 35 places in 8 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 3659 place count 1671 transition count 2541
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 3665 place count 1665 transition count 2535
Iterating global reduction 6 with 6 rules applied. Total rules applied 3671 place count 1665 transition count 2535
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 3671 place count 1665 transition count 2532
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3677 place count 1662 transition count 2532
Performed 283 Post agglomeration using F-continuation condition.Transition count delta: 283
Deduced a syphon composed of 283 places in 5 ms
Ensure Unique test removed 3 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 6 with 569 rules applied. Total rules applied 4246 place count 1376 transition count 2249
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4250 place count 1372 transition count 2245
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4255 place count 1371 transition count 2245
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 4256 place count 1371 transition count 2244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4257 place count 1370 transition count 2244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4257 place count 1370 transition count 2243
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 4259 place count 1369 transition count 2243
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4261 place count 1367 transition count 2241
Iterating global reduction 8 with 2 rules applied. Total rules applied 4263 place count 1367 transition count 2241
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 4265 place count 1367 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4266 place count 1366 transition count 2239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4268 place count 1365 transition count 2244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4270 place count 1363 transition count 2242
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 10 with 27 rules applied. Total rules applied 4297 place count 1345 transition count 2233
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4306 place count 1336 transition count 2233
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 27 Pre rules applied. Total rules applied 4306 place count 1336 transition count 2206
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 55 rules applied. Total rules applied 4361 place count 1308 transition count 2206
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 4380 place count 1289 transition count 2206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4380 place count 1289 transition count 2205
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4382 place count 1288 transition count 2205
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 56 rules applied. Total rules applied 4438 place count 1260 transition count 2177
Discarding 18 places :
Symmetric choice reduction at 13 with 18 rule applications. Total rules 4456 place count 1242 transition count 2159
Iterating global reduction 13 with 18 rules applied. Total rules applied 4474 place count 1242 transition count 2159
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 4483 place count 1233 transition count 2150
Iterating global reduction 13 with 9 rules applied. Total rules applied 4492 place count 1233 transition count 2150
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4501 place count 1233 transition count 2141
Applied a total of 4501 rules in 1068 ms. Remains 1233 /3570 variables (removed 2337) and now considering 2141/4303 (removed 2162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8453566520292016437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9782930095890085438.kers'
[2026-05-22 21:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8453566520292016437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9782930095890085438.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 4 ms.
// Phase 1: matrix 2141 rows 1204 cols 8325 entries
Finished phase 1 with 277 SingleSign rule and 753 generalized
[2026-05-22 21:49:10] [INFO ] Computed 203 invariants in 61 ms
Computed 203 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-9782930095890085438.kers
Total runtime 66 ms.
[2026-05-22 21:49:12] [INFO ] Implicit Places using invariants in 1816 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, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 860, 871, 872, 884, 885, 887, 904, 922, 942, 993, 994, 1006, 1007, 1009, 1026, 1044, 1064, 1115, 1116, 1119, 1130, 1131, 1132, 1150, 1171, 1172, 1173, 1174]
[2026-05-22 21:49:12] [INFO ] Actually due to overlaps returned [1150, 1132, 48, 167, 289, 413, 535, 657, 779, 904, 1026, 31, 147, 150, 269, 272, 391, 394, 515, 518, 637, 640, 759, 762, 884, 887, 1006, 1009, 1130, 1171, 148, 270, 392, 516, 638, 760, 885, 1007, 1131, 1172, 1, 18, 256, 257, 378, 379, 502, 503, 624, 625, 746, 747, 871, 872, 993, 994, 1115, 1116, 1173, 19, 66, 86, 137, 185, 205, 307, 327, 431, 451, 553, 573, 675, 695, 797, 817, 922, 942, 1044, 1064, 1119, 1174]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1829 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1152/3570 places, 2141/4303 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1151 transition count 1994
Reduce places removed 147 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 296 place count 1004 transition count 1993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 1003 transition count 1993
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 297 place count 1003 transition count 1950
Deduced a syphon composed of 43 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 384 place count 959 transition count 1950
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 396 place count 955 transition count 1942
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 404 place count 947 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 407 place count 944 transition count 1939
Iterating global reduction 5 with 3 rules applied. Total rules applied 410 place count 944 transition count 1939
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 413 place count 944 transition count 1936
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 4 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 551 place count 875 transition count 1867
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 555 place count 873 transition count 1868
Applied a total of 555 rules in 182 ms. Remains 873 /1152 variables (removed 279) and now considering 1868/2141 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6834756066156041613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17912908472899451394.kers'
[2026-05-22 21:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6834756066156041613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17912908472899451394.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1868 rows 873 cols 7516 entries
Finished phase 1 with 248 SingleSign rule and 509 generalized
[2026-05-22 21:49:12] [INFO ] Computed 116 invariants in 39 ms
Computed 116 P flows in 54 ms.
Exported basis to /tmp/petrispot-output-17912908472899451394.kers
Total runtime 58 ms.
[2026-05-22 21:49:13] [INFO ] Implicit Places using invariants in 1029 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 629, 706, 712, 717, 794, 800, 805, 870]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 846/3570 places, 1868/4303 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 846 transition count 1867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 845 transition count 1867
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 19 place count 828 transition count 1850
Iterating global reduction 2 with 17 rules applied. Total rules applied 36 place count 828 transition count 1850
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 53 place count 811 transition count 1833
Iterating global reduction 2 with 17 rules applied. Total rules applied 70 place count 811 transition count 1833
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 803 transition count 1825
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 803 transition count 1825
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 104 place count 794 transition count 1816
Applied a total of 104 rules in 145 ms. Remains 794 /846 variables (removed 52) and now considering 1816/1868 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14050662008884523223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14014106990962277164.kers'
[2026-05-22 21:49:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14050662008884523223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14014106990962277164.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1816 rows 794 cols 7324 entries
Finished phase 1 with 231 SingleSign rule and 474 generalized
[2026-05-22 21:49:13] [INFO ] Computed 89 invariants in 49 ms
Computed 89 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-14014106990962277164.kers
Total runtime 54 ms.
[2026-05-22 21:49:14] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2026-05-22 21:49:14] [INFO ] Invariant cache hit.
[2026-05-22 21:49:16] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 794/3570 places, 1816/4303 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7675 ms. Remains : 794/3570 places, 1816/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-04
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-09b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLCardinality-04 finished in 7773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Support contains 4 out of 3570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3563 transition count 4296
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3563 transition count 4296
Applied a total of 14 rules in 738 ms. Remains 3563 /3570 variables (removed 7) and now considering 4296/4303 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-695048279252089658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17028023213330625104.kers'
[2026-05-22 21:49:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-695048279252089658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17028023213330625104.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4296 rows 3563 cols 13244 entries
Finished phase 1 with 2318 SingleSign rule and 862 generalized
[2026-05-22 21:49:17] [INFO ] Computed 383 invariants in 44 ms
Computed 383 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-17028023213330625104.kers
Total runtime 60 ms.
[2026-05-22 21:49:20] [INFO ] Implicit Places using invariants in 3119 ms returned []
[2026-05-22 21:49:20] [INFO ] Invariant cache hit.
[2026-05-22 21:49:36] [INFO ] Implicit Places using invariants and state equation in 15822 ms returned []
Implicit Place search using SMT with State Equation took 18952 ms to find 0 implicit places.
Running 4295 sub problems to find dead transitions.
[2026-05-22 21:49:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 4295/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 0/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62800ms problems are : Problem set: 0 solved, 4295 unsolved
Search for dead transitions found 0 dead transitions in 62824ms
Starting structural reductions in LTL mode, iteration 1 : 3563/3570 places, 4296/4303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82542 ms. Remains : 3563/3570 places, 4296/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&p1)))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 873 ms.
Product exploration explored 100000 steps with 33333 reset in 817 ms.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 15 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 59 ms.
FORMULA ASLink-PT-09b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09b-LTLCardinality-07 finished in 84527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&F(p2)))))'
Support contains 6 out of 3570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 662 place count 3569 transition count 3640
Reduce places removed 662 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 665 rules applied. Total rules applied 1327 place count 2907 transition count 3637
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 1332 place count 2905 transition count 3634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1335 place count 2902 transition count 3634
Performed 961 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 961 Pre rules applied. Total rules applied 1335 place count 2902 transition count 2673
Deduced a syphon composed of 961 places in 8 ms
Ensure Unique test removed 94 places
Reduce places removed 1055 places and 0 transitions.
Iterating global reduction 4 with 2016 rules applied. Total rules applied 3351 place count 1847 transition count 2673
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 4 with 64 rules applied. Total rules applied 3415 place count 1839 transition count 2617
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 3471 place count 1783 transition count 2617
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 3471 place count 1783 transition count 2579
Deduced a syphon composed of 38 places in 9 ms
Ensure Unique test removed 36 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 3583 place count 1709 transition count 2579
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3585 place count 1708 transition count 2578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3586 place count 1707 transition count 2578
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 35 Pre rules applied. Total rules applied 3586 place count 1707 transition count 2543
Deduced a syphon composed of 35 places in 8 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 3656 place count 1672 transition count 2543
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3663 place count 1665 transition count 2536
Iterating global reduction 8 with 7 rules applied. Total rules applied 3670 place count 1665 transition count 2536
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 3670 place count 1665 transition count 2532
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3678 place count 1661 transition count 2532
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 10 ms
Ensure Unique test removed 2 places
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 8 with 562 rules applied. Total rules applied 4240 place count 1379 transition count 2252
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 4244 place count 1375 transition count 2248
Ensure Unique test removed 1 places
Iterating global reduction 8 with 5 rules applied. Total rules applied 4249 place count 1374 transition count 2248
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 1 rules applied. Total rules applied 4250 place count 1374 transition count 2247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4251 place count 1373 transition count 2247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4251 place count 1373 transition count 2246
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 4253 place count 1372 transition count 2246
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 4255 place count 1370 transition count 2244
Iterating global reduction 10 with 2 rules applied. Total rules applied 4257 place count 1370 transition count 2244
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 10 with 2 rules applied. Total rules applied 4259 place count 1370 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4260 place count 1369 transition count 2242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4262 place count 1368 transition count 2247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4264 place count 1366 transition count 2245
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 12 with 27 rules applied. Total rules applied 4291 place count 1348 transition count 2236
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4300 place count 1339 transition count 2236
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 27 Pre rules applied. Total rules applied 4300 place count 1339 transition count 2209
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 55 rules applied. Total rules applied 4355 place count 1311 transition count 2209
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 4374 place count 1292 transition count 2209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4374 place count 1292 transition count 2208
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4376 place count 1291 transition count 2208
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 15 with 56 rules applied. Total rules applied 4432 place count 1263 transition count 2180
Discarding 18 places :
Symmetric choice reduction at 15 with 18 rule applications. Total rules 4450 place count 1245 transition count 2162
Iterating global reduction 15 with 18 rules applied. Total rules applied 4468 place count 1245 transition count 2162
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 4477 place count 1236 transition count 2153
Iterating global reduction 15 with 9 rules applied. Total rules applied 4486 place count 1236 transition count 2153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 4495 place count 1236 transition count 2144
Applied a total of 4495 rules in 1027 ms. Remains 1236 /3570 variables (removed 2334) and now considering 2144/4303 (removed 2159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15221553058052935895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15321832421410891089.kers'
[2026-05-22 21:50:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15221553058052935895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15321832421410891089.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 2144 rows 1207 cols 8329 entries
Finished phase 1 with 290 SingleSign rule and 743 generalized
[2026-05-22 21:50:42] [INFO ] Computed 203 invariants in 21 ms
Computed 203 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-15321832421410891089.kers
Total runtime 24 ms.
[2026-05-22 21:50:43] [INFO ] Implicit Places using invariants in 1449 ms returned [1, 18, 19, 31, 48, 66, 87, 138, 148, 149, 151, 170, 188, 208, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 761, 762, 764, 781, 799, 819, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 1005, 1006, 1008, 1025, 1043, 1063, 1111, 1117, 1118, 1121, 1132, 1133, 1134, 1152, 1173, 1174, 1175, 1176]
[2026-05-22 21:50:43] [INFO ] Actually due to overlaps returned [1152, 1134, 48, 170, 293, 415, 537, 659, 781, 903, 1025, 31, 148, 151, 273, 276, 395, 398, 517, 520, 639, 642, 761, 764, 883, 886, 1005, 1008, 1132, 1173, 149, 274, 396, 518, 640, 762, 884, 1006, 1133, 1174, 1, 18, 260, 261, 382, 383, 504, 505, 626, 627, 748, 749, 870, 871, 992, 993, 1117, 1118, 1175, 19, 66, 87, 138, 188, 208, 311, 331, 433, 453, 555, 575, 677, 697, 799, 819, 921, 941, 1043, 1063, 1121, 1176]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1463 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1155/3570 places, 2144/4303 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1154 transition count 1997
Reduce places removed 147 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 1007 transition count 1995
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 299 place count 1005 transition count 1995
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 299 place count 1005 transition count 1952
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 386 place count 961 transition count 1952
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 398 place count 957 transition count 1944
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 406 place count 949 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 409 place count 946 transition count 1941
Iterating global reduction 5 with 3 rules applied. Total rules applied 412 place count 946 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 415 place count 946 transition count 1938
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 551 place count 878 transition count 1870
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 555 place count 876 transition count 1871
Applied a total of 555 rules in 182 ms. Remains 876 /1155 variables (removed 279) and now considering 1871/2144 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16378715096238078558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15710704858517456952.kers'
[2026-05-22 21:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16378715096238078558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15710704858517456952.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1871 rows 876 cols 7520 entries
Finished phase 1 with 299 SingleSign rule and 461 generalized
[2026-05-22 21:50:44] [INFO ] Computed 116 invariants in 18 ms
Computed 116 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-15710704858517456952.kers
Total runtime 22 ms.
[2026-05-22 21:50:45] [INFO ] Implicit Places using invariants in 982 ms returned [89, 95, 100, 177, 184, 189, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 706, 712, 717, 794, 800, 873]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 988 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 849/3570 places, 1871/4303 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 832 transition count 1854
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 832 transition count 1854
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 815 transition count 1837
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 815 transition count 1837
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 806 transition count 1828
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 806 transition count 1828
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 104 place count 797 transition count 1819
Applied a total of 104 rules in 154 ms. Remains 797 /849 variables (removed 52) and now considering 1819/1871 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4442806961740525574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13179177062649170952.kers'
[2026-05-22 21:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4442806961740525574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13179177062649170952.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1819 rows 797 cols 7326 entries
Finished phase 1 with 243 SingleSign rule and 465 generalized
[2026-05-22 21:50:45] [INFO ] Computed 89 invariants in 17 ms
Computed 89 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-13179177062649170952.kers
Total runtime 28 ms.
[2026-05-22 21:50:46] [INFO ] Implicit Places using invariants in 871 ms returned []
[2026-05-22 21:50:46] [INFO ] Invariant cache hit.
[2026-05-22 21:50:48] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 3175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 797/3570 places, 1819/4303 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6991 ms. Remains : 797/3570 places, 1819/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(p1)&&p2))))'
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-08
Product exploration explored 100000 steps with 1042 reset in 451 ms.
Stack based approach found an accepted trace after 47496 steps with 546 reset with depth 60 and stack size 60 in 215 ms.
FORMULA ASLink-PT-09b-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-09b-LTLCardinality-08 finished in 7905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 3570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3569 transition count 3636
Reduce places removed 666 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 669 rules applied. Total rules applied 1335 place count 2903 transition count 3633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1337 place count 2901 transition count 3633
Performed 962 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 962 Pre rules applied. Total rules applied 1337 place count 2901 transition count 2671
Deduced a syphon composed of 962 places in 8 ms
Ensure Unique test removed 93 places
Reduce places removed 1055 places and 0 transitions.
Iterating global reduction 3 with 2017 rules applied. Total rules applied 3354 place count 1846 transition count 2671
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 3 with 67 rules applied. Total rules applied 3421 place count 1836 transition count 2614
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 3478 place count 1779 transition count 2614
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3478 place count 1779 transition count 2577
Deduced a syphon composed of 37 places in 8 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3589 place count 1705 transition count 2577
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3589 place count 1705 transition count 2541
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3661 place count 1669 transition count 2541
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 3668 place count 1662 transition count 2534
Iterating global reduction 5 with 7 rules applied. Total rules applied 3675 place count 1662 transition count 2534
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 3675 place count 1662 transition count 2530
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3683 place count 1658 transition count 2530
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 279
Deduced a syphon composed of 279 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 5 with 560 rules applied. Total rules applied 4243 place count 1377 transition count 2251
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4247 place count 1373 transition count 2247
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4252 place count 1372 transition count 2247
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 4253 place count 1372 transition count 2246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4254 place count 1371 transition count 2246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4254 place count 1371 transition count 2245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4256 place count 1370 transition count 2245
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4258 place count 1368 transition count 2243
Iterating global reduction 7 with 2 rules applied. Total rules applied 4260 place count 1368 transition count 2243
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 4262 place count 1368 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4263 place count 1367 transition count 2241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4265 place count 1366 transition count 2246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4267 place count 1364 transition count 2244
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4294 place count 1346 transition count 2235
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4303 place count 1337 transition count 2235
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4303 place count 1337 transition count 2208
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4358 place count 1309 transition count 2208
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 11 with 18 rules applied. Total rules applied 4376 place count 1291 transition count 2208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4376 place count 1291 transition count 2207
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4378 place count 1290 transition count 2207
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 4432 place count 1263 transition count 2180
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4448 place count 1247 transition count 2164
Iterating global reduction 12 with 16 rules applied. Total rules applied 4464 place count 1247 transition count 2164
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4472 place count 1239 transition count 2156
Iterating global reduction 12 with 8 rules applied. Total rules applied 4480 place count 1239 transition count 2156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4488 place count 1239 transition count 2148
Applied a total of 4488 rules in 908 ms. Remains 1239 /3570 variables (removed 2331) and now considering 2148/4303 (removed 2155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17328838701235250053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14092194247958333019.kers'
[2026-05-22 21:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17328838701235250053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14092194247958333019.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 4 ms.
// Phase 1: matrix 2148 rows 1212 cols 8359 entries
Finished phase 1 with 269 SingleSign rule and 767 generalized
[2026-05-22 21:50:50] [INFO ] Computed 203 invariants in 62 ms
Computed 203 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-14092194247958333019.kers
Total runtime 67 ms.
[2026-05-22 21:50:52] [INFO ] Implicit Places using invariants in 2121 ms returned [1, 18, 19, 31, 49, 67, 87, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 451, 503, 504, 516, 517, 519, 536, 554, 574, 623, 630, 631, 643, 644, 646, 663, 681, 701, 752, 753, 765, 766, 768, 785, 803, 877, 878, 890, 891, 893, 910, 928, 948, 999, 1000, 1012, 1013, 1015, 1032, 1050, 1070, 1121, 1122, 1125, 1136, 1137, 1138, 1156, 1177, 1178, 1179, 1180]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 2131 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1158/3570 places, 2148/4303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1158 transition count 1999
Reduce places removed 149 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 299 place count 1009 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 300 place count 1008 transition count 1998
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 300 place count 1008 transition count 1955
Deduced a syphon composed of 43 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 387 place count 964 transition count 1955
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 399 place count 960 transition count 1947
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 407 place count 952 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 410 place count 949 transition count 1944
Iterating global reduction 5 with 3 rules applied. Total rules applied 413 place count 949 transition count 1944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 416 place count 949 transition count 1941
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 554 place count 880 transition count 1872
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 558 place count 878 transition count 1873
Applied a total of 558 rules in 161 ms. Remains 878 /1158 variables (removed 280) and now considering 1873/2148 (removed 275) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11942189919715891177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16309369113806337939.kers'
[2026-05-22 21:50:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11942189919715891177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16309369113806337939.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1873 rows 878 cols 7525 entries
Finished phase 1 with 249 SingleSign rule and 512 generalized
[2026-05-22 21:50:52] [INFO ] Computed 117 invariants in 24 ms
Computed 117 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-16309369113806337939.kers
Total runtime 26 ms.
[2026-05-22 21:50:53] [INFO ] Implicit Places using invariants in 1027 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 353, 359, 364, 441, 447, 452, 531, 537, 542, 622, 628, 633, 711, 717, 722, 799, 805, 810, 875]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1038 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 850/3570 places, 1873/4303 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 850 transition count 1872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 849 transition count 1872
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 831 transition count 1854
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 831 transition count 1854
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 813 transition count 1836
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 813 transition count 1836
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 804 transition count 1827
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 804 transition count 1827
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 795 transition count 1818
Applied a total of 110 rules in 128 ms. Remains 795 /850 variables (removed 55) and now considering 1818/1873 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8151243602626045786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-637294615308674821.kers'
[2026-05-22 21:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8151243602626045786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-637294615308674821.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1818 rows 795 cols 7322 entries
Finished phase 1 with 231 SingleSign rule and 475 generalized
[2026-05-22 21:50:53] [INFO ] Computed 89 invariants in 52 ms
Computed 89 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-637294615308674821.kers
Total runtime 56 ms.
[2026-05-22 21:50:54] [INFO ] Implicit Places using invariants in 767 ms returned []
[2026-05-22 21:50:54] [INFO ] Invariant cache hit.
[2026-05-22 21:50:57] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 795/3570 places, 1818/4303 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7653 ms. Remains : 795/3570 places, 1818/4303 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 (G(!p0)||p1))))'
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-10
Product exploration explored 100000 steps with 7427 reset in 481 ms.
Product exploration explored 100000 steps with 7480 reset in 431 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 3 factoid took 291 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (414 resets) in 199 ms. (200 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
[2026-05-22 21:50:58] [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) 125/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/196 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/585 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/644 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/654 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/789 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/795 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1818/2613 variables, 795/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2613 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2613 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2613/2613 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 795/795 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) 125/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/196 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/585 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/644 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/654 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 135/789 variables, 36/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/795 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1818/2613 variables, 795/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2613 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2613 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2613 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2613/2613 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2162 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 795/795 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 795/795 places, 1818/1818 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 795 transition count 1773
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 98 place count 750 transition count 1765
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 124 place count 750 transition count 1739
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 150 place count 724 transition count 1739
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 151 place count 724 transition count 1738
Applied a total of 151 rules in 125 ms. Remains 724 /795 variables (removed 71) and now considering 1738/1818 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 724/795 places, 1738/1818 transitions.
RANDOM walk for 40000 steps (656 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 307534 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 307534 steps, saw 70638 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7486797069503962991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5556158141274141960.kers'
[2026-05-22 21:51:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7486797069503962991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5556158141274141960.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1738 rows 724 cols 7296 entries
Finished phase 1 with 219 SingleSign rule and 416 generalized
[2026-05-22 21:51:05] [INFO ] Computed 89 invariants in 49 ms
Computed 89 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-5556158141274141960.kers
Total runtime 54 ms.
[2026-05-22 21:51:05] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/544 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/602 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/612 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 107/719 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/724 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1738/2462 variables, 724/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2462 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2462 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2462 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2462/2462 variables, and 814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 724/724 constraints, ReadFeed: 1/1 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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/544 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/602 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/612 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 107/719 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/724 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/724 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1738/2462 variables, 724/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2462 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2462 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2462 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2462 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2462/2462 variables, and 816 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 724/724 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 31 ms. Remains 724 /724 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 724/724 places, 1738/1738 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 31 ms. Remains 724 /724 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
[2026-05-22 21:51:07] [INFO ] Invariant cache hit.
[2026-05-22 21:51:08] [INFO ] Implicit Places using invariants in 698 ms returned [89, 90, 160, 161, 231, 232, 304, 305, 376, 377, 447, 448, 523, 524, 594, 595]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 713 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 708/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 32 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 776 ms. Remains : 708/724 places, 1738/1738 transitions.
RANDOM walk for 40000 steps (598 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (96 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 325080 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 325080 steps, saw 74870 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) 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-3510271071188732126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-756575062836419914.kers'
[2026-05-22 21:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3510271071188732126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-756575062836419914.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1738 rows 708 cols 7080 entries
Finished phase 1 with 186 SingleSign rule and 449 generalized
[2026-05-22 21:51:11] [INFO ] Computed 73 invariants in 16 ms
Computed 73 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-756575062836419914.kers
Total runtime 26 ms.
[2026-05-22 21:51:11] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/542 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/600 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/610 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 93/703 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/708 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1738/2446 variables, 708/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2446 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2446 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2446 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2446/2446 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 708/708 constraints, ReadFeed: 1/1 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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/542 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/600 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/610 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 93/703 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/703 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/708 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1738/2446 variables, 708/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2446 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2446 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2446 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2446 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2446/2446 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 708/708 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1738/1738 transitions.
Applied a total of 0 rules in 30 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 708/708 places, 1738/1738 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1738/1738 transitions.
Applied a total of 0 rules in 29 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
[2026-05-22 21:51:14] [INFO ] Invariant cache hit.
[2026-05-22 21:51:15] [INFO ] Implicit Places using invariants in 788 ms returned []
[2026-05-22 21:51:15] [INFO ] Invariant cache hit.
[2026-05-22 21:51:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:51:17] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
[2026-05-22 21:51:17] [INFO ] Redundant transitions in 151 ms returned []
Running 1696 sub problems to find dead transitions.
[2026-05-22 21:51:17] [INFO ] Invariant cache hit.
[2026-05-22 21:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/2446 variables, and 69 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/708 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/2446 variables, and 69 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/708 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60749ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60755ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64121 ms. Remains : 708/708 places, 1738/1738 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 29 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:52:18] [INFO ] Invariant cache hit.
[2026-05-22 21:52:18] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:52:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2026-05-22 21:52:18] [INFO ] [Nat]Absence check using 22 positive and 51 generalized place invariants in 18 ms returned sat
[2026-05-22 21:52:20] [INFO ] After 1273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:52:20] [INFO ] After 1462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:52:20] [INFO ] After 1761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1966 ms.
Knowledge based reduction with 3 factoid took 276 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND 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-13452484065003037860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8742984578970213792.kers'
[2026-05-22 21:52:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13452484065003037860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8742984578970213792.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1818 rows 795 cols 7322 entries
Finished phase 1 with 231 SingleSign rule and 475 generalized
[2026-05-22 21:52:20] [INFO ] Computed 89 invariants in 31 ms
Computed 89 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-8742984578970213792.kers
Total runtime 33 ms.
[2026-05-22 21:52:22] [INFO ] [Real]Absence check using 21 positive place invariants in 67 ms returned sat
[2026-05-22 21:52:23] [INFO ] [Real]Absence check using 21 positive and 68 generalized place invariants in 988 ms returned sat
[2026-05-22 21:52:35] [INFO ] [Real]Absence check using state equation in 12704 ms returned unknown
Could not prove EG (AND p0 (NOT p1))
Knowledge-based reduction took 97828 ms.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1))]
Support contains 4 out of 795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 795/795 places, 1818/1818 transitions.
Applied a total of 0 rules in 67 ms. Remains 795 /795 variables (removed 0) and now considering 1818/1818 (removed 0) transitions.
[2026-05-22 21:52:36] [INFO ] Invariant cache hit.
[2026-05-22 21:52:36] [INFO ] Implicit Places using invariants in 872 ms returned []
[2026-05-22 21:52:36] [INFO ] Invariant cache hit.
[2026-05-22 21:52:39] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 3113 ms to find 0 implicit places.
[2026-05-22 21:52:39] [INFO ] Redundant transitions in 140 ms returned []
Running 1760 sub problems to find dead transitions.
[2026-05-22 21:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/785 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/2613 variables, and 67 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 50/68 constraints, State Equation: 0/795 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/785 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/2613 variables, and 67 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 50/68 constraints, State Equation: 0/795 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60742ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64083 ms. Remains : 795/795 places, 1818/1818 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 3 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (429 resets) in 155 ms. (256 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (66 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2026-05-22 21:53:40] [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) 125/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/196 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/585 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/644 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/654 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/789 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/795 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1818/2613 variables, 795/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2613 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2613 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2613/2613 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 795/795 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) 125/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/196 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/585 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/644 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/654 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 135/789 variables, 36/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/795 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1818/2613 variables, 795/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2613 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2613 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2613 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2613/2613 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 795/795 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 795/795 places, 1818/1818 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 795 transition count 1773
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 98 place count 750 transition count 1765
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 124 place count 750 transition count 1739
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 150 place count 724 transition count 1739
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 151 place count 724 transition count 1738
Applied a total of 151 rules in 129 ms. Remains 724 /795 variables (removed 71) and now considering 1738/1818 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 724/795 places, 1738/1818 transitions.
RANDOM walk for 40000 steps (644 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (94 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320576 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320576 steps, saw 73517 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6437925394299442363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16999962233662238866.kers'
[2026-05-22 21:53:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6437925394299442363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16999962233662238866.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1738 rows 724 cols 7296 entries
Finished phase 1 with 219 SingleSign rule and 416 generalized
[2026-05-22 21:53:47] [INFO ] Computed 89 invariants in 17 ms
Computed 89 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-16999962233662238866.kers
Total runtime 24 ms.
[2026-05-22 21:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/544 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/602 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/612 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 107/719 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/724 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1738/2462 variables, 724/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2462 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2462 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2462 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2462/2462 variables, and 814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 724/724 constraints, ReadFeed: 1/1 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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/544 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/602 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/612 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 107/719 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/724 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/724 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1738/2462 variables, 724/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2462 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2462 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2462 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2462 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2462/2462 variables, and 816 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 724/724 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2385ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 31 ms. Remains 724 /724 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 724/724 places, 1738/1738 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 31 ms. Remains 724 /724 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
[2026-05-22 21:53:49] [INFO ] Invariant cache hit.
[2026-05-22 21:53:50] [INFO ] Implicit Places using invariants in 923 ms returned [89, 90, 160, 161, 231, 232, 304, 305, 376, 377, 447, 448, 523, 524, 594, 595]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 936 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 708/724 places, 1738/1738 transitions.
Applied a total of 0 rules in 47 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1015 ms. Remains : 708/724 places, 1738/1738 transitions.
RANDOM walk for 40000 steps (624 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (96 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320689 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320689 steps, saw 73534 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12485833444472035806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2469615030067991351.kers'
[2026-05-22 21:53:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12485833444472035806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2469615030067991351.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1738 rows 708 cols 7080 entries
Finished phase 1 with 186 SingleSign rule and 449 generalized
[2026-05-22 21:53:53] [INFO ] Computed 73 invariants in 58 ms
Computed 73 P flows in 58 ms.
Exported basis to /tmp/petrispot-output-2469615030067991351.kers
Total runtime 63 ms.
[2026-05-22 21:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/542 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/600 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/610 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 93/703 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/708 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1738/2446 variables, 708/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2446 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2446 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2446 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2446/2446 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 708/708 constraints, ReadFeed: 1/1 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) 120/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/542 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/600 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/610 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 93/703 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/703 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/708 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1738/2446 variables, 708/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2446 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2446 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2446 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2446 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2446/2446 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 708/708 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3124ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1738/1738 transitions.
Applied a total of 0 rules in 30 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 708/708 places, 1738/1738 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1738/1738 transitions.
Applied a total of 0 rules in 30 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
[2026-05-22 21:53:56] [INFO ] Invariant cache hit.
[2026-05-22 21:53:57] [INFO ] Implicit Places using invariants in 828 ms returned []
[2026-05-22 21:53:57] [INFO ] Invariant cache hit.
[2026-05-22 21:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:53:59] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
[2026-05-22 21:53:59] [INFO ] Redundant transitions in 42 ms returned []
Running 1696 sub problems to find dead transitions.
[2026-05-22 21:53:59] [INFO ] Invariant cache hit.
[2026-05-22 21:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/2446 variables, and 69 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/708 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/2446 variables, and 69 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/708 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60735ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63643 ms. Remains : 708/708 places, 1738/1738 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 30 ms. Remains 708 /708 variables (removed 0) and now considering 1738/1738 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:55:00] [INFO ] Invariant cache hit.
[2026-05-22 21:55:00] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:55:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2026-05-22 21:55:00] [INFO ] [Nat]Absence check using 22 positive and 51 generalized place invariants in 19 ms returned sat
[2026-05-22 21:55:01] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:55:01] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:55:02] [INFO ] After 1343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1516 ms.
Knowledge based reduction with 3 factoid took 374 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND 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-7950596198784993900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9932499449159402586.kers'
[2026-05-22 21:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7950596198784993900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9932499449159402586.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1818 rows 795 cols 7322 entries
Finished phase 1 with 231 SingleSign rule and 475 generalized
[2026-05-22 21:55:02] [INFO ] Computed 89 invariants in 17 ms
Computed 89 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-9932499449159402586.kers
Total runtime 19 ms.
[2026-05-22 21:55:03] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned sat
[2026-05-22 21:55:04] [INFO ] [Real]Absence check using 21 positive and 68 generalized place invariants in 872 ms returned sat
[2026-05-22 21:55:17] [INFO ] [Real]Absence check using state equation in 12785 ms returned unknown
Could not prove EG (AND p0 (NOT p1))
Knowledge-based reduction took 97506 ms.
Stuttering acceptance computed with spot in 55 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 7519 reset in 414 ms.
Product exploration explored 100000 steps with 7562 reset in 507 ms.
Built C files in :
/tmp/ltsmin8341172620933892004
[2026-05-22 21:55:18] [INFO ] Too many transitions (1818) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:55:18] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8341172620933892004
Running compilation step : cd /tmp/ltsmin8341172620933892004;'/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/ltsmin8341172620933892004;'/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/ltsmin8341172620933892004;'/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 795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 795/795 places, 1818/1818 transitions.
Applied a total of 0 rules in 38 ms. Remains 795 /795 variables (removed 0) and now considering 1818/1818 (removed 0) transitions.
[2026-05-22 21:55:21] [INFO ] Invariant cache hit.
[2026-05-22 21:55:22] [INFO ] Implicit Places using invariants in 924 ms returned []
[2026-05-22 21:55:22] [INFO ] Invariant cache hit.
[2026-05-22 21:55:25] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned []
Implicit Place search using SMT with State Equation took 3294 ms to find 0 implicit places.
[2026-05-22 21:55:25] [INFO ] Redundant transitions in 29 ms returned []
Running 1760 sub problems to find dead transitions.
[2026-05-22 21:55:25] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
SMT process timed out in 30703ms, After SMT, problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 30707ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34083 ms. Remains : 795/795 places, 1818/1818 transitions.
Built C files in :
/tmp/ltsmin15368850204978624632
[2026-05-22 21:55:55] [INFO ] Too many transitions (1818) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:55:56] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15368850204978624632
Running compilation step : cd /tmp/ltsmin15368850204978624632;'/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/ltsmin15368850204978624632;'/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/ltsmin15368850204978624632;'/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:55:59] [INFO ] Flatten gal took : 57 ms
[2026-05-22 21:55:59] [INFO ] Flatten gal took : 57 ms
[2026-05-22 21:55:59] [INFO ] Time to serialize gal into /tmp/LTL16198521333980563926.gal : 18 ms
[2026-05-22 21:55:59] [INFO ] Time to serialize properties into /tmp/LTL9165241956445968427.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16198521333980563926.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12148010296396041666.hoa' '-atoms' '/tmp/LTL9165241956445968427.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/LTL9165241956445968427.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12148010296396041666.hoa
Detected timeout of ITS tools.
[2026-05-22 21:56:14] [INFO ] Flatten gal took : 72 ms
[2026-05-22 21:56:14] [INFO ] Flatten gal took : 40 ms
[2026-05-22 21:56:14] [INFO ] Time to serialize gal into /tmp/LTL12411545404710484941.gal : 11 ms
[2026-05-22 21:56:14] [INFO ] Time to serialize properties into /tmp/LTL16598343556731917783.ltl : 7 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/LTL12411545404710484941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16598343556731917783.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!("((p1415==0)||(p1986==1))"))U((G(!("((p1415==0)||(p1986==1))")))||("((!((p1415==0)||(p1986==1)))&&((p109==0)||(p2590==1)))")))...157
Formula 0 simplified : G("((p1415==0)||(p1986==1))" M !"((!((p1415==0)||(p1986==1)))&&((p109==0)||(p2590==1)))")
Detected timeout of ITS tools.
[2026-05-22 21:56:29] [INFO ] Flatten gal took : 44 ms
[2026-05-22 21:56:29] [INFO ] Applying decomposition
[2026-05-22 21:56:29] [INFO ] Flatten gal took : 41 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/graph4115120615759606989.txt' '-o' '/tmp/graph4115120615759606989.bin' '-w' '/tmp/graph4115120615759606989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4115120615759606989.bin' '-l' '-1' '-v' '-w' '/tmp/graph4115120615759606989.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:56:30] [INFO ] Decomposing Gal with order
[2026-05-22 21:56:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:56:30] [INFO ] Removed a total of 3549 redundant transitions.
[2026-05-22 21:56:30] [INFO ] Flatten gal took : 216 ms
[2026-05-22 21:56:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 44 ms.
[2026-05-22 21:56:30] [INFO ] Time to serialize gal into /tmp/LTL11775780235446583101.gal : 21 ms
[2026-05-22 21:56:30] [INFO ] Time to serialize properties into /tmp/LTL11743725130657994795.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/LTL11775780235446583101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11743725130657994795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((!("((i7.u76.p1415==0)||(i9.u98.p1986==1))"))U((G(!("((i7.u76.p1415==0)||(i9.u98.p1986==1))")))||("((!((i7.u76.p1415==0)||(i9.u98...215
Formula 0 simplified : G("((i7.u76.p1415==0)||(i9.u98.p1986==1))" M !"((!((i7.u76.p1415==0)||(i9.u98.p1986==1)))&&((i2.u10.p109==0)||(i14.u133.p2590==1)))"...156
Detected timeout of ITS tools.
Treatment of property ASLink-PT-09b-LTLCardinality-10 finished in 356341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))&&F(p2)))'
Support contains 6 out of 3570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3563 transition count 4296
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3563 transition count 4296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3562 transition count 4295
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3562 transition count 4295
Applied a total of 16 rules in 914 ms. Remains 3562 /3570 variables (removed 8) and now considering 4295/4303 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4484272859049621662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15183873783439583909.kers'
[2026-05-22 21:56:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4484272859049621662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15183873783439583909.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 4295 rows 3562 cols 13242 entries
Finished phase 1 with 2317 SingleSign rule and 862 generalized
[2026-05-22 21:56:46] [INFO ] Computed 383 invariants in 65 ms
Computed 383 P flows in 66 ms.
Exported basis to /tmp/petrispot-output-15183873783439583909.kers
Total runtime 74 ms.
[2026-05-22 21:56:49] [INFO ] Implicit Places using invariants in 2963 ms returned []
[2026-05-22 21:56:49] [INFO ] Invariant cache hit.
[2026-05-22 21:57:04] [INFO ] Implicit Places using invariants and state equation in 14411 ms returned []
Implicit Place search using SMT with State Equation took 17404 ms to find 0 implicit places.
Running 4294 sub problems to find dead transitions.
[2026-05-22 21:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3561 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3561/7857 variables, and 230 constraints, problems are : Problem set: 0 solved, 4294 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3562 constraints, PredecessorRefiner: 4294/4294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3561 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4294 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3561/7857 variables, and 230 constraints, problems are : Problem set: 0 solved, 4294 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3562 constraints, PredecessorRefiner: 0/4294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62431ms problems are : Problem set: 0 solved, 4294 unsolved
Search for dead transitions found 0 dead transitions in 62450ms
Starting structural reductions in LTL mode, iteration 1 : 3562/3570 places, 4295/4303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80780 ms. Remains : 3562/3570 places, 4295/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-12
Product exploration explored 100000 steps with 111 reset in 704 ms.
Product exploration explored 100000 steps with 141 reset in 756 ms.
Computed a total of 147 stabilizing places and 147 stable transitions
Computed a total of 147 stabilizing places and 147 stable transitions
Knowledge based reduction with 15 factoid took 105 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (50 resets) in 757 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 113288 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 113288 steps, saw 26167 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2026-05-22 21:58:11] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1255/1450 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1450 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1984/3434 variables, 256/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 128/3562 variables, 41/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3562 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4295/7857 variables, 3562/3945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7857 variables, 0/3945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7857/7857 variables, and 3945 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 305/305 constraints, State Equation: 3562/3562 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1255/1450 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1450 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1450 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1984/3434 variables, 256/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3434/7857 variables, and 349 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 264/305 constraints, State Equation: 0/3562 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10077ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3562/3562 places, 4295/4295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 662 place count 3562 transition count 3633
Reduce places removed 662 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 665 rules applied. Total rules applied 1327 place count 2900 transition count 3630
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 1330 place count 2898 transition count 3629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1331 place count 2897 transition count 3629
Performed 964 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 964 Pre rules applied. Total rules applied 1331 place count 2897 transition count 2665
Deduced a syphon composed of 964 places in 8 ms
Ensure Unique test removed 94 places
Reduce places removed 1058 places and 0 transitions.
Iterating global reduction 4 with 2022 rules applied. Total rules applied 3353 place count 1839 transition count 2665
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 4 with 67 rules applied. Total rules applied 3420 place count 1830 transition count 2607
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 3478 place count 1772 transition count 2607
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 3478 place count 1772 transition count 2570
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 36 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 3588 place count 1699 transition count 2570
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 35 Pre rules applied. Total rules applied 3588 place count 1699 transition count 2535
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 3658 place count 1664 transition count 2535
Performed 285 Post agglomeration using F-continuation condition.Transition count delta: 285
Deduced a syphon composed of 285 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 6 with 572 rules applied. Total rules applied 4230 place count 1377 transition count 2250
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4234 place count 1373 transition count 2246
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4239 place count 1372 transition count 2246
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 4240 place count 1372 transition count 2245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4241 place count 1371 transition count 2245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4241 place count 1371 transition count 2244
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4243 place count 1370 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4245 place count 1368 transition count 2242
Iterating global reduction 8 with 2 rules applied. Total rules applied 4247 place count 1368 transition count 2242
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 4249 place count 1368 transition count 2240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4250 place count 1367 transition count 2240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4252 place count 1366 transition count 2245
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 4262 place count 1366 transition count 2235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4272 place count 1356 transition count 2235
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 4280 place count 1356 transition count 2227
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 4288 place count 1348 transition count 2227
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 4297 place count 1348 transition count 2227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4298 place count 1347 transition count 2226
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 12 with 27 rules applied. Total rules applied 4325 place count 1329 transition count 2217
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4334 place count 1320 transition count 2217
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 27 Pre rules applied. Total rules applied 4334 place count 1320 transition count 2190
Deduced a syphon composed of 27 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 55 rules applied. Total rules applied 4389 place count 1292 transition count 2190
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 14 with 10 rules applied. Total rules applied 4399 place count 1282 transition count 2190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4399 place count 1282 transition count 2189
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4401 place count 1281 transition count 2189
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 15 with 38 rules applied. Total rules applied 4439 place count 1262 transition count 2170
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 4448 place count 1253 transition count 2161
Iterating global reduction 15 with 9 rules applied. Total rules applied 4457 place count 1253 transition count 2161
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 4466 place count 1253 transition count 2152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 4475 place count 1244 transition count 2152
Applied a total of 4475 rules in 1108 ms. Remains 1244 /3562 variables (removed 2318) and now considering 2152/4295 (removed 2143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1108 ms. Remains : 1244/3562 places, 2152/4295 transitions.
RANDOM walk for 40000 steps (392 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (41 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (36 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 123381 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 6
Probabilistic random walk after 123381 steps, saw 28809 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) 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-1979271168744489580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2903686587209838040.kers'
[2026-05-22 21:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1979271168744489580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2903686587209838040.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 2152 rows 1224 cols 8461 entries
Finished phase 1 with 326 SingleSign rule and 706 generalized
[2026-05-22 21:58:26] [INFO ] Computed 212 invariants in 21 ms
Computed 212 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-2903686587209838040.kers
Total runtime 23 ms.
[2026-05-22 21:58:26] [INFO ] State equation strengthened by 1 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/149 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 124/273 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 108/381 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/385 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/386 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 211/597 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 118/715 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 44/759 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/759 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/760 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/760 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 240/1000 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1000 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 101/1101 variables, 18/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1101 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 29/1130 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1130 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/1131 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1131 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 98/1229 variables, 22/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1229 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 13/1242 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1242 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 2/1244 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1244 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 2152/3396 variables, 1244/1456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3396 variables, 1/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3396 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 0/3396 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3396/3396 variables, and 1457 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3682 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 121/121 constraints, State Equation: 1244/1244 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/149 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 124/273 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 108/381 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/385 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/386 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 211/597 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 118/715 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 44/759 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/759 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/760 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/760 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 240/1000 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1000 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 101/1101 variables, 18/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1101 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 29/1130 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1130 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/1131 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1131 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 98/1229 variables, 22/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1229 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 13/1242 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1242 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 2/1244 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1244 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 2152/3396 variables, 1244/1456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3396 variables, 1/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3396 variables, 6/1463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3396 variables, 1/1464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3396 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 0/3396 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3396/3396 variables, and 1464 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9997 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 121/121 constraints, State Equation: 1244/1244 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13746ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8513 ms.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 2152/2152 transitions.
Applied a total of 0 rules in 47 ms. Remains 1244 /1244 variables (removed 0) and now considering 2152/2152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1244/1244 places, 2152/2152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 2152/2152 transitions.
Applied a total of 0 rules in 50 ms. Remains 1244 /1244 variables (removed 0) and now considering 2152/2152 (removed 0) transitions.
[2026-05-22 21:58:48] [INFO ] Invariant cache hit.
[2026-05-22 21:58:50] [INFO ] Implicit Places using invariants in 1308 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 592, 629, 633, 634, 645, 646, 648, 665, 683, 752, 756, 757, 768, 769, 771, 788, 806, 875, 879, 880, 891, 892, 894, 911, 929, 998, 1002, 1003, 1014, 1015, 1017, 1034, 1052, 1121, 1125, 1126, 1129, 1140, 1141, 1142, 1160, 1182, 1185, 1186]
[2026-05-22 21:58:50] [INFO ] Actually due to overlaps returned [1160, 1142, 48, 168, 291, 416, 539, 665, 788, 911, 1034, 31, 151, 274, 399, 522, 648, 771, 894, 1017, 148, 271, 396, 519, 645, 768, 891, 1014, 1140, 149, 272, 397, 520, 646, 769, 892, 1015, 1141, 1182, 1, 18, 259, 260, 384, 385, 507, 508, 633, 634, 756, 757, 879, 880, 1002, 1003, 1125, 1126, 66, 186, 309, 434, 557, 683, 806, 929, 1052, 1185, 19, 1129, 1186]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1313 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1174/1244 places, 2152/2152 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 1164 transition count 1997
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 1009 transition count 1986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 333 place count 1007 transition count 1986
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 333 place count 1007 transition count 1948
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 409 place count 969 transition count 1948
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 4 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 535 place count 906 transition count 1885
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 544 place count 897 transition count 1876
Iterating global reduction 3 with 9 rules applied. Total rules applied 553 place count 897 transition count 1876
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 562 place count 897 transition count 1867
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 566 place count 895 transition count 1868
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 589 place count 895 transition count 1845
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 613 place count 871 transition count 1845
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 640 place count 871 transition count 1845
Applied a total of 640 rules in 236 ms. Remains 871 /1174 variables (removed 303) and now considering 1845/2152 (removed 307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11263916809653427894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11835884503550907100.kers'
[2026-05-22 21:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11263916809653427894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11835884503550907100.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1845 rows 870 cols 7545 entries
Finished phase 1 with 266 SingleSign rule and 474 generalized
[2026-05-22 21:58:50] [INFO ] Computed 131 invariants in 47 ms
Computed 131 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-11835884503550907100.kers
Total runtime 49 ms.
[2026-05-22 21:58:51] [INFO ] Implicit Places using invariants in 1331 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 435, 441, 444, 446, 451, 452, 506, 522, 528, 531, 533, 538, 539, 592, 608, 614, 617, 619, 624, 625, 678, 694, 700, 703, 705, 710, 711, 764, 780, 786, 789, 791, 858, 861, 864, 867, 870]
[2026-05-22 21:58:51] [INFO ] Actually due to overlaps returned [104, 190, 277, 363, 451, 538, 624, 710, 105, 191, 278, 364, 452, 539, 625, 711, 89, 95, 100, 174, 180, 185, 261, 267, 272, 347, 353, 358, 435, 441, 446, 522, 528, 533, 608, 614, 619, 694, 700, 705, 780, 786, 791, 73, 101, 158, 244, 331, 417, 506, 592, 678, 764, 858, 861, 864, 867, 870]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 813/1244 places, 1845/2152 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 774 transition count 1806
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 774 transition count 1806
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 762 transition count 1794
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 762 transition count 1794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 762 transition count 1791
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 141 place count 744 transition count 1773
Free-agglomeration rule applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 168 place count 744 transition count 1746
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 195 place count 717 transition count 1746
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 204 place count 717 transition count 1737
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 213 place count 708 transition count 1737
Applied a total of 213 rules in 200 ms. Remains 708 /813 variables (removed 105) and now considering 1737/1845 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17266553358074998949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17695783938448162502.kers'
[2026-05-22 21:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17266553358074998949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17695783938448162502.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1737 rows 708 cols 7084 entries
Finished phase 1 with 170 SingleSign rule and 465 generalized
[2026-05-22 21:58:51] [INFO ] Computed 73 invariants in 29 ms
Computed 73 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-17695783938448162502.kers
Total runtime 33 ms.
[2026-05-22 21:58:52] [INFO ] Implicit Places using invariants in 686 ms returned []
[2026-05-22 21:58:52] [INFO ] Invariant cache hit.
[2026-05-22 21:58:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 21:58:54] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 3181 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 708/1244 places, 1737/2152 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6323 ms. Remains : 708/1244 places, 1737/2152 transitions.
RANDOM walk for 40000 steps (646 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (90 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 181926 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 6
Probabilistic random walk after 181926 steps, saw 59558 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-22 21:58:58] [INFO ] Invariant cache hit.
[2026-05-22 21:58:58] [INFO ] State equation strengthened by 2 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/111 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 120/231 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/235 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 167/402 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 65/467 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 60/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/529 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 111/640 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 29/669 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 39/708 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/708 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1737/2445 variables, 708/781 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2445 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2445 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/2445 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2445/2445 variables, and 783 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 708/708 constraints, ReadFeed: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/111 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 120/231 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/235 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 167/402 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 65/467 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 60/527 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/529 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 111/640 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 29/669 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 39/708 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/708 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 1737/2445 variables, 708/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2445 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2445 variables, 6/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2445 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/2445 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2445/2445 variables, and 790 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 708/708 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7038ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6795 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1737/1737 transitions.
Applied a total of 0 rules in 31 ms. Remains 708 /708 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 708/708 places, 1737/1737 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1737/1737 transitions.
Applied a total of 0 rules in 30 ms. Remains 708 /708 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
[2026-05-22 21:59:12] [INFO ] Invariant cache hit.
[2026-05-22 21:59:12] [INFO ] Implicit Places using invariants in 641 ms returned []
[2026-05-22 21:59:12] [INFO ] Invariant cache hit.
[2026-05-22 21:59:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 21:59:15] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 3320 ms to find 0 implicit places.
[2026-05-22 21:59:15] [INFO ] Redundant transitions in 26 ms returned []
Running 1691 sub problems to find dead transitions.
[2026-05-22 21:59:15] [INFO ] Invariant cache hit.
[2026-05-22 21:59:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 45/70 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/2445 variables, and 70 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 25/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/708 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1691/1691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 45/70 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/2445 variables, and 71 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 25/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/708 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1691 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60613ms problems are : Problem set: 0 solved, 1691 unsolved
Search for dead transitions found 0 dead transitions in 60616ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64016 ms. Remains : 708/708 places, 1737/1737 transitions.
Knowledge based reduction with 15 factoid took 99 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 172 ms :[(NOT p1), true, (NOT p1)]
Knowledge-based reduction took 128203 ms.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 3562 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 : 3562/3562 places, 4295/4295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 0 with 660 rules applied. Total rules applied 660 place count 3561 transition count 3634
Reduce places removed 660 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 663 rules applied. Total rules applied 1323 place count 2901 transition count 3631
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 1326 place count 2899 transition count 3630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1327 place count 2898 transition count 3630
Performed 963 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 963 Pre rules applied. Total rules applied 1327 place count 2898 transition count 2667
Deduced a syphon composed of 963 places in 8 ms
Ensure Unique test removed 94 places
Reduce places removed 1057 places and 0 transitions.
Iterating global reduction 4 with 2020 rules applied. Total rules applied 3347 place count 1841 transition count 2667
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 4 with 67 rules applied. Total rules applied 3414 place count 1832 transition count 2609
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 3472 place count 1774 transition count 2609
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 3472 place count 1774 transition count 2572
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 35 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 109 rules applied. Total rules applied 3581 place count 1702 transition count 2572
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 34 Pre rules applied. Total rules applied 3581 place count 1702 transition count 2538
Deduced a syphon composed of 34 places in 8 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 3649 place count 1668 transition count 2538
Performed 284 Post agglomeration using F-continuation condition.Transition count delta: 284
Deduced a syphon composed of 284 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 6 with 570 rules applied. Total rules applied 4219 place count 1382 transition count 2254
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4223 place count 1378 transition count 2250
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4228 place count 1377 transition count 2250
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 4229 place count 1377 transition count 2249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4230 place count 1376 transition count 2249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4230 place count 1376 transition count 2248
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4232 place count 1375 transition count 2248
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4234 place count 1373 transition count 2246
Iterating global reduction 8 with 2 rules applied. Total rules applied 4236 place count 1373 transition count 2246
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 4238 place count 1373 transition count 2244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4239 place count 1372 transition count 2244
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4241 place count 1371 transition count 2249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4243 place count 1369 transition count 2247
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 10 with 27 rules applied. Total rules applied 4270 place count 1351 transition count 2238
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4279 place count 1342 transition count 2238
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 27 Pre rules applied. Total rules applied 4279 place count 1342 transition count 2211
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 55 rules applied. Total rules applied 4334 place count 1314 transition count 2211
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 4353 place count 1295 transition count 2211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4353 place count 1295 transition count 2210
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4355 place count 1294 transition count 2210
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 56 rules applied. Total rules applied 4411 place count 1266 transition count 2182
Discarding 18 places :
Symmetric choice reduction at 13 with 18 rule applications. Total rules 4429 place count 1248 transition count 2164
Iterating global reduction 13 with 18 rules applied. Total rules applied 4447 place count 1248 transition count 2164
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 4456 place count 1239 transition count 2155
Iterating global reduction 13 with 9 rules applied. Total rules applied 4465 place count 1239 transition count 2155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4474 place count 1239 transition count 2146
Applied a total of 4474 rules in 951 ms. Remains 1239 /3562 variables (removed 2323) and now considering 2146/4295 (removed 2149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15033668093010253351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9413105589886058864.kers'
[2026-05-22 22:00:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15033668093010253351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9413105589886058864.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 4 ms.
// Phase 1: matrix 2146 rows 1211 cols 8345 entries
Finished phase 1 with 286 SingleSign rule and 749 generalized
[2026-05-22 22:00:17] [INFO ] Computed 204 invariants in 57 ms
Computed 204 P flows in 70 ms.
Exported basis to /tmp/petrispot-output-9413105589886058864.kers
Total runtime 75 ms.
[2026-05-22 22:00:19] [INFO ] Implicit Places using invariants in 1499 ms returned [1, 18, 19, 31, 48, 66, 86, 126, 140, 150, 151, 153, 170, 188, 208, 259, 260, 272, 273, 275, 292, 310, 330, 383, 384, 396, 397, 399, 416, 434, 454, 505, 506, 518, 519, 521, 538, 556, 577, 593, 631, 632, 644, 645, 647, 664, 682, 702, 753, 754, 766, 767, 769, 786, 804, 824, 875, 876, 888, 889, 891, 908, 926, 946, 997, 998, 1010, 1011, 1013, 1030, 1048, 1068, 1119, 1120, 1123, 1134, 1135, 1136, 1154, 1176, 1179, 1180]
[2026-05-22 22:00:19] [INFO ] Actually due to overlaps returned [1154, 1136, 48, 170, 292, 416, 538, 664, 786, 908, 1030, 31, 150, 153, 272, 275, 396, 399, 518, 521, 644, 647, 766, 769, 888, 891, 1010, 1013, 1134, 151, 273, 397, 519, 645, 767, 889, 1011, 1135, 1176, 1, 18, 259, 260, 383, 384, 505, 506, 631, 632, 753, 754, 875, 876, 997, 998, 1119, 1120, 1179, 19, 66, 86, 140, 188, 208, 310, 330, 434, 454, 556, 577, 682, 702, 804, 824, 926, 946, 1048, 1068, 1123, 1180]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1515 ms to find 80 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1159/3562 places, 2146/4295 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1157 transition count 2001
Reduce places removed 145 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 148 rules applied. Total rules applied 295 place count 1012 transition count 1998
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 298 place count 1009 transition count 1998
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 298 place count 1009 transition count 1960
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 374 place count 971 transition count 1960
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 518 place count 899 transition count 1888
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 3 with 4 rules applied. Total rules applied 522 place count 897 transition count 1889
Applied a total of 522 rules in 161 ms. Remains 897 /1159 variables (removed 262) and now considering 1889/2146 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10974488680303942711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14184613408303646543.kers'
[2026-05-22 22:00:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10974488680303942711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14184613408303646543.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1889 rows 897 cols 7577 entries
Finished phase 1 with 273 SingleSign rule and 502 generalized
[2026-05-22 22:00:19] [INFO ] Computed 122 invariants in 31 ms
Computed 122 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-14184613408303646543.kers
Total runtime 34 ms.
[2026-05-22 22:00:20] [INFO ] Implicit Places using invariants in 976 ms returned [88, 101, 176, 182, 187, 266, 272, 277, 354, 360, 365, 445, 451, 456, 534, 540, 545, 622, 628, 633, 710, 716, 721, 798, 804, 809, 876]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 979 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 870/3562 places, 1889/4295 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 853 transition count 1872
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 853 transition count 1872
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 836 transition count 1855
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 836 transition count 1855
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 828 transition count 1847
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 828 transition count 1847
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 819 transition count 1838
Applied a total of 102 rules in 140 ms. Remains 819 /870 variables (removed 51) and now considering 1838/1889 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2368980425445512658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12067882142736290646.kers'
[2026-05-22 22:00:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2368980425445512658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12067882142736290646.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1838 rows 819 cols 7388 entries
Finished phase 1 with 257 SingleSign rule and 467 generalized
[2026-05-22 22:00:20] [INFO ] Computed 95 invariants in 40 ms
Computed 95 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-12067882142736290646.kers
Total runtime 45 ms.
[2026-05-22 22:00:21] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2026-05-22 22:00:21] [INFO ] Invariant cache hit.
[2026-05-22 22:00:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 22:00:24] [INFO ] Implicit Places using invariants and state equation in 3423 ms returned []
Implicit Place search using SMT with State Equation took 4572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 819/3562 places, 1838/4295 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8319 ms. Remains : 819/3562 places, 1838/4295 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 13 factoid took 52 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 (427 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (58 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (58 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 132500 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 6
Probabilistic random walk after 132500 steps, saw 52065 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2026-05-22 22:00:28] [INFO ] Invariant cache hit.
[2026-05-22 22:00:28] [INFO ] State equation strengthened by 5 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 132/254 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/258 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 209/467 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 67/534 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 66/600 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/602 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 128/730 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/730 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 41/771 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/771 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 48/819 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/819 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1838/2657 variables, 819/914 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2657 variables, 5/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2657 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/2657 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2657/2657 variables, and 919 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 819/819 constraints, ReadFeed: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 132/254 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/258 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 209/467 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 67/534 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 66/600 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/602 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 128/730 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/730 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 41/771 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/771 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 48/819 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/819 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1838/2657 variables, 819/914 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2657 variables, 5/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2657 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2657 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/2657 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2657/2657 variables, and 925 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4410 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 819/819 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6513ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5276 ms.
Support contains 4 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 1838/1838 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 819 transition count 1837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 818 transition count 1837
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 818 transition count 1835
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 816 transition count 1835
Free-agglomeration rule applied 44 times.
Iterating global reduction 2 with 44 rules applied. Total rules applied 50 place count 816 transition count 1791
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 103 place count 772 transition count 1782
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 135 place count 772 transition count 1750
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 167 place count 740 transition count 1750
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 740 transition count 1750
Applied a total of 168 rules in 148 ms. Remains 740 /819 variables (removed 79) and now considering 1750/1838 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 740/819 places, 1750/1838 transitions.
RANDOM walk for 40000 steps (650 resets) in 353 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (78 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 166114 steps, run timeout after 3003 ms. (steps per millisecond=55 ) properties seen :0 out of 6
Probabilistic random walk after 166114 steps, saw 40349 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) 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-12583691807930957998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17749971773290861210.kers'
[2026-05-22 22:00:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12583691807930957998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17749971773290861210.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1750 rows 740 cols 7352 entries
Finished phase 1 with 230 SingleSign rule and 415 generalized
[2026-05-22 22:00:43] [INFO ] Computed 95 invariants in 21 ms
Computed 95 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-17749971773290861210.kers
Total runtime 36 ms.
[2026-05-22 22:00:43] [INFO ] State equation strengthened by 5 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 122/128 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 146/274 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 28/302 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 61/363 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/365 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 261/626 variables, 44/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 58/684 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/684 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/740 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1750/2490 variables, 740/835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2490 variables, 5/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2490 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/2490 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2490/2490 variables, and 840 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2149 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 740/740 constraints, ReadFeed: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 122/128 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 146/274 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 28/302 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 61/363 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/365 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 261/626 variables, 44/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 58/684 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/684 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/740 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1750/2490 variables, 740/835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2490 variables, 5/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2490 variables, 6/846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2490 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/2490 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2490/2490 variables, and 846 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4256 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 740/740 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6476ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4521 ms.
Support contains 4 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1750/1750 transitions.
Applied a total of 0 rules in 32 ms. Remains 740 /740 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 740/740 places, 1750/1750 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1750/1750 transitions.
Applied a total of 0 rules in 31 ms. Remains 740 /740 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
[2026-05-22 22:00:54] [INFO ] Invariant cache hit.
[2026-05-22 22:00:55] [INFO ] Implicit Places using invariants in 966 ms returned [89, 93, 94, 164, 165, 236, 237, 307, 308, 380, 381, 452, 453, 523, 524, 594, 595, 727, 730, 733, 736, 739]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 969 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 718/740 places, 1750/1750 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 714 transition count 1746
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 714 transition count 1746
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 710 transition count 1742
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 710 transition count 1742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 710 transition count 1739
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 709 transition count 1738
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 709 transition count 1737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 708 transition count 1737
Applied a total of 23 rules in 132 ms. Remains 708 /718 variables (removed 10) and now considering 1737/1750 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8344357571529944586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8106753195283893262.kers'
[2026-05-22 22:00:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8344357571529944586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8106753195283893262.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1737 rows 708 cols 7084 entries
Finished phase 1 with 201 SingleSign rule and 434 generalized
[2026-05-22 22:00:55] [INFO ] Computed 73 invariants in 33 ms
Computed 73 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-8106753195283893262.kers
Total runtime 36 ms.
[2026-05-22 22:00:56] [INFO ] Implicit Places using invariants in 713 ms returned []
[2026-05-22 22:00:56] [INFO ] Invariant cache hit.
[2026-05-22 22:00:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:00:59] [INFO ] Implicit Places using invariants and state equation in 3039 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 708/740 places, 1737/1750 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4900 ms. Remains : 708/740 places, 1737/1750 transitions.
RANDOM walk for 40000 steps (657 resets) in 515 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 154850 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 6
Probabilistic random walk after 154850 steps, saw 36771 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2026-05-22 22:01:02] [INFO ] Invariant cache hit.
[2026-05-22 22:01:02] [INFO ] State equation strengthened by 2 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 121/127 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 146/273 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 28/301 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 61/362 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/364 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 246/610 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 51/661 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 47/708 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/708 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1737/2445 variables, 708/781 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2445 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2445 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/2445 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2445/2445 variables, and 783 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 708/708 constraints, ReadFeed: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 121/127 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 146/273 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 28/301 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 61/362 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/364 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 246/610 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/610 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 51/661 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/661 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 47/708 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/708 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1737/2445 variables, 708/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2445 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2445 variables, 6/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2445 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2445 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/2445 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2445/2445 variables, and 791 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4555 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 708/708 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6036ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8474 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1737/1737 transitions.
Applied a total of 0 rules in 31 ms. Remains 708 /708 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 708/708 places, 1737/1737 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1737/1737 transitions.
Applied a total of 0 rules in 28 ms. Remains 708 /708 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
[2026-05-22 22:01:17] [INFO ] Invariant cache hit.
[2026-05-22 22:01:18] [INFO ] Implicit Places using invariants in 714 ms returned []
[2026-05-22 22:01:18] [INFO ] Invariant cache hit.
[2026-05-22 22:01:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:01:20] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
[2026-05-22 22:01:20] [INFO ] Redundant transitions in 23 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3088 ms. Remains : 708/708 places, 1737/1737 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 4321 edges and 708 vertex of which 707 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 707 transition count 1735
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 705 transition count 1735
Applied a total of 5 rules in 41 ms. Remains 705 /708 variables (removed 3) and now considering 1735/1737 (removed 2) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2808516693114231985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18085903243776255806.kers'
[2026-05-22 22:01:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2808516693114231985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18085903243776255806.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1735 rows 705 cols 7079 entries
Finished phase 1 with 199 SingleSign rule and 434 generalized
[2026-05-22 22:01:20] [INFO ] Computed 72 invariants in 16 ms
Computed 72 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-18085903243776255806.kers
Total runtime 19 ms.
[2026-05-22 22:01:20] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 22:01:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2026-05-22 22:01:20] [INFO ] [Nat]Absence check using 27 positive and 45 generalized place invariants in 35 ms returned sat
[2026-05-22 22:01:22] [INFO ] After 1338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 22:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
TRAPS : Iteration 1
[2026-05-22 22:01:24] [INFO ] After 2927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 22:01:24] [INFO ] After 3630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 3897 ms.
Knowledge based reduction with 13 factoid took 58 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 88 ms :[(NOT p1), true, (NOT p1)]
Knowledge-based reduction took 59609 ms.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 1099 reset in 347 ms.
Product exploration explored 100000 steps with 1074 reset in 367 ms.
Built C files in :
/tmp/ltsmin14249811802171436026
[2026-05-22 22:01:25] [INFO ] Too many transitions (1838) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:01:25] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14249811802171436026
Running compilation step : cd /tmp/ltsmin14249811802171436026;'/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/ltsmin14249811802171436026;'/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/ltsmin14249811802171436026;'/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 819 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 819/819 places, 1838/1838 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 819 transition count 1837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 818 transition count 1837
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 818 transition count 1835
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 816 transition count 1835
Applied a total of 6 rules in 50 ms. Remains 816 /819 variables (removed 3) and now considering 1835/1838 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9816514912811215045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6489498173004644106.kers'
[2026-05-22 22:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9816514912811215045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6489498173004644106.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1835 rows 816 cols 7382 entries
Finished phase 1 with 254 SingleSign rule and 467 generalized
[2026-05-22 22:01:28] [INFO ] Computed 95 invariants in 19 ms
Computed 95 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-6489498173004644106.kers
Total runtime 23 ms.
[2026-05-22 22:01:29] [INFO ] Implicit Places using invariants in 788 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 790 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 815/819 places, 1835/1838 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 814 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 813 transition count 1833
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 813 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 812 transition count 1832
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 812 transition count 1832
Applied a total of 6 rules in 114 ms. Remains 812 /815 variables (removed 3) and now considering 1832/1835 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6592088268633946604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4590992123741023734.kers'
[2026-05-22 22:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6592088268633946604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4590992123741023734.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1832 rows 812 cols 7371 entries
Finished phase 1 with 253 SingleSign rule and 465 generalized
[2026-05-22 22:01:29] [INFO ] Computed 94 invariants in 36 ms
Computed 94 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-4590992123741023734.kers
Total runtime 40 ms.
[2026-05-22 22:01:30] [INFO ] Implicit Places using invariants in 808 ms returned []
[2026-05-22 22:01:30] [INFO ] Invariant cache hit.
[2026-05-22 22:01:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 22:01:32] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 3086 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 812/819 places, 1832/1838 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4040 ms. Remains : 812/819 places, 1832/1838 transitions.
Built C files in :
/tmp/ltsmin11625428159256574141
[2026-05-22 22:01:32] [INFO ] Too many transitions (1832) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:01:32] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11625428159256574141
Running compilation step : cd /tmp/ltsmin11625428159256574141;'/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/ltsmin11625428159256574141;'/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/ltsmin11625428159256574141;'/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 22:01:35] [INFO ] Flatten gal took : 43 ms
[2026-05-22 22:01:35] [INFO ] Flatten gal took : 49 ms
[2026-05-22 22:01:35] [INFO ] Time to serialize gal into /tmp/LTL13923544044376851202.gal : 10 ms
[2026-05-22 22:01:35] [INFO ] Time to serialize properties into /tmp/LTL935434293467864713.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/LTL13923544044376851202.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7489811920022872538.hoa' '-atoms' '/tmp/LTL935434293467864713.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/LTL935434293467864713.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7489811920022872538.hoa
Detected timeout of ITS tools.
[2026-05-22 22:01:50] [INFO ] Flatten gal took : 37 ms
[2026-05-22 22:01:51] [INFO ] Flatten gal took : 37 ms
[2026-05-22 22:01:51] [INFO ] Time to serialize gal into /tmp/LTL4838286257581951964.gal : 9 ms
[2026-05-22 22:01:51] [INFO ] Time to serialize properties into /tmp/LTL3797361893453516083.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/LTL4838286257581951964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3797361893453516083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(("((p1036==0)||(p3746==1))")U(G("((p1854==0)||(p2029==1))"))))&&(F("((p353==0)||(p1755==1))"))))
Formula 0 simplified : X(!"((p1036==0)||(p3746==1))" R F!"((p1854==0)||(p2029==1))") | G!"((p353==0)||(p1755==1))"
Detected timeout of ITS tools.
[2026-05-22 22:02:06] [INFO ] Flatten gal took : 70 ms
[2026-05-22 22:02:06] [INFO ] Applying decomposition
[2026-05-22 22:02:06] [INFO ] Flatten gal took : 38 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/graph14631030905829785406.txt' '-o' '/tmp/graph14631030905829785406.bin' '-w' '/tmp/graph14631030905829785406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14631030905829785406.bin' '-l' '-1' '-v' '-w' '/tmp/graph14631030905829785406.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:02:06] [INFO ] Decomposing Gal with order
[2026-05-22 22:02:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:02:06] [INFO ] Removed a total of 3571 redundant transitions.
[2026-05-22 22:02:06] [INFO ] Flatten gal took : 97 ms
[2026-05-22 22:02:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 46 ms.
[2026-05-22 22:02:06] [INFO ] Time to serialize gal into /tmp/LTL12350945271880865984.gal : 34 ms
[2026-05-22 22:02:06] [INFO ] Time to serialize properties into /tmp/LTL8181568245539453557.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/LTL12350945271880865984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8181568245539453557.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(("((i6.u62.p1036==0)||(i18.i1.u192.p3746==1))")U(G("((i9.u97.p1854==0)||(i9.u99.p2029==1))"))))&&(F("((i1.u28.p353==0)||(i8.u91....170
Formula 0 simplified : X(!"((i6.u62.p1036==0)||(i18.i1.u192.p3746==1))" R F!"((i9.u97.p1854==0)||(i9.u99.p2029==1))") | G!"((i1.u28.p353==0)||(i8.u91.p1755...161
Detected timeout of ITS tools.
Treatment of property ASLink-PT-09b-LTLCardinality-12 finished in 335895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1) U p0)))'
Support contains 3 out of 3570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3564 transition count 4297
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3564 transition count 4297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3563 transition count 4296
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3563 transition count 4296
Applied a total of 14 rules in 909 ms. Remains 3563 /3570 variables (removed 7) and now considering 4296/4303 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10631938568027745951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9886764007881853621.kers'
[2026-05-22 22:02:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10631938568027745951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9886764007881853621.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 4296 rows 3563 cols 13244 entries
Finished phase 1 with 2318 SingleSign rule and 862 generalized
[2026-05-22 22:02:22] [INFO ] Computed 383 invariants in 50 ms
Computed 383 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-9886764007881853621.kers
Total runtime 59 ms.
[2026-05-22 22:02:25] [INFO ] Implicit Places using invariants in 2824 ms returned []
[2026-05-22 22:02:25] [INFO ] Invariant cache hit.
[2026-05-22 22:02:44] [INFO ] Implicit Places using invariants and state equation in 18817 ms returned []
Implicit Place search using SMT with State Equation took 21661 ms to find 0 implicit places.
Running 4295 sub problems to find dead transitions.
[2026-05-22 22:02:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 4295/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 0/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62339ms problems are : Problem set: 0 solved, 4295 unsolved
Search for dead transitions found 0 dead transitions in 62357ms
Starting structural reductions in LTL mode, iteration 1 : 3563/3570 places, 4296/4303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84948 ms. Remains : 3563/3570 places, 4296/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1) U p0)))'
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLCardinality-14 finished in 85335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p0)&&(F(p1) U p2))))'
Support contains 6 out of 3570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3570/3570 places, 4303/4303 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3564 transition count 4297
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3564 transition count 4297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3563 transition count 4296
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3563 transition count 4296
Applied a total of 14 rules in 895 ms. Remains 3563 /3570 variables (removed 7) and now considering 4296/4303 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2480707222544239240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17194459321746536192.kers'
[2026-05-22 22:03:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2480707222544239240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17194459321746536192.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 4296 rows 3563 cols 13248 entries
Finished phase 1 with 2315 SingleSign rule and 865 generalized
[2026-05-22 22:03:47] [INFO ] Computed 383 invariants in 88 ms
Computed 383 P flows in 89 ms.
Exported basis to /tmp/petrispot-output-17194459321746536192.kers
Total runtime 98 ms.
[2026-05-22 22:03:51] [INFO ] Implicit Places using invariants in 3334 ms returned []
[2026-05-22 22:03:51] [INFO ] Invariant cache hit.
[2026-05-22 22:04:21] [INFO ] Implicit Places using invariants and state equation in 30264 ms returned []
Implicit Place search using SMT with State Equation took 33604 ms to find 0 implicit places.
Running 4295 sub problems to find dead transitions.
[2026-05-22 22:04:21] [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/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 4295/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3562 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3562/7859 variables, and 230 constraints, problems are : Problem set: 0 solved, 4295 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3563 constraints, PredecessorRefiner: 0/4295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62361ms problems are : Problem set: 0 solved, 4295 unsolved
Search for dead transitions found 0 dead transitions in 62370ms
Starting structural reductions in LTL mode, iteration 1 : 3563/3570 places, 4296/4303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96884 ms. Remains : 3563/3570 places, 4296/4303 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(F(p1) U p2)&&p0)))'
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-09b-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 788 ms.
Product exploration explored 100000 steps with 33333 reset in 786 ms.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 27 ms. Proved property starting from automaton with 6 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA ASLink-PT-09b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09b-LTLCardinality-15 finished in 98894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (p1||G(!p0)))))'
Spot run failed in 108 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))&&F(p2)))'
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.
[2026-05-22 22:05:26] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13989836520562482791
[2026-05-22 22:05:26] [INFO ] Too many transitions (4303) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:05:26] [INFO ] Applying decomposition
[2026-05-22 22:05:26] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13989836520562482791
Running compilation step : cd /tmp/ltsmin13989836520562482791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 22:05:26] [INFO ] Flatten gal took : 74 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/graph17117640321321673830.txt' '-o' '/tmp/graph17117640321321673830.bin' '-w' '/tmp/graph17117640321321673830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17117640321321673830.bin' '-l' '-1' '-v' '-w' '/tmp/graph17117640321321673830.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:05:26] [INFO ] Decomposing Gal with order
[2026-05-22 22:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:05:27] [INFO ] Removed a total of 3143 redundant transitions.
[2026-05-22 22:05:27] [INFO ] Flatten gal took : 178 ms
[2026-05-22 22:05:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2026-05-22 22:05:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality15483624998244250468.gal : 40 ms
[2026-05-22 22:05:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality8163933042440536909.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/LTLCardinality15483624998244250468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8163933042440536909.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((!("((i13.u489.p1415==0)||(i17.u697.p1986==1))"))U(("((!((i13.u489.p1415==0)||(i17.u697.p1986==1)))&&((i1.u37.p109==0)||(i20.u897...227
Formula 0 simplified : G("((i13.u489.p1415==0)||(i17.u697.p1986==1))" M !"((!((i13.u489.p1415==0)||(i17.u697.p1986==1)))&&((i1.u37.p109==0)||(i20.u897.p259...164
Compilation finished in 13364 ms.
Running link step : cd /tmp/ltsmin13989836520562482791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 118 ms.
Running LTSmin : cd /tmp/ltsmin13989836520562482791;'/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' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13989836520562482791;'/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' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13989836520562482791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X(((LTLAPp2==true) U []((LTLAPp3==true))))&&<>((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 22:32:38] [INFO ] Applying decomposition
[2026-05-22 22:32:38] [INFO ] Flatten gal took : 87 ms
[2026-05-22 22:32:38] [INFO ] Decomposing Gal with order
[2026-05-22 22:32:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:32:38] [INFO ] Removed a total of 2886 redundant transitions.
[2026-05-22 22:32:38] [INFO ] Flatten gal took : 177 ms
[2026-05-22 22:32:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4951 labels/synchronizations in 155 ms.
[2026-05-22 22:32:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9128559774581595208.gal : 34 ms
[2026-05-22 22:32:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality6649403656196270090.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/LTLCardinality9128559774581595208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6649403656196270090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F((!("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u645.p1415==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u240.p1986==1))"))U(("((!((i0.i...502
Formula 0 simplified : G("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u645.p1415==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u240.p1986==1))" M !"((!((i0.i0.i0....372
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13989836520562482791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X(((LTLAPp2==true) U []((LTLAPp3==true))))&&<>((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin13989836520562482791;'/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' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-09b"
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-09b, 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-177944366300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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