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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-08b-LTLFireability-00
FORMULA_NAME ASLink-PT-08b-LTLFireability-01
FORMULA_NAME ASLink-PT-08b-LTLFireability-02
FORMULA_NAME ASLink-PT-08b-LTLFireability-03
FORMULA_NAME ASLink-PT-08b-LTLFireability-04
FORMULA_NAME ASLink-PT-08b-LTLFireability-05
FORMULA_NAME ASLink-PT-08b-LTLFireability-06
FORMULA_NAME ASLink-PT-08b-LTLFireability-07
FORMULA_NAME ASLink-PT-08b-LTLFireability-08
FORMULA_NAME ASLink-PT-08b-LTLFireability-09
FORMULA_NAME ASLink-PT-08b-LTLFireability-10
FORMULA_NAME ASLink-PT-08b-LTLFireability-11
FORMULA_NAME ASLink-PT-08b-LTLFireability-12
FORMULA_NAME ASLink-PT-08b-LTLFireability-13
FORMULA_NAME ASLink-PT-08b-LTLFireability-14
FORMULA_NAME ASLink-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779484266524

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 21:11:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:11:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:11:08] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2026-05-22 21:11:08] [INFO ] Transformed 3618 places.
[2026-05-22 21:11:08] [INFO ] Transformed 4459 transitions.
[2026-05-22 21:11:08] [INFO ] Found NUPN structural information;
[2026-05-22 21:11:08] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-08b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 221 place count 3397 transition count 4238
Iterating global reduction 0 with 221 rules applied. Total rules applied 442 place count 3397 transition count 4238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 443 place count 3397 transition count 4237
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 527 place count 3313 transition count 4110
Iterating global reduction 1 with 84 rules applied. Total rules applied 611 place count 3313 transition count 4110
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 637 place count 3313 transition count 4084
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 648 place count 3302 transition count 4073
Iterating global reduction 2 with 11 rules applied. Total rules applied 659 place count 3302 transition count 4073
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 663 place count 3298 transition count 4062
Iterating global reduction 2 with 4 rules applied. Total rules applied 667 place count 3298 transition count 4062
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 670 place count 3295 transition count 4059
Iterating global reduction 2 with 3 rules applied. Total rules applied 673 place count 3295 transition count 4059
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 676 place count 3292 transition count 4049
Iterating global reduction 2 with 3 rules applied. Total rules applied 679 place count 3292 transition count 4049
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 680 place count 3291 transition count 4041
Iterating global reduction 2 with 1 rules applied. Total rules applied 681 place count 3291 transition count 4041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 682 place count 3290 transition count 4040
Iterating global reduction 2 with 1 rules applied. Total rules applied 683 place count 3290 transition count 4040
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 684 place count 3289 transition count 4032
Iterating global reduction 2 with 1 rules applied. Total rules applied 685 place count 3289 transition count 4032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 686 place count 3288 transition count 4024
Iterating global reduction 2 with 1 rules applied. Total rules applied 687 place count 3288 transition count 4024
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 688 place count 3287 transition count 4023
Iterating global reduction 2 with 1 rules applied. Total rules applied 689 place count 3287 transition count 4023
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 690 place count 3286 transition count 4015
Iterating global reduction 2 with 1 rules applied. Total rules applied 691 place count 3286 transition count 4015
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 692 place count 3285 transition count 4007
Iterating global reduction 2 with 1 rules applied. Total rules applied 693 place count 3285 transition count 4007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 694 place count 3284 transition count 4006
Iterating global reduction 2 with 1 rules applied. Total rules applied 695 place count 3284 transition count 4006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 696 place count 3283 transition count 3998
Iterating global reduction 2 with 1 rules applied. Total rules applied 697 place count 3283 transition count 3998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 698 place count 3282 transition count 3990
Iterating global reduction 2 with 1 rules applied. Total rules applied 699 place count 3282 transition count 3990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 700 place count 3281 transition count 3989
Iterating global reduction 2 with 1 rules applied. Total rules applied 701 place count 3281 transition count 3989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 702 place count 3280 transition count 3981
Iterating global reduction 2 with 1 rules applied. Total rules applied 703 place count 3280 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 704 place count 3279 transition count 3973
Iterating global reduction 2 with 1 rules applied. Total rules applied 705 place count 3279 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 706 place count 3278 transition count 3972
Iterating global reduction 2 with 1 rules applied. Total rules applied 707 place count 3278 transition count 3972
Applied a total of 707 rules in 6465 ms. Remains 3278 /3618 variables (removed 340) and now considering 3972/4459 (removed 487) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1210791264606059518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16319274728050802894.kers'
[2026-05-22 21:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1210791264606059518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16319274728050802894.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3972 rows 3278 cols 12289 entries
Finished phase 1 with 2102 SingleSign rule and 821 generalized
[2026-05-22 21:11:15] [INFO ] Computed 355 invariants in 34 ms
Computed 355 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-16319274728050802894.kers
Total runtime 40 ms.
[2026-05-22 21:11:18] [INFO ] Implicit Places using invariants in 3187 ms returned [3112, 3123, 3134, 3142, 3150, 3158, 3166, 3177, 3185, 3193, 3204]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 3275 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3267/3618 places, 3972/4459 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3254 transition count 3959
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3254 transition count 3959
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3243 transition count 3948
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3243 transition count 3948
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3234 transition count 3939
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3234 transition count 3939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3230 transition count 3935
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3230 transition count 3935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3228 transition count 3933
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3228 transition count 3933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3226 transition count 3931
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3226 transition count 3931
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3224 transition count 3929
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3224 transition count 3929
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3222 transition count 3927
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3222 transition count 3927
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3221 transition count 3926
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3221 transition count 3926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3220 transition count 3925
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3220 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3219 transition count 3924
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3219 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3218 transition count 3923
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3218 transition count 3923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3217 transition count 3922
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3217 transition count 3922
Applied a total of 100 rules in 3275 ms. Remains 3217 /3267 variables (removed 50) and now considering 3922/3972 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17507286729927728047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2513717320548690403.kers'
[2026-05-22 21:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17507286729927728047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2513717320548690403.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3922 rows 3217 cols 12129 entries
Finished phase 1 with 2088 SingleSign rule and 785 generalized
[2026-05-22 21:11:21] [INFO ] Computed 344 invariants in 34 ms
Computed 344 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-2513717320548690403.kers
Total runtime 38 ms.
[2026-05-22 21:11:24] [INFO ] Implicit Places using invariants in 2446 ms returned []
[2026-05-22 21:11:24] [INFO ] Invariant cache hit.
[2026-05-22 21:11:34] [INFO ] Implicit Places using invariants and state equation in 9643 ms returned []
Implicit Place search using SMT with State Equation took 12092 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3217/3618 places, 3922/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25122 ms. Remains : 3217/3618 places, 3922/4459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Applied a total of 0 rules in 206 ms. Remains 3217 /3217 variables (removed 0) and now considering 3922/3922 (removed 0) transitions.
[2026-05-22 21:11:34] [INFO ] Invariant cache hit.
[2026-05-22 21:11:36] [INFO ] Implicit Places using invariants in 2257 ms returned []
[2026-05-22 21:11:36] [INFO ] Invariant cache hit.
[2026-05-22 21:11:47] [INFO ] Implicit Places using invariants and state equation in 10828 ms returned []
Implicit Place search using SMT with State Equation took 13092 ms to find 0 implicit places.
Running 3921 sub problems to find dead transitions.
[2026-05-22 21:11:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3216 variables, 209/209 constraints. Problems are: Problem set: 0 solved, 3921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3216/7139 variables, and 209 constraints, problems are : Problem set: 0 solved, 3921 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/74 constraints, Generalized P Invariants (flows): 209/270 constraints, State Equation: 0/3217 constraints, PredecessorRefiner: 3921/3921 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3921 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3216 variables, 209/209 constraints. Problems are: Problem set: 0 solved, 3921 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3216/7139 variables, and 209 constraints, problems are : Problem set: 0 solved, 3921 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/74 constraints, Generalized P Invariants (flows): 209/270 constraints, State Equation: 0/3217 constraints, PredecessorRefiner: 0/3921 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62472ms problems are : Problem set: 0 solved, 3921 unsolved
Search for dead transitions found 0 dead transitions in 62523ms
Finished structural reductions in LTL mode , in 1 iterations and 75901 ms. Remains : 3217/3217 places, 3922/3922 transitions.
Support contains 49 out of 3217 places after structural reductions.
[2026-05-22 21:12:50] [INFO ] Flatten gal took : 219 ms
[2026-05-22 21:12:50] [INFO ] Flatten gal took : 133 ms
[2026-05-22 21:12:50] [INFO ] Input system was already deterministic with 3922 transitions.
Support contains 47 out of 3217 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 1451 ms. (27 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
[2026-05-22 21:12:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 538/565 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 743/1308 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1308 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 5 (OVERLAPS) 1772/3080 variables, 228/302 constraints. Problems are: Problem set: 1 solved, 16 unsolved
SMT process timed out in 5858ms, After SMT, problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 3217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 590 transitions
Trivial Post-agglo rules discarded 590 transitions
Performed 590 trivial Post agglomeration. Transition count delta: 590
Iterating post reduction 0 with 590 rules applied. Total rules applied 590 place count 3217 transition count 3332
Reduce places removed 590 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 595 rules applied. Total rules applied 1185 place count 2627 transition count 3327
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1190 place count 2624 transition count 3325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1192 place count 2622 transition count 3325
Performed 861 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 861 Pre rules applied. Total rules applied 1192 place count 2622 transition count 2464
Deduced a syphon composed of 861 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 4 with 1806 rules applied. Total rules applied 2998 place count 1677 transition count 2464
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3058 place count 1669 transition count 2412
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3110 place count 1617 transition count 2412
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3110 place count 1617 transition count 2379
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3209 place count 1551 transition count 2379
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3209 place count 1551 transition count 2347
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3273 place count 1519 transition count 2347
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3275 place count 1517 transition count 2345
Iterating global reduction 6 with 2 rules applied. Total rules applied 3277 place count 1517 transition count 2345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3277 place count 1517 transition count 2344
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3279 place count 1516 transition count 2344
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 12 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 6 with 510 rules applied. Total rules applied 3789 place count 1260 transition count 2090
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3793 place count 1256 transition count 2086
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3798 place count 1255 transition count 2086
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 3799 place count 1255 transition count 2085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3800 place count 1254 transition count 2085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3800 place count 1254 transition count 2084
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 3802 place count 1253 transition count 2084
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3804 place count 1251 transition count 2082
Iterating global reduction 8 with 2 rules applied. Total rules applied 3806 place count 1251 transition count 2082
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 3808 place count 1251 transition count 2080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3809 place count 1250 transition count 2080
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 3811 place count 1249 transition count 2085
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 3820 place count 1249 transition count 2076
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3829 place count 1240 transition count 2076
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3836 place count 1240 transition count 2069
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3843 place count 1233 transition count 2069
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 3850 place count 1233 transition count 2069
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3851 place count 1232 transition count 2068
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 12 with 24 rules applied. Total rules applied 3875 place count 1216 transition count 2060
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3883 place count 1208 transition count 2060
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 24 Pre rules applied. Total rules applied 3883 place count 1208 transition count 2036
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 49 rules applied. Total rules applied 3932 place count 1183 transition count 2036
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 3941 place count 1174 transition count 2036
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3941 place count 1174 transition count 2035
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 3943 place count 1173 transition count 2035
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 15 with 34 rules applied. Total rules applied 3977 place count 1156 transition count 2018
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 3985 place count 1148 transition count 2010
Iterating global reduction 15 with 8 rules applied. Total rules applied 3993 place count 1148 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3994 place count 1147 transition count 2009
Iterating global reduction 15 with 1 rules applied. Total rules applied 3995 place count 1147 transition count 2009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3996 place count 1147 transition count 2008
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 4003 place count 1147 transition count 2001
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 4010 place count 1140 transition count 2001
Applied a total of 4010 rules in 1307 ms. Remains 1140 /3217 variables (removed 2077) and now considering 2001/3922 (removed 1921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1308 ms. Remains : 1140/3217 places, 2001/3922 transitions.
RANDOM walk for 40000 steps (402 resets) in 489 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 151136 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 16
Probabilistic random walk after 151136 steps, saw 35545 distinct states, run finished after 3010 ms. (steps per millisecond=50 ) 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-10269005997717494083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5840264258596359125.kers'
[2026-05-22 21:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10269005997717494083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5840264258596359125.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 2001 rows 1120 cols 7828 entries
Finished phase 1 with 306 SingleSign rule and 644 generalized
[2026-05-22 21:13:01] [INFO ] Computed 190 invariants in 17 ms
Computed 190 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5840264258596359125.kers
Total runtime 20 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 205/230 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 85/315 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/342 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 21/363 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/364 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 480/844 variables, 63/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/844 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/844 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 102/946 variables, 32/130 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/946 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 7/953 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/953 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 83/1036 variables, 33/170 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1036 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1036 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 41/1077 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1077 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 2/1079 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1079 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 51/1130 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1130 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 10/1140 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1140 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 2001/3141 variables, 1140/1332 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3141 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 31 (OVERLAPS) 0/3141 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3141/3141 variables, and 1332 constraints, problems are : Problem set: 0 solved, 16 unsolved in 11661 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 105/105 constraints, State Equation: 1140/1140 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 205/230 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 85/315 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/342 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 21/363 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/364 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 480/844 variables, 63/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/844 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/844 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 102/946 variables, 32/130 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/946 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 7/953 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/953 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 83/1036 variables, 33/170 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1036 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1036 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 41/1077 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1077 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 2/1079 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1079 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 51/1130 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1130 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 10/1140 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1140 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 29 (OVERLAPS) 2001/3141 variables, 1140/1332 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3141 variables, 9/1341 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3141 variables, 0/1341 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/3141 variables, 1/1342 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3141 variables, 0/1342 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3141/3141 variables, and 1342 constraints, problems are : Problem set: 7 solved, 9 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 105/105 constraints, State Equation: 1140/1140 constraints, PredecessorRefiner: 9/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56742ms problems are : Problem set: 7 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 2001/2001 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 1140 transition count 1994
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1133 transition count 1994
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1132 transition count 1986
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1132 transition count 1986
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1131 transition count 1978
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1131 transition count 1978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1130 transition count 1970
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1130 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1129 transition count 1962
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1129 transition count 1962
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1128 transition count 1954
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1128 transition count 1954
Applied a total of 24 rules in 256 ms. Remains 1128 /1140 variables (removed 12) and now considering 1954/2001 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 1128/1140 places, 1954/2001 transitions.
RANDOM walk for 40000 steps (400 resets) in 612 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (50 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (47 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 163809 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 9
Probabilistic random walk after 163809 steps, saw 38731 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) 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-5423737417082283793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3628726569336471109.kers'
[2026-05-22 21:14:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5423737417082283793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3628726569336471109.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 1954 rows 1108 cols 7654 entries
Finished phase 1 with 266 SingleSign rule and 672 generalized
[2026-05-22 21:14:02] [INFO ] Computed 190 invariants in 19 ms
Computed 190 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-3628726569336471109.kers
Total runtime 21 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 59/187 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 25/212 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 19/231 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 327/559 variables, 42/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 84/643 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/643 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 62/705 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 161/866 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/866 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 59/925 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/925 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 5/930 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/930 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 128/1058 variables, 21/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1058 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 52/1110 variables, 10/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1110 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 1/1111 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1111 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 17/1128 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1128 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 1954/3082 variables, 1128/1319 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3082 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 0/3082 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3082/3082 variables, and 1319 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7475 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 105/105 constraints, State Equation: 1128/1128 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 59/187 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 25/212 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 19/231 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 327/559 variables, 42/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 84/643 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/643 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 62/705 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 161/866 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/866 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 59/925 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/925 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/925 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 5/930 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/930 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 128/1058 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1058 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 52/1110 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1110 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 1/1111 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1111 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 17/1128 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1128 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 1954/3082 variables, 1128/1320 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3082 variables, 9/1329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3082 variables, 4/1333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3082 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 0/3082 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3082/3082 variables, and 1333 constraints, problems are : Problem set: 0 solved, 9 unsolved in 46272 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 105/105 constraints, State Equation: 1128/1128 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53788ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 39140 ms.
Support contains 8 out of 1128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1128/1128 places, 1954/1954 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 1128 transition count 1953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1127 transition count 1953
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 1125 transition count 1951
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1124 transition count 1950
Applied a total of 7 rules in 131 ms. Remains 1124 /1128 variables (removed 4) and now considering 1950/1954 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 1124/1128 places, 1950/1954 transitions.
FORMULA ASLink-PT-08b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 132 stabilizing places and 132 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)&&X(X(X(X(G(p1)))))))'
Support contains 1 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3209 transition count 3902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3209 transition count 3902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 3209 transition count 3901
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 3206 transition count 3891
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3882
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3873
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3201 transition count 3865
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3201 transition count 3865
Applied a total of 33 rules in 1908 ms. Remains 3201 /3217 variables (removed 16) and now considering 3865/3922 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16965743995374900049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11538768367955531910.kers'
[2026-05-22 21:15:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16965743995374900049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11538768367955531910.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3865 rows 3201 cols 11923 entries
Finished phase 1 with 2081 SingleSign rule and 776 generalized
[2026-05-22 21:15:37] [INFO ] Computed 344 invariants in 46 ms
Computed 344 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-11538768367955531910.kers
Total runtime 49 ms.
[2026-05-22 21:15:40] [INFO ] Implicit Places using invariants in 2477 ms returned []
[2026-05-22 21:15:40] [INFO ] Invariant cache hit.
[2026-05-22 21:15:49] [INFO ] Implicit Places using invariants and state equation in 9392 ms returned []
Implicit Place search using SMT with State Equation took 11893 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2026-05-22 21:15:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61835ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61846ms
Starting structural reductions in LTL mode, iteration 1 : 3201/3217 places, 3865/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75662 ms. Remains : 3201/3217 places, 3865/3922 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)&&X(X(X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-00 finished in 76311 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 3217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 3216 transition count 3321
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 605 rules applied. Total rules applied 1205 place count 2616 transition count 3316
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1208 place count 2613 transition count 3316
Performed 870 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 870 Pre rules applied. Total rules applied 1208 place count 2613 transition count 2446
Deduced a syphon composed of 870 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 954 places and 0 transitions.
Iterating global reduction 3 with 1824 rules applied. Total rules applied 3032 place count 1659 transition count 2446
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3092 place count 1651 transition count 2394
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3144 place count 1599 transition count 2394
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3144 place count 1599 transition count 2361
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3243 place count 1533 transition count 2361
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3243 place count 1533 transition count 2329
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3307 place count 1501 transition count 2329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 3312 place count 1496 transition count 2312
Iterating global reduction 5 with 5 rules applied. Total rules applied 3317 place count 1496 transition count 2312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3317 place count 1496 transition count 2311
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3319 place count 1495 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3320 place count 1494 transition count 2303
Iterating global reduction 5 with 1 rules applied. Total rules applied 3321 place count 1494 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3322 place count 1493 transition count 2295
Iterating global reduction 5 with 1 rules applied. Total rules applied 3323 place count 1493 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3324 place count 1492 transition count 2287
Iterating global reduction 5 with 1 rules applied. Total rules applied 3325 place count 1492 transition count 2287
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3326 place count 1491 transition count 2279
Iterating global reduction 5 with 1 rules applied. Total rules applied 3327 place count 1491 transition count 2279
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 5 with 510 rules applied. Total rules applied 3837 place count 1235 transition count 2025
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3841 place count 1231 transition count 2021
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3846 place count 1230 transition count 2021
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 3847 place count 1230 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3848 place count 1229 transition count 2020
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3848 place count 1229 transition count 2019
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 3850 place count 1228 transition count 2019
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3852 place count 1226 transition count 2017
Iterating global reduction 7 with 2 rules applied. Total rules applied 3854 place count 1226 transition count 2017
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 3856 place count 1226 transition count 2015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3857 place count 1225 transition count 2015
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3859 place count 1224 transition count 2020
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3861 place count 1222 transition count 2018
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3885 place count 1206 transition count 2010
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3893 place count 1198 transition count 2010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3893 place count 1198 transition count 1986
Deduced a syphon composed of 24 places in 26 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3942 place count 1173 transition count 1986
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3959 place count 1156 transition count 1986
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3959 place count 1156 transition count 1985
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3961 place count 1155 transition count 1985
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 4011 place count 1130 transition count 1960
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4027 place count 1114 transition count 1944
Iterating global reduction 12 with 16 rules applied. Total rules applied 4043 place count 1114 transition count 1944
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4051 place count 1106 transition count 1936
Iterating global reduction 12 with 8 rules applied. Total rules applied 4059 place count 1106 transition count 1936
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4067 place count 1106 transition count 1928
Applied a total of 4067 rules in 1285 ms. Remains 1106 /3217 variables (removed 2111) and now considering 1928/3922 (removed 1994) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7415674971596074249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12932831127568740899.kers'
[2026-05-22 21:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7415674971596074249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12932831127568740899.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 1 ms.
// Phase 1: matrix 1928 rows 1080 cols 7503 entries
Finished phase 1 with 260 SingleSign rule and 664 generalized
[2026-05-22 21:16:53] [INFO ] Computed 182 invariants in 20 ms
Computed 182 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-12932831127568740899.kers
Total runtime 24 ms.
[2026-05-22 21:16:54] [INFO ] Implicit Places using invariants in 1050 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 204, 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, 815, 866, 867, 879, 880, 882, 899, 917, 937, 988, 989, 992, 1003, 1004, 1005, 1023, 1044, 1045, 1046, 1047]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1067 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1033/3217 places, 1928/3922 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1033 transition count 1795
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 900 transition count 1795
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 266 place count 900 transition count 1756
Deduced a syphon composed of 39 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 345 place count 860 transition count 1756
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 856 transition count 1748
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 365 place count 848 transition count 1748
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 368 place count 845 transition count 1745
Iterating global reduction 4 with 3 rules applied. Total rules applied 371 place count 845 transition count 1745
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 374 place count 845 transition count 1742
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 498 place count 783 transition count 1680
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 781 transition count 1681
Applied a total of 502 rules in 159 ms. Remains 781 /1033 variables (removed 252) and now considering 1681/1928 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12325697470541096821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13905234914119449454.kers'
[2026-05-22 21:16:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12325697470541096821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13905234914119449454.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1681 rows 781 cols 6771 entries
Finished phase 1 with 231 SingleSign rule and 446 generalized
[2026-05-22 21:16:54] [INFO ] Computed 104 invariants in 14 ms
Computed 104 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13905234914119449454.kers
Total runtime 16 ms.
[2026-05-22 21:16:55] [INFO ] Implicit Places using invariants in 802 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 614, 620, 625, 702, 708, 713, 778]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 804 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 756/3217 places, 1681/3922 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 756 transition count 1680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 755 transition count 1680
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 739 transition count 1664
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 739 transition count 1664
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 723 transition count 1648
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 723 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 715 transition count 1640
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 715 transition count 1640
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 707 transition count 1632
Applied a total of 98 rules in 175 ms. Remains 707 /756 variables (removed 49) and now considering 1632/1681 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2238333158372319241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9274160074256466308.kers'
[2026-05-22 21:16:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2238333158372319241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9274160074256466308.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1632 rows 707 cols 6590 entries
Finished phase 1 with 215 SingleSign rule and 413 generalized
[2026-05-22 21:16:55] [INFO ] Computed 79 invariants in 29 ms
Computed 79 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-9274160074256466308.kers
Total runtime 31 ms.
[2026-05-22 21:16:56] [INFO ] Implicit Places using invariants in 543 ms returned []
[2026-05-22 21:16:56] [INFO ] Invariant cache hit.
[2026-05-22 21:16:57] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 707/3217 places, 1632/3922 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5781 ms. Remains : 707/3217 places, 1632/3922 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 64 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-01
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-01 finished in 5896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((p1&&F(G(p2)))))))'
Support contains 4 out of 3217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 3216 transition count 3324
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 602 rules applied. Total rules applied 1199 place count 2619 transition count 3319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1202 place count 2616 transition count 3319
Performed 868 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 868 Pre rules applied. Total rules applied 1202 place count 2616 transition count 2451
Deduced a syphon composed of 868 places in 5 ms
Ensure Unique test removed 83 places
Reduce places removed 951 places and 0 transitions.
Iterating global reduction 3 with 1819 rules applied. Total rules applied 3021 place count 1665 transition count 2451
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3081 place count 1657 transition count 2399
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3133 place count 1605 transition count 2399
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3133 place count 1605 transition count 2367
Deduced a syphon composed of 32 places in 6 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 3229 place count 1541 transition count 2367
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 3229 place count 1541 transition count 2336
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 3291 place count 1510 transition count 2336
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3294 place count 1507 transition count 2326
Iterating global reduction 5 with 3 rules applied. Total rules applied 3297 place count 1507 transition count 2326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3297 place count 1507 transition count 2325
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3299 place count 1506 transition count 2325
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3300 place count 1505 transition count 2317
Iterating global reduction 5 with 1 rules applied. Total rules applied 3301 place count 1505 transition count 2317
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3302 place count 1504 transition count 2309
Iterating global reduction 5 with 1 rules applied. Total rules applied 3303 place count 1504 transition count 2309
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3304 place count 1503 transition count 2301
Iterating global reduction 5 with 1 rules applied. Total rules applied 3305 place count 1503 transition count 2301
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3306 place count 1502 transition count 2293
Iterating global reduction 5 with 1 rules applied. Total rules applied 3307 place count 1502 transition count 2293
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Deduced a syphon composed of 257 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 5 with 517 rules applied. Total rules applied 3824 place count 1242 transition count 2036
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3828 place count 1238 transition count 2032
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3833 place count 1237 transition count 2032
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 3834 place count 1237 transition count 2031
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3835 place count 1236 transition count 2031
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3835 place count 1236 transition count 2030
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3837 place count 1235 transition count 2030
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3839 place count 1233 transition count 2028
Iterating global reduction 7 with 2 rules applied. Total rules applied 3841 place count 1233 transition count 2028
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 3843 place count 1233 transition count 2026
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3844 place count 1232 transition count 2026
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3846 place count 1231 transition count 2031
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3848 place count 1229 transition count 2029
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3872 place count 1213 transition count 2021
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3880 place count 1205 transition count 2021
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3880 place count 1205 transition count 1997
Deduced a syphon composed of 24 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3929 place count 1180 transition count 1997
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 3945 place count 1164 transition count 1997
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3945 place count 1164 transition count 1996
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3947 place count 1163 transition count 1996
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 3995 place count 1139 transition count 1972
Discarding 14 places :
Symmetric choice reduction at 12 with 14 rule applications. Total rules 4009 place count 1125 transition count 1958
Iterating global reduction 12 with 14 rules applied. Total rules applied 4023 place count 1125 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 4030 place count 1118 transition count 1951
Iterating global reduction 12 with 7 rules applied. Total rules applied 4037 place count 1118 transition count 1951
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 4044 place count 1118 transition count 1944
Applied a total of 4044 rules in 995 ms. Remains 1118 /3217 variables (removed 2099) and now considering 1944/3922 (removed 1978) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10501053370818473547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9770599053417538367.kers'
[2026-05-22 21:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10501053370818473547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9770599053417538367.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 1 ms.
// Phase 1: matrix 1944 rows 1093 cols 7561 entries
Finished phase 1 with 255 SingleSign rule and 679 generalized
[2026-05-22 21:16:59] [INFO ] Computed 184 invariants in 18 ms
Computed 184 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9770599053417538367.kers
Total runtime 22 ms.
[2026-05-22 21:17:00] [INFO ] Implicit Places using invariants in 1065 ms returned [1, 18, 19, 31, 48, 66, 140, 150, 151, 153, 170, 188, 207, 259, 260, 272, 273, 294, 312, 332, 382, 387, 388, 400, 401, 403, 420, 438, 458, 509, 510, 522, 523, 525, 542, 560, 580, 631, 632, 644, 645, 647, 664, 682, 702, 735, 756, 757, 769, 770, 772, 789, 807, 827, 878, 879, 891, 892, 894, 911, 929, 949, 1000, 1001, 1004, 1015, 1016, 1017, 1035, 1056, 1057, 1058, 1059]
[2026-05-22 21:17:00] [INFO ] Actually due to overlaps returned [1035, 1017, 48, 170, 294, 420, 542, 664, 789, 911, 31, 150, 153, 272, 400, 403, 522, 525, 644, 647, 769, 772, 891, 894, 1015, 1056, 151, 273, 401, 523, 645, 770, 892, 1016, 1057, 1, 18, 259, 260, 387, 388, 509, 510, 631, 632, 756, 757, 878, 879, 1000, 1001, 66, 1058, 19, 140, 188, 207, 312, 332, 382, 438, 458, 560, 580, 682, 702, 807, 827, 929, 949, 1004, 1059]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1069 ms to find 72 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1046/3217 places, 1944/3922 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 1045 transition count 1817
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 918 transition count 1816
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 917 transition count 1816
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 257 place count 917 transition count 1775
Deduced a syphon composed of 41 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 340 place count 875 transition count 1775
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 352 place count 871 transition count 1767
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 360 place count 863 transition count 1767
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 363 place count 860 transition count 1764
Iterating global reduction 5 with 3 rules applied. Total rules applied 366 place count 860 transition count 1764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 369 place count 860 transition count 1761
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 491 place count 799 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 492 place count 798 transition count 1698
Iterating global reduction 6 with 1 rules applied. Total rules applied 493 place count 798 transition count 1698
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 497 place count 796 transition count 1699
Applied a total of 497 rules in 146 ms. Remains 796 /1046 variables (removed 250) and now considering 1699/1944 (removed 245) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12836576417961735484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10691334421366141967.kers'
[2026-05-22 21:17:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12836576417961735484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10691334421366141967.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1699 rows 796 cols 6819 entries
Finished phase 1 with 226 SingleSign rule and 464 generalized
[2026-05-22 21:17:00] [INFO ] Computed 106 invariants in 44 ms
Computed 106 P flows in 45 ms.
Exported basis to /tmp/petrispot-output-10691334421366141967.kers
Total runtime 48 ms.
[2026-05-22 21:17:00] [INFO ] Implicit Places using invariants in 712 ms returned [91, 97, 102, 178, 184, 189, 275, 281, 286, 363, 369, 374, 451, 457, 462, 547, 552, 629, 635, 640, 717, 723, 728, 793]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 724 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 772/3217 places, 1699/3922 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 772 transition count 1698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 771 transition count 1698
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 756 transition count 1683
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 756 transition count 1683
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 47 place count 741 transition count 1668
Iterating global reduction 2 with 15 rules applied. Total rules applied 62 place count 741 transition count 1668
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 734 transition count 1661
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 734 transition count 1661
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 726 transition count 1653
Applied a total of 92 rules in 124 ms. Remains 726 /772 variables (removed 46) and now considering 1653/1699 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2788410487926639304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12745137858202937952.kers'
[2026-05-22 21:17:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2788410487926639304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12745137858202937952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1653 rows 726 cols 6649 entries
Finished phase 1 with 211 SingleSign rule and 433 generalized
[2026-05-22 21:17:01] [INFO ] Computed 82 invariants in 14 ms
Computed 82 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12745137858202937952.kers
Total runtime 17 ms.
[2026-05-22 21:17:01] [INFO ] Implicit Places using invariants in 889 ms returned []
[2026-05-22 21:17:01] [INFO ] Invariant cache hit.
[2026-05-22 21:17:03] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2562 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 726/3217 places, 1653/3922 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5621 ms. Remains : 726/3217 places, 1653/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((p1&&F(G(p2)))))))'
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-02
Product exploration explored 100000 steps with 1121 reset in 340 ms.
Product exploration explored 100000 steps with 1128 reset in 352 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 12 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (456 resets) in 263 ms. (151 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (73 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (73 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
[2026-05-22 21:17:04] [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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/127 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 153/280 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/416 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 27/443 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 30/473 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/479 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 231/710 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/710 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/711 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 15/726 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1653/2379 variables, 726/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2379 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/2379 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2379/2379 variables, and 808 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/127 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 153/280 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/416 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 27/443 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 30/473 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/479 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 231/710 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/710 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/711 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 15/726 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1653/2379 variables, 726/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2379 variables, 5/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2379 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2379 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2379/2379 variables, and 813 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4825ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1920 ms.
Support contains 4 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1653/1653 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 726 transition count 1614
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 85 place count 687 transition count 1607
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 106 place count 687 transition count 1586
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 127 place count 666 transition count 1586
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 666 transition count 1586
Applied a total of 128 rules in 132 ms. Remains 666 /726 variables (removed 60) and now considering 1586/1653 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 666/726 places, 1586/1653 transitions.
RANDOM walk for 40000 steps (646 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (109 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (109 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (108 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 213511 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 5
Probabilistic random walk after 213511 steps, saw 55572 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) 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-589680115388309201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16907810570096879834.kers'
[2026-05-22 21:17:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-589680115388309201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16907810570096879834.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1586 rows 666 cols 6629 entries
Finished phase 1 with 199 SingleSign rule and 385 generalized
[2026-05-22 21:17:15] [INFO ] Computed 82 invariants in 14 ms
Computed 82 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16907810570096879834.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/122 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/262 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/388 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/414 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/444 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/450 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 202/652 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/653 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 13/666 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1586/2252 variables, 666/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2252 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/2252 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2252/2252 variables, and 748 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/122 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/262 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/388 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/414 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/444 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/450 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 202/652 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/653 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 13/666 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1586/2252 variables, 666/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2252 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2252 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2252 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2252/2252 variables, and 753 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3450 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4809ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1863 ms.
Support contains 4 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1586/1586 transitions.
Applied a total of 0 rules in 26 ms. Remains 666 /666 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 666/666 places, 1586/1586 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1586/1586 transitions.
Applied a total of 0 rules in 24 ms. Remains 666 /666 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2026-05-22 21:17:21] [INFO ] Invariant cache hit.
[2026-05-22 21:17:22] [INFO ] Implicit Places using invariants in 640 ms returned [93, 94, 164, 165, 245, 246, 316, 317, 387, 388, 465, 466, 536, 537]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 665 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 652/666 places, 1586/1586 transitions.
Applied a total of 0 rules in 24 ms. Remains 652 /652 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 713 ms. Remains : 652/666 places, 1586/1586 transitions.
RANDOM walk for 40000 steps (626 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (105 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (104 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (108 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 197740 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 5
Probabilistic random walk after 197740 steps, saw 51191 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) 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-463902666065841135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14353260737134668796.kers'
[2026-05-22 21:17:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-463902666065841135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14353260737134668796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1586 rows 652 cols 6440 entries
Finished phase 1 with 167 SingleSign rule and 417 generalized
[2026-05-22 21:17:25] [INFO ] Computed 68 invariants in 13 ms
Computed 68 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14353260737134668796.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/122 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 132/258 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/384 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/410 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/440 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/446 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 194/640 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/641 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 11/652 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/652 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1586/2238 variables, 652/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2238 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/2238 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2238/2238 variables, and 720 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/122 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 132/258 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/384 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/410 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/440 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/446 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 194/640 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/641 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 11/652 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/652 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1586/2238 variables, 652/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2238 variables, 5/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2238 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2238 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2238/2238 variables, and 725 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4008 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5588ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2344 ms.
Support contains 4 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1586/1586 transitions.
Applied a total of 0 rules in 29 ms. Remains 652 /652 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 652/652 places, 1586/1586 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1586/1586 transitions.
Applied a total of 0 rules in 30 ms. Remains 652 /652 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2026-05-22 21:17:33] [INFO ] Invariant cache hit.
[2026-05-22 21:17:34] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-05-22 21:17:34] [INFO ] Invariant cache hit.
[2026-05-22 21:17:35] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2026-05-22 21:17:35] [INFO ] Redundant transitions in 153 ms returned []
Running 1545 sub problems to find dead transitions.
[2026-05-22 21:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 42/66 constraints. Problems are: Problem set: 0 solved, 1545 unsolved
SMT process timed out in 30672ms, After SMT, problems are : Problem set: 0 solved, 1545 unsolved
Search for dead transitions found 0 dead transitions in 30675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32811 ms. Remains : 652/652 places, 1586/1586 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 652 /652 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Running SMT prover for 5 properties.
[2026-05-22 21:18:06] [INFO ] Invariant cache hit.
[2026-05-22 21:18:06] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2026-05-22 21:18:06] [INFO ] [Real]Absence check using 26 positive and 42 generalized place invariants in 33 ms returned sat
[2026-05-22 21:18:06] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-22 21:18:06] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2026-05-22 21:18:06] [INFO ] [Nat]Absence check using 26 positive and 42 generalized place invariants in 43 ms returned sat
[2026-05-22 21:18:07] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-22 21:18:08] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-22 21:18:08] [INFO ] After 1626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1887 ms.
Knowledge based reduction with 12 factoid took 75 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 63987 ms.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 1653/1653 transitions.
Applied a total of 0 rules in 25 ms. Remains 726 /726 variables (removed 0) and now considering 1653/1653 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7361692880692771747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13298485690971792058.kers'
[2026-05-22 21:18:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7361692880692771747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13298485690971792058.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1653 rows 726 cols 6649 entries
Finished phase 1 with 211 SingleSign rule and 433 generalized
[2026-05-22 21:18:08] [INFO ] Computed 82 invariants in 14 ms
Computed 82 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13298485690971792058.kers
Total runtime 16 ms.
[2026-05-22 21:18:09] [INFO ] Implicit Places using invariants in 693 ms returned []
[2026-05-22 21:18:09] [INFO ] Invariant cache hit.
[2026-05-22 21:18:11] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
[2026-05-22 21:18:11] [INFO ] Redundant transitions in 105 ms returned []
Running 1596 sub problems to find dead transitions.
[2026-05-22 21:18:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 717/2379 variables, and 62 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 44/57 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Problem TDEAD731 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/2379 variables, and 64 constraints, problems are : Problem set: 4 solved, 1592 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 44/57 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/1596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60495ms problems are : Problem set: 4 solved, 1592 unsolved
Search for dead transitions found 4 dead transitions in 60499ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 726/726 places, 1649/1653 transitions.
Applied a total of 0 rules in 25 ms. Remains 726 /726 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
[2026-05-22 21:19:11] [INFO ] Redundant transitions in 44 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63202 ms. Remains : 726/726 places, 1649/1653 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 12 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (474 resets) in 204 ms. (195 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (71 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (68 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14663213840838240286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14956456030928137536.kers'
[2026-05-22 21:19:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14663213840838240286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14956456030928137536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1649 rows 726 cols 6633 entries
Finished phase 1 with 210 SingleSign rule and 434 generalized
[2026-05-22 21:19:12] [INFO ] Computed 82 invariants in 14 ms
Computed 82 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14956456030928137536.kers
Total runtime 15 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 144/264 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 148/412 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/439 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 30/469 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/475 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 235/710 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/711 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 15/726 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1649/2375 variables, 726/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2375 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2375 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2375/2375 variables, and 808 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 144/264 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 148/412 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/439 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 30/469 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/475 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 235/710 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/711 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 15/726 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1649/2375 variables, 726/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2375 variables, 5/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2375 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/2375 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2375/2375 variables, and 813 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4933ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1633 ms.
Support contains 4 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1649/1649 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 726 transition count 1610
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 85 place count 687 transition count 1603
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 106 place count 687 transition count 1582
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 127 place count 666 transition count 1582
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 666 transition count 1582
Applied a total of 128 rules in 112 ms. Remains 666 /726 variables (removed 60) and now considering 1582/1649 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 666/726 places, 1582/1649 transitions.
RANDOM walk for 40000 steps (710 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (108 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (103 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (104 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 197456 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 5
Probabilistic random walk after 197456 steps, saw 51102 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) 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-967112208355034225.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17141787681288364539.kers'
[2026-05-22 21:19:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-967112208355034225.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17141787681288364539.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1582 rows 666 cols 6613 entries
Finished phase 1 with 198 SingleSign rule and 386 generalized
[2026-05-22 21:19:22] [INFO ] Computed 82 invariants in 18 ms
Computed 82 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17141787681288364539.kers
Total runtime 19 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 129/248 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 138/386 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/412 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/442 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/448 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 204/652 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/653 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 13/666 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1582/2248 variables, 666/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2248 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/2248 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2248/2248 variables, and 748 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 129/248 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 138/386 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/412 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/442 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/448 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 204/652 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/653 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 13/666 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1582/2248 variables, 666/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2248 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2248 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2248 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2248/2248 variables, and 753 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5111ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1147 ms.
Support contains 4 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1582/1582 transitions.
Applied a total of 0 rules in 33 ms. Remains 666 /666 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 666/666 places, 1582/1582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1582/1582 transitions.
Applied a total of 0 rules in 26 ms. Remains 666 /666 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
[2026-05-22 21:19:28] [INFO ] Invariant cache hit.
[2026-05-22 21:19:29] [INFO ] Implicit Places using invariants in 530 ms returned [93, 94, 164, 165, 245, 246, 316, 317, 387, 388, 465, 466, 536, 537]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 534 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 652/666 places, 1582/1582 transitions.
Applied a total of 0 rules in 24 ms. Remains 652 /652 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 584 ms. Remains : 652/666 places, 1582/1582 transitions.
RANDOM walk for 40000 steps (657 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (104 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (109 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 158867 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 5
Probabilistic random walk after 158867 steps, saw 40489 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) 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-4369862519342209977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2920011691307262054.kers'
[2026-05-22 21:19:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4369862519342209977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2920011691307262054.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1582 rows 652 cols 6424 entries
Finished phase 1 with 166 SingleSign rule and 418 generalized
[2026-05-22 21:19:32] [INFO ] Computed 68 invariants in 20 ms
Computed 68 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2920011691307262054.kers
Total runtime 21 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 125/244 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 138/382 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/408 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/438 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/444 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 196/640 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/641 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 11/652 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/652 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1582/2234 variables, 652/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2234 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/2234 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2234/2234 variables, and 720 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 125/244 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 138/382 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 26/408 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 30/438 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/444 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 196/640 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/641 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 11/652 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/652 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1582/2234 variables, 652/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2234 variables, 5/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2234 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2234 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2234/2234 variables, and 725 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4255ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1189 ms.
Support contains 4 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1582/1582 transitions.
Applied a total of 0 rules in 24 ms. Remains 652 /652 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 652/652 places, 1582/1582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1582/1582 transitions.
Applied a total of 0 rules in 24 ms. Remains 652 /652 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
[2026-05-22 21:19:37] [INFO ] Invariant cache hit.
[2026-05-22 21:19:38] [INFO ] Implicit Places using invariants in 595 ms returned []
[2026-05-22 21:19:38] [INFO ] Invariant cache hit.
[2026-05-22 21:19:40] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
[2026-05-22 21:19:40] [INFO ] Redundant transitions in 22 ms returned []
Running 1541 sub problems to find dead transitions.
[2026-05-22 21:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 1541 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/2234 variables, and 67 constraints, problems are : Problem set: 0 solved, 1541 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 22/24 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/652 constraints, PredecessorRefiner: 1541/1541 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 1541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1541 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/2234 variables, and 67 constraints, problems are : Problem set: 0 solved, 1541 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 22/24 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/652 constraints, PredecessorRefiner: 0/1541 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 1541 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62964 ms. Remains : 652/652 places, 1582/1582 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 652 /652 variables (removed 0) and now considering 1582/1582 (removed 0) transitions.
Running SMT prover for 5 properties.
[2026-05-22 21:20:40] [INFO ] Invariant cache hit.
[2026-05-22 21:20:40] [INFO ] [Real]Absence check using 24 positive place invariants in 8 ms returned sat
[2026-05-22 21:20:40] [INFO ] [Real]Absence check using 24 positive and 44 generalized place invariants in 35 ms returned sat
[2026-05-22 21:20:40] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-22 21:20:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 16 ms returned sat
[2026-05-22 21:20:41] [INFO ] [Nat]Absence check using 24 positive and 44 generalized place invariants in 12 ms returned sat
[2026-05-22 21:20:41] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-22 21:20:42] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-22 21:20:42] [INFO ] After 1417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1640 ms.
Knowledge based reduction with 12 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 90652 ms.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1141 reset in 312 ms.
Product exploration explored 100000 steps with 1136 reset in 266 ms.
Built C files in :
/tmp/ltsmin3340026096331475659
[2026-05-22 21:20:43] [INFO ] Too many transitions (1649) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:20:43] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3340026096331475659
Running compilation step : cd /tmp/ltsmin3340026096331475659;'/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/ltsmin3340026096331475659;'/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/ltsmin3340026096331475659;'/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 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 1649/1649 transitions.
Applied a total of 0 rules in 26 ms. Remains 726 /726 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17696871340167812610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11343256652280822147.kers'
[2026-05-22 21:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17696871340167812610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11343256652280822147.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1649 rows 726 cols 6633 entries
Finished phase 1 with 210 SingleSign rule and 434 generalized
[2026-05-22 21:20:46] [INFO ] Computed 82 invariants in 38 ms
Computed 82 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-11343256652280822147.kers
Total runtime 53 ms.
[2026-05-22 21:20:47] [INFO ] Implicit Places using invariants in 625 ms returned []
[2026-05-22 21:20:47] [INFO ] Invariant cache hit.
[2026-05-22 21:20:48] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2026-05-22 21:20:48] [INFO ] Redundant transitions in 45 ms returned []
Running 1592 sub problems to find dead transitions.
[2026-05-22 21:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 717/2375 variables, and 60 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 43/59 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/2375 variables, and 60 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 43/59 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/1592 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60648ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63122 ms. Remains : 726/726 places, 1649/1649 transitions.
Built C files in :
/tmp/ltsmin3915480247749310848
[2026-05-22 21:21:49] [INFO ] Too many transitions (1649) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:21:49] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3915480247749310848
Running compilation step : cd /tmp/ltsmin3915480247749310848;'/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/ltsmin3915480247749310848;'/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/ltsmin3915480247749310848;'/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:21:52] [INFO ] Flatten gal took : 55 ms
[2026-05-22 21:21:53] [INFO ] Flatten gal took : 57 ms
[2026-05-22 21:21:53] [INFO ] Time to serialize gal into /tmp/LTL2069679578973914391.gal : 18 ms
[2026-05-22 21:21:53] [INFO ] Time to serialize properties into /tmp/LTL15490946295331070880.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/LTL2069679578973914391.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17261444710883927626.hoa' '-atoms' '/tmp/LTL15490946295331070880.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/LTL15490946295331070880.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17261444710883927626.hoa
Detected timeout of ITS tools.
[2026-05-22 21:22:08] [INFO ] Flatten gal took : 43 ms
[2026-05-22 21:22:08] [INFO ] Flatten gal took : 46 ms
[2026-05-22 21:22:08] [INFO ] Time to serialize gal into /tmp/LTL3285435101008630293.gal : 12 ms
[2026-05-22 21:22:08] [INFO ] Time to serialize properties into /tmp/LTL2999754455710717905.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/LTL3285435101008630293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2999754455710717905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((p887==0)||(p1039==0))")))||(F(("(p2282==0)")&&(F(G("(p218==1)"))))))))
Formula 0 simplified : F(XG!"((p887==0)||(p1039==0))" & (GF!"(p218==1)" | G!"(p2282==0)"))
Detected timeout of ITS tools.
[2026-05-22 21:22:23] [INFO ] Flatten gal took : 65 ms
[2026-05-22 21:22:23] [INFO ] Applying decomposition
[2026-05-22 21:22:23] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9813542591921758415.txt' '-o' '/tmp/graph9813542591921758415.bin' '-w' '/tmp/graph9813542591921758415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9813542591921758415.bin' '-l' '-1' '-v' '-w' '/tmp/graph9813542591921758415.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:22:23] [INFO ] Decomposing Gal with order
[2026-05-22 21:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:22:24] [INFO ] Removed a total of 3203 redundant transitions.
[2026-05-22 21:22:24] [INFO ] Flatten gal took : 219 ms
[2026-05-22 21:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 108 ms.
[2026-05-22 21:22:24] [INFO ] Time to serialize gal into /tmp/LTL7733108855832924510.gal : 13 ms
[2026-05-22 21:22:24] [INFO ] Time to serialize properties into /tmp/LTL15073655522906964774.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/LTL7733108855832924510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15073655522906964774.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((i6.u52.p887==0)||(i6.u63.p1039==0))")))||(F(("(i11.u118.p2282==0)")&&(F(G("(i1.u24.p218==1)"))))))))
Formula 0 simplified : F(XG!"((i6.u52.p887==0)||(i6.u63.p1039==0))" & (GF!"(i1.u24.p218==1)" | G!"(i11.u118.p2282==0)"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLFireability-02 finished in 341385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0&&X(G(p1)))))))))'
Support contains 2 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3209 transition count 3902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3209 transition count 3902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 3209 transition count 3901
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 3206 transition count 3891
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3882
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3873
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3201 transition count 3865
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3201 transition count 3865
Applied a total of 33 rules in 1914 ms. Remains 3201 /3217 variables (removed 16) and now considering 3865/3922 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15796648898587140905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17799241044412135038.kers'
[2026-05-22 21:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15796648898587140905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17799241044412135038.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3865 rows 3201 cols 11923 entries
Finished phase 1 with 2081 SingleSign rule and 776 generalized
[2026-05-22 21:22:41] [INFO ] Computed 344 invariants in 75 ms
Computed 344 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-17799241044412135038.kers
Total runtime 83 ms.
[2026-05-22 21:22:43] [INFO ] Implicit Places using invariants in 2191 ms returned []
[2026-05-22 21:22:43] [INFO ] Invariant cache hit.
[2026-05-22 21:22:52] [INFO ] Implicit Places using invariants and state equation in 9385 ms returned []
Implicit Place search using SMT with State Equation took 11586 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2026-05-22 21:22:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61846ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61860ms
Starting structural reductions in LTL mode, iteration 1 : 3201/3217 places, 3865/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75379 ms. Remains : 3201/3217 places, 3865/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0&&X(G(p1)))))))))'
Stuttering acceptance computed with spot in 475 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-03 finished in 75949 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(G(p0))))'
Support contains 1 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3210 transition count 3903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3210 transition count 3903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3210 transition count 3902
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 3207 transition count 3892
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 3207 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3883
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3875
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3866
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3866
Applied a total of 31 rules in 1863 ms. Remains 3202 /3217 variables (removed 15) and now considering 3866/3922 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9624496958563084277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6289763968708059685.kers'
[2026-05-22 21:23:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9624496958563084277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6289763968708059685.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3866 rows 3202 cols 11925 entries
Finished phase 1 with 2082 SingleSign rule and 776 generalized
[2026-05-22 21:23:57] [INFO ] Computed 344 invariants in 78 ms
Computed 344 P flows in 79 ms.
Exported basis to /tmp/petrispot-output-6289763968708059685.kers
Total runtime 88 ms.
[2026-05-22 21:23:59] [INFO ] Implicit Places using invariants in 2303 ms returned []
[2026-05-22 21:23:59] [INFO ] Invariant cache hit.
[2026-05-22 21:24:16] [INFO ] Implicit Places using invariants and state equation in 17153 ms returned []
Implicit Place search using SMT with State Equation took 19467 ms to find 0 implicit places.
Running 3865 sub problems to find dead transitions.
[2026-05-22 21:24:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 3865/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 0/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61803ms problems are : Problem set: 0 solved, 3865 unsolved
Search for dead transitions found 0 dead transitions in 61811ms
Starting structural reductions in LTL mode, iteration 1 : 3202/3217 places, 3866/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83162 ms. Remains : 3202/3217 places, 3866/3922 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(G(p0))))'
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-04 finished in 83424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U p2)))'
Support contains 3 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3209 transition count 3902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3209 transition count 3902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 3209 transition count 3901
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 3206 transition count 3891
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3882
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3873
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3201 transition count 3865
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3201 transition count 3865
Applied a total of 33 rules in 1832 ms. Remains 3201 /3217 variables (removed 16) and now considering 3865/3922 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13058910249690656360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9940413246945329274.kers'
[2026-05-22 21:25:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13058910249690656360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9940413246945329274.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3865 rows 3201 cols 11923 entries
Finished phase 1 with 2081 SingleSign rule and 776 generalized
[2026-05-22 21:25:20] [INFO ] Computed 344 invariants in 58 ms
Computed 344 P flows in 59 ms.
Exported basis to /tmp/petrispot-output-9940413246945329274.kers
Total runtime 67 ms.
[2026-05-22 21:25:23] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2026-05-22 21:25:23] [INFO ] Invariant cache hit.
[2026-05-22 21:25:32] [INFO ] Implicit Places using invariants and state equation in 9456 ms returned []
Implicit Place search using SMT with State Equation took 11869 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2026-05-22 21:25:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61732ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61743ms
Starting structural reductions in LTL mode, iteration 1 : 3201/3217 places, 3865/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75473 ms. Remains : 3201/3217 places, 3865/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U p2)))'
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-07
Stuttering criterion allowed to conclude after 963 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-07 finished in 75704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3210 transition count 3903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3210 transition count 3903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3210 transition count 3902
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 3207 transition count 3892
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 3207 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3883
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3875
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3866
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3866
Applied a total of 31 rules in 1744 ms. Remains 3202 /3217 variables (removed 15) and now considering 3866/3922 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11875181349133842331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18112648347392695962.kers'
[2026-05-22 21:26:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11875181349133842331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18112648347392695962.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3866 rows 3202 cols 11925 entries
Finished phase 1 with 2082 SingleSign rule and 776 generalized
[2026-05-22 21:26:36] [INFO ] Computed 344 invariants in 31 ms
Computed 344 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-18112648347392695962.kers
Total runtime 39 ms.
[2026-05-22 21:26:38] [INFO ] Implicit Places using invariants in 2086 ms returned []
[2026-05-22 21:26:38] [INFO ] Invariant cache hit.
[2026-05-22 21:26:49] [INFO ] Implicit Places using invariants and state equation in 11560 ms returned []
Implicit Place search using SMT with State Equation took 13663 ms to find 0 implicit places.
Running 3865 sub problems to find dead transitions.
[2026-05-22 21:26:49] [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/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 3865/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 0/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62070ms problems are : Problem set: 0 solved, 3865 unsolved
Search for dead transitions found 0 dead transitions in 62075ms
Starting structural reductions in LTL mode, iteration 1 : 3202/3217 places, 3866/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77501 ms. Remains : 3202/3217 places, 3866/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-08
Stuttering criterion allowed to conclude after 844 steps with 1 reset in 4 ms.
FORMULA ASLink-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-08 finished in 77674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 3217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 3216 transition count 3322
Reduce places removed 599 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 602 rules applied. Total rules applied 1201 place count 2617 transition count 3319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1203 place count 2615 transition count 3319
Performed 870 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 870 Pre rules applied. Total rules applied 1203 place count 2615 transition count 2449
Deduced a syphon composed of 870 places in 7 ms
Ensure Unique test removed 83 places
Reduce places removed 953 places and 0 transitions.
Iterating global reduction 3 with 1823 rules applied. Total rules applied 3026 place count 1662 transition count 2449
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 59 rules applied. Total rules applied 3085 place count 1654 transition count 2398
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 3136 place count 1603 transition count 2398
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3136 place count 1603 transition count 2365
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3235 place count 1537 transition count 2365
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3235 place count 1537 transition count 2333
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3299 place count 1505 transition count 2333
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 3304 place count 1500 transition count 2316
Iterating global reduction 5 with 5 rules applied. Total rules applied 3309 place count 1500 transition count 2316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3309 place count 1500 transition count 2315
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3311 place count 1499 transition count 2315
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3312 place count 1498 transition count 2307
Iterating global reduction 5 with 1 rules applied. Total rules applied 3313 place count 1498 transition count 2307
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3314 place count 1497 transition count 2299
Iterating global reduction 5 with 1 rules applied. Total rules applied 3315 place count 1497 transition count 2299
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3316 place count 1496 transition count 2291
Iterating global reduction 5 with 1 rules applied. Total rules applied 3317 place count 1496 transition count 2291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3318 place count 1495 transition count 2283
Iterating global reduction 5 with 1 rules applied. Total rules applied 3319 place count 1495 transition count 2283
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 5 with 506 rules applied. Total rules applied 3825 place count 1241 transition count 2031
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3829 place count 1237 transition count 2027
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3834 place count 1236 transition count 2027
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 3835 place count 1236 transition count 2026
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3836 place count 1235 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3836 place count 1235 transition count 2025
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 3838 place count 1234 transition count 2025
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3840 place count 1232 transition count 2023
Iterating global reduction 7 with 2 rules applied. Total rules applied 3842 place count 1232 transition count 2023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3844 place count 1232 transition count 2021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3845 place count 1231 transition count 2021
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3847 place count 1230 transition count 2026
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3848 place count 1230 transition count 2026
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3850 place count 1228 transition count 2024
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 20 rules applied. Total rules applied 3870 place count 1214 transition count 2018
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3876 place count 1208 transition count 2018
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 22 Pre rules applied. Total rules applied 3876 place count 1208 transition count 1996
Deduced a syphon composed of 22 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 11 with 45 rules applied. Total rules applied 3921 place count 1185 transition count 1996
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 11 with 15 rules applied. Total rules applied 3936 place count 1170 transition count 1996
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3936 place count 1170 transition count 1995
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3938 place count 1169 transition count 1995
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 12 with 46 rules applied. Total rules applied 3984 place count 1146 transition count 1972
Discarding 14 places :
Symmetric choice reduction at 12 with 14 rule applications. Total rules 3998 place count 1132 transition count 1958
Iterating global reduction 12 with 14 rules applied. Total rules applied 4012 place count 1132 transition count 1958
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4020 place count 1124 transition count 1950
Iterating global reduction 12 with 8 rules applied. Total rules applied 4028 place count 1124 transition count 1950
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4036 place count 1124 transition count 1942
Applied a total of 4036 rules in 1049 ms. Remains 1124 /3217 variables (removed 2093) and now considering 1942/3922 (removed 1980) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8177112708358380785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13346166394875086588.kers'
[2026-05-22 21:27:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8177112708358380785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13346166394875086588.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 1 ms.
// Phase 1: matrix 1942 rows 1098 cols 7555 entries
Finished phase 1 with 279 SingleSign rule and 658 generalized
[2026-05-22 21:27:53] [INFO ] Computed 187 invariants in 19 ms
Computed 187 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-13346166394875086588.kers
Total runtime 22 ms.
[2026-05-22 21:27:54] [INFO ] Implicit Places using invariants in 983 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 264, 265, 277, 278, 279, 280, 282, 299, 317, 337, 388, 389, 401, 402, 404, 421, 439, 459, 510, 511, 523, 524, 526, 543, 561, 581, 632, 633, 645, 646, 648, 665, 683, 703, 754, 755, 767, 768, 770, 787, 805, 825, 876, 877, 889, 890, 894, 911, 929, 950, 1006, 1009, 1020, 1021, 1022, 1023, 1041, 1062, 1063, 1064, 1065]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 997 ms to find 75 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/3217 places, 1942/3922 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1049 transition count 1806
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 272 place count 913 transition count 1806
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 272 place count 913 transition count 1765
Deduced a syphon composed of 41 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 83 rules applied. Total rules applied 355 place count 871 transition count 1765
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 368 place count 866 transition count 1757
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 376 place count 858 transition count 1757
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 379 place count 855 transition count 1754
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 855 transition count 1754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 385 place count 855 transition count 1751
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 509 place count 793 transition count 1689
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 513 place count 791 transition count 1690
Applied a total of 513 rules in 134 ms. Remains 791 /1049 variables (removed 258) and now considering 1690/1942 (removed 252) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16932573535133080541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8223257538958545347.kers'
[2026-05-22 21:27:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16932573535133080541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8223257538958545347.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1690 rows 791 cols 6791 entries
Finished phase 1 with 230 SingleSign rule and 455 generalized
[2026-05-22 21:27:54] [INFO ] Computed 106 invariants in 14 ms
Computed 106 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8223257538958545347.kers
Total runtime 17 ms.
[2026-05-22 21:27:54] [INFO ] Implicit Places using invariants in 589 ms returned [88, 94, 99, 174, 180, 185, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 711, 717, 722, 788]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 603 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 766/3217 places, 1690/3922 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 766 transition count 1689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 765 transition count 1689
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 749 transition count 1673
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 749 transition count 1673
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 733 transition count 1657
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 733 transition count 1657
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 725 transition count 1649
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 725 transition count 1649
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 717 transition count 1641
Applied a total of 98 rules in 109 ms. Remains 717 /766 variables (removed 49) and now considering 1641/1690 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1731073058459932391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9077830936722006447.kers'
[2026-05-22 21:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1731073058459932391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9077830936722006447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1641 rows 717 cols 6610 entries
Finished phase 1 with 219 SingleSign rule and 417 generalized
[2026-05-22 21:27:55] [INFO ] Computed 81 invariants in 13 ms
Computed 81 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-9077830936722006447.kers
Total runtime 29 ms.
[2026-05-22 21:27:55] [INFO ] Implicit Places using invariants in 582 ms returned []
[2026-05-22 21:27:55] [INFO ] Invariant cache hit.
[2026-05-22 21:27:57] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 717/3217 places, 1641/3922 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5312 ms. Remains : 717/3217 places, 1641/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-09
Product exploration explored 100000 steps with 2821 reset in 346 ms.
Product exploration explored 100000 steps with 2827 reset in 353 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/717 stabilizing places and 2/1641 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 2204 steps (23 resets) in 27 ms. (78 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 400 ms.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 717/717 places, 1641/1641 transitions.
Applied a total of 0 rules in 54 ms. Remains 717 /717 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2026-05-22 21:27:59] [INFO ] Invariant cache hit.
[2026-05-22 21:27:59] [INFO ] Implicit Places using invariants in 788 ms returned []
[2026-05-22 21:27:59] [INFO ] Invariant cache hit.
[2026-05-22 21:28:01] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 2976 ms to find 0 implicit places.
[2026-05-22 21:28:02] [INFO ] Redundant transitions in 32 ms returned []
Running 1588 sub problems to find dead transitions.
[2026-05-22 21:28:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/2358 variables, and 62 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 47/58 constraints, State Equation: 0/717 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 708/2358 variables, and 62 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 47/58 constraints, State Equation: 0/717 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63658 ms. Remains : 717/717 places, 1641/1641 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/717 stabilizing places and 2/1641 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 725 steps (8 resets) in 10 ms. (65 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 524 ms.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2813 reset in 355 ms.
Product exploration explored 100000 steps with 2749 reset in 334 ms.
Built C files in :
/tmp/ltsmin7893404560786663695
[2026-05-22 21:29:04] [INFO ] Too many transitions (1641) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:29:04] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7893404560786663695
Running compilation step : cd /tmp/ltsmin7893404560786663695;'/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/ltsmin7893404560786663695;'/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/ltsmin7893404560786663695;'/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 2 out of 717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 717/717 places, 1641/1641 transitions.
Applied a total of 0 rules in 45 ms. Remains 717 /717 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2026-05-22 21:29:07] [INFO ] Invariant cache hit.
[2026-05-22 21:29:07] [INFO ] Implicit Places using invariants in 535 ms returned []
[2026-05-22 21:29:07] [INFO ] Invariant cache hit.
[2026-05-22 21:29:09] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2026-05-22 21:29:09] [INFO ] Redundant transitions in 24 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2117 ms. Remains : 717/717 places, 1641/1641 transitions.
Built C files in :
/tmp/ltsmin9449040508423756337
[2026-05-22 21:29:09] [INFO ] Too many transitions (1641) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:29:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9449040508423756337
Running compilation step : cd /tmp/ltsmin9449040508423756337;'/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/ltsmin9449040508423756337;'/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/ltsmin9449040508423756337;'/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:29:12] [INFO ] Flatten gal took : 35 ms
[2026-05-22 21:29:12] [INFO ] Flatten gal took : 38 ms
[2026-05-22 21:29:12] [INFO ] Time to serialize gal into /tmp/LTL3647020520469701814.gal : 14 ms
[2026-05-22 21:29:12] [INFO ] Time to serialize properties into /tmp/LTL1336518745417996774.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/LTL3647020520469701814.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1362546281459588968.hoa' '-atoms' '/tmp/LTL1336518745417996774.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/LTL1336518745417996774.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1362546281459588968.hoa
Detected timeout of ITS tools.
[2026-05-22 21:29:27] [INFO ] Flatten gal took : 55 ms
[2026-05-22 21:29:27] [INFO ] Flatten gal took : 38 ms
[2026-05-22 21:29:27] [INFO ] Time to serialize gal into /tmp/LTL13301858697773529627.gal : 10 ms
[2026-05-22 21:29:27] [INFO ] Time to serialize properties into /tmp/LTL12846671958247912094.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/LTL13301858697773529627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12846671958247912094.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(p2852==0)"))&&(F(G("(p785==0)"))))))
Formula 0 simplified : F(G!"(p2852==0)" | GF!"(p785==0)")
Detected timeout of ITS tools.
[2026-05-22 21:29:42] [INFO ] Flatten gal took : 59 ms
[2026-05-22 21:29:42] [INFO ] Applying decomposition
[2026-05-22 21:29:42] [INFO ] Flatten gal took : 32 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/graph1336660349947959678.txt' '-o' '/tmp/graph1336660349947959678.bin' '-w' '/tmp/graph1336660349947959678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1336660349947959678.bin' '-l' '-1' '-v' '-w' '/tmp/graph1336660349947959678.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:29:43] [INFO ] Decomposing Gal with order
[2026-05-22 21:29:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:29:43] [INFO ] Removed a total of 3237 redundant transitions.
[2026-05-22 21:29:43] [INFO ] Flatten gal took : 93 ms
[2026-05-22 21:29:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 35 ms.
[2026-05-22 21:29:43] [INFO ] Time to serialize gal into /tmp/LTL1440153458649076798.gal : 19 ms
[2026-05-22 21:29:43] [INFO ] Time to serialize properties into /tmp/LTL1780129157781909730.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/LTL1440153458649076798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1780129157781909730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(i16.i0.u139.p2852==0)"))&&(F(G("(i3.u44.p785==0)"))))))
Formula 0 simplified : F(G!"(i16.i0.u139.p2852==0)" | GF!"(i3.u44.p785==0)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLFireability-09 finished in 126203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 3216 transition count 3321
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 605 rules applied. Total rules applied 1205 place count 2616 transition count 3316
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1208 place count 2613 transition count 3316
Performed 870 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 870 Pre rules applied. Total rules applied 1208 place count 2613 transition count 2446
Deduced a syphon composed of 870 places in 6 ms
Ensure Unique test removed 84 places
Reduce places removed 954 places and 0 transitions.
Iterating global reduction 3 with 1824 rules applied. Total rules applied 3032 place count 1659 transition count 2446
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3092 place count 1651 transition count 2394
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3144 place count 1599 transition count 2394
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3144 place count 1599 transition count 2361
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3243 place count 1533 transition count 2361
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3243 place count 1533 transition count 2329
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3307 place count 1501 transition count 2329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 3312 place count 1496 transition count 2312
Iterating global reduction 5 with 5 rules applied. Total rules applied 3317 place count 1496 transition count 2312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3317 place count 1496 transition count 2311
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3319 place count 1495 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3320 place count 1494 transition count 2303
Iterating global reduction 5 with 1 rules applied. Total rules applied 3321 place count 1494 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3322 place count 1493 transition count 2295
Iterating global reduction 5 with 1 rules applied. Total rules applied 3323 place count 1493 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3324 place count 1492 transition count 2287
Iterating global reduction 5 with 1 rules applied. Total rules applied 3325 place count 1492 transition count 2287
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3326 place count 1491 transition count 2279
Iterating global reduction 5 with 1 rules applied. Total rules applied 3327 place count 1491 transition count 2279
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 5 with 506 rules applied. Total rules applied 3833 place count 1237 transition count 2027
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3837 place count 1233 transition count 2023
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3842 place count 1232 transition count 2023
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 3843 place count 1232 transition count 2022
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3844 place count 1231 transition count 2022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3844 place count 1231 transition count 2021
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3846 place count 1230 transition count 2021
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3848 place count 1228 transition count 2019
Iterating global reduction 7 with 2 rules applied. Total rules applied 3850 place count 1228 transition count 2019
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 3852 place count 1228 transition count 2017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3853 place count 1227 transition count 2017
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3855 place count 1226 transition count 2022
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3857 place count 1224 transition count 2020
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3881 place count 1208 transition count 2012
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3889 place count 1200 transition count 2012
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3889 place count 1200 transition count 1988
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3938 place count 1175 transition count 1988
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3955 place count 1158 transition count 1988
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3955 place count 1158 transition count 1987
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3957 place count 1157 transition count 1987
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 4007 place count 1132 transition count 1962
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4023 place count 1116 transition count 1946
Iterating global reduction 12 with 16 rules applied. Total rules applied 4039 place count 1116 transition count 1946
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4047 place count 1108 transition count 1938
Iterating global reduction 12 with 8 rules applied. Total rules applied 4055 place count 1108 transition count 1938
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4063 place count 1108 transition count 1930
Applied a total of 4063 rules in 965 ms. Remains 1108 /3217 variables (removed 2109) and now considering 1930/3922 (removed 1992) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1685967270336597766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17486661003655511593.kers'
[2026-05-22 21:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1685967270336597766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17486661003655511593.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 1 ms.
// Phase 1: matrix 1930 rows 1084 cols 7520 entries
Finished phase 1 with 273 SingleSign rule and 653 generalized
[2026-05-22 21:29:59] [INFO ] Computed 182 invariants in 18 ms
Computed 182 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-17486661003655511593.kers
Total runtime 36 ms.
[2026-05-22 21:30:00] [INFO ] Implicit Places using invariants in 1011 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 204, 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, 639, 656, 674, 694, 746, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 994, 1005, 1006, 1007, 1025, 1046, 1047, 1048, 1049]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 72 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1036/3217 places, 1930/3922 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1036 transition count 1799
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 905 transition count 1798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 904 transition count 1798
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 264 place count 904 transition count 1759
Deduced a syphon composed of 39 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 343 place count 864 transition count 1759
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 355 place count 860 transition count 1751
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 363 place count 852 transition count 1751
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 366 place count 849 transition count 1748
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 849 transition count 1748
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 372 place count 849 transition count 1745
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 492 place count 789 transition count 1685
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 496 place count 787 transition count 1686
Applied a total of 496 rules in 189 ms. Remains 787 /1036 variables (removed 249) and now considering 1686/1930 (removed 244) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2400940283411716270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8486157094706330263.kers'
[2026-05-22 21:30:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2400940283411716270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8486157094706330263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1686 rows 787 cols 6780 entries
Finished phase 1 with 231 SingleSign rule and 451 generalized
[2026-05-22 21:30:00] [INFO ] Computed 105 invariants in 15 ms
Computed 105 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8486157094706330263.kers
Total runtime 16 ms.
[2026-05-22 21:30:01] [INFO ] Implicit Places using invariants in 570 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 530, 536, 541, 620, 626, 631, 708, 714, 719, 784]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 583 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/3217 places, 1686/3922 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 762 transition count 1685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 1685
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 745 transition count 1669
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 745 transition count 1669
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 729 transition count 1653
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 729 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 721 transition count 1645
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 721 transition count 1645
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 713 transition count 1637
Applied a total of 98 rules in 111 ms. Remains 713 /762 variables (removed 49) and now considering 1637/1686 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17465735244214073987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4452794449830713758.kers'
[2026-05-22 21:30:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17465735244214073987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4452794449830713758.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1637 rows 713 cols 6599 entries
Finished phase 1 with 217 SingleSign rule and 416 generalized
[2026-05-22 21:30:01] [INFO ] Computed 80 invariants in 14 ms
Computed 80 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4452794449830713758.kers
Total runtime 19 ms.
[2026-05-22 21:30:01] [INFO ] Implicit Places using invariants in 525 ms returned []
[2026-05-22 21:30:01] [INFO ] Invariant cache hit.
[2026-05-22 21:30:03] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 713/3217 places, 1637/3922 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4936 ms. Remains : 713/3217 places, 1637/3922 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-10
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-10 finished in 5008 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 p1))'
Support contains 3 out of 3217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3217/3217 places, 3922/3922 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3210 transition count 3903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3210 transition count 3903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3210 transition count 3902
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 3207 transition count 3892
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 3207 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3205 transition count 3883
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3205 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3204 transition count 3875
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3204 transition count 3875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3202 transition count 3866
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3202 transition count 3866
Applied a total of 31 rules in 1754 ms. Remains 3202 /3217 variables (removed 15) and now considering 3866/3922 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14975139263332887313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14271909753553521764.kers'
[2026-05-22 21:30:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14975139263332887313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14271909753553521764.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3866 rows 3202 cols 11925 entries
Finished phase 1 with 2082 SingleSign rule and 776 generalized
[2026-05-22 21:30:05] [INFO ] Computed 344 invariants in 31 ms
Computed 344 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-14271909753553521764.kers
Total runtime 53 ms.
[2026-05-22 21:30:07] [INFO ] Implicit Places using invariants in 2240 ms returned []
[2026-05-22 21:30:07] [INFO ] Invariant cache hit.
[2026-05-22 21:30:24] [INFO ] Implicit Places using invariants and state equation in 17635 ms returned []
Implicit Place search using SMT with State Equation took 19905 ms to find 0 implicit places.
Running 3865 sub problems to find dead transitions.
[2026-05-22 21:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 3865/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3201 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3865 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3201/7068 variables, and 207 constraints, problems are : Problem set: 0 solved, 3865 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3202 constraints, PredecessorRefiner: 0/3865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61711ms problems are : Problem set: 0 solved, 3865 unsolved
Search for dead transitions found 0 dead transitions in 61717ms
Starting structural reductions in LTL mode, iteration 1 : 3202/3217 places, 3866/3922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83396 ms. Remains : 3202/3217 places, 3866/3922 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 p1))'
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLFireability-14 finished in 83519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((p1&&F(G(p2)))))))'
Spot run failed in 96 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 21:31:27] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8927049403218629819
[2026-05-22 21:31:27] [INFO ] Too many transitions (3922) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:31:27] [INFO ] Applying decomposition
[2026-05-22 21:31:27] [INFO ] Flatten gal took : 60 ms
[2026-05-22 21:31:27] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8927049403218629819
Running compilation step : cd /tmp/ltsmin8927049403218629819;'/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'
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/graph1752653017367962531.txt' '-o' '/tmp/graph1752653017367962531.bin' '-w' '/tmp/graph1752653017367962531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1752653017367962531.bin' '-l' '-1' '-v' '-w' '/tmp/graph1752653017367962531.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:31:27] [INFO ] Decomposing Gal with order
[2026-05-22 21:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:31:28] [INFO ] Removed a total of 2925 redundant transitions.
[2026-05-22 21:31:28] [INFO ] Flatten gal took : 178 ms
[2026-05-22 21:31:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 32 ms.
[2026-05-22 21:31:28] [INFO ] Time to serialize gal into /tmp/LTLFireability7321250559089340597.gal : 30 ms
[2026-05-22 21:31:28] [INFO ] Time to serialize properties into /tmp/LTLFireability10246604376001061384.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/LTLFireability7321250559089340597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10246604376001061384.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 : !((G((X(F("((i13.u313.p887==0)||(i13.u360.p1039==0))")))||(F(("(i28.u796.p2282==0)")&&(F(G("(i2.u66.p218==1)"))))))))
Formula 0 simplified : F(XG!"((i13.u313.p887==0)||(i13.u360.p1039==0))" & (GF!"(i2.u66.p218==1)" | G!"(i28.u796.p2282==0)"))
Compilation finished in 11898 ms.
Running link step : cd /tmp/ltsmin8927049403218629819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin8927049403218629819;'/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(<>((LTLAPp0==true)))||<>(((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8927049403218629819;'/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(<>((LTLAPp0==true)))||<>(((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8927049403218629819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 21:58:14] [INFO ] Applying decomposition
[2026-05-22 21:58:14] [INFO ] Flatten gal took : 81 ms
[2026-05-22 21:58:14] [INFO ] Decomposing Gal with order
[2026-05-22 21:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:58:15] [INFO ] Removed a total of 2687 redundant transitions.
[2026-05-22 21:58:15] [INFO ] Flatten gal took : 152 ms
[2026-05-22 21:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4462 labels/synchronizations in 112 ms.
[2026-05-22 21:58:15] [INFO ] Time to serialize gal into /tmp/LTLFireability12057629786452551349.gal : 25 ms
[2026-05-22 21:58:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14188271050818989651.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/LTLFireability12057629786452551349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14188271050818989651.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((X(F("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u116.p887==0)||(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u525.p1039==0))")))||...289
Formula 0 simplified : F(XG!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u116.p887==0)||(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u525.p1039==0))" & (GF!"...275
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8927049403218629819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8927049403218629819;'/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(<>((LTLAPp0==true)))||<>(((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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