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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 357K 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-03a-LTLCardinality-00
FORMULA_NAME ASLink-PT-03a-LTLCardinality-01
FORMULA_NAME ASLink-PT-03a-LTLCardinality-02
FORMULA_NAME ASLink-PT-03a-LTLCardinality-03
FORMULA_NAME ASLink-PT-03a-LTLCardinality-04
FORMULA_NAME ASLink-PT-03a-LTLCardinality-05
FORMULA_NAME ASLink-PT-03a-LTLCardinality-06
FORMULA_NAME ASLink-PT-03a-LTLCardinality-07
FORMULA_NAME ASLink-PT-03a-LTLCardinality-08
FORMULA_NAME ASLink-PT-03a-LTLCardinality-09
FORMULA_NAME ASLink-PT-03a-LTLCardinality-10
FORMULA_NAME ASLink-PT-03a-LTLCardinality-11
FORMULA_NAME ASLink-PT-03a-LTLCardinality-12
FORMULA_NAME ASLink-PT-03a-LTLCardinality-13
FORMULA_NAME ASLink-PT-03a-LTLCardinality-14
FORMULA_NAME ASLink-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779471596430

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 17:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:39:58] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2026-05-22 17:39:58] [INFO ] Transformed 821 places.
[2026-05-22 17:39:58] [INFO ] Transformed 1281 transitions.
[2026-05-22 17:39:58] [INFO ] Found NUPN structural information;
[2026-05-22 17:39:58] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 821 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 803 transition count 1268
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 795 transition count 1237
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 794 transition count 1237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 794 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 793 transition count 1227
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 793 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 792 transition count 1219
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 792 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 791 transition count 1211
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 791 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 790 transition count 1203
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 790 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 789 transition count 1195
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 789 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 788 transition count 1187
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 788 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 787 transition count 1179
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 787 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 786 transition count 1171
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 786 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 785 transition count 1163
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 785 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 784 transition count 1155
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 784 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 783 transition count 1147
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 783 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 782 transition count 1139
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 782 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 781 transition count 1131
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 781 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 780 transition count 1123
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 780 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 779 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 779 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 778 transition count 1107
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 778 transition count 1107
Applied a total of 69 rules in 701 ms. Remains 778 /821 variables (removed 43) and now considering 1107/1268 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8745494434620698738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16892635887179218761.kers'
[2026-05-22 17:39:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8745494434620698738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16892635887179218761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1107 rows 778 cols 4137 entries
Finished phase 1 with 296 SingleSign rule and 345 generalized
[2026-05-22 17:39:59] [INFO ] Computed 137 invariants in 8 ms
Computed 137 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16892635887179218761.kers
Total runtime 10 ms.
[2026-05-22 17:40:00] [INFO ] Implicit Places using invariants in 1016 ms returned [1, 19, 20, 23, 33, 51, 69, 200, 216, 219, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 579, 591, 596, 598, 616, 618, 621, 639, 640, 641, 642, 659, 667, 675, 681, 687, 693, 699, 707, 713, 719, 727]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 735/821 places, 1107/1268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 722 transition count 1094
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 722 transition count 1094
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 713 transition count 1085
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 713 transition count 1085
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 709 transition count 1081
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 709 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 708 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 708 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 707 transition count 1079
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 707 transition count 1079
Applied a total of 56 rules in 85 ms. Remains 707 /735 variables (removed 28) and now considering 1079/1107 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4776556975405730389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8131258428086382066.kers'
[2026-05-22 17:40:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4776556975405730389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8131258428086382066.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1079 rows 707 cols 3773 entries
Finished phase 1 with 448 SingleSign rule and 165 generalized
[2026-05-22 17:40:00] [INFO ] Computed 94 invariants in 9 ms
Computed 94 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8131258428086382066.kers
Total runtime 11 ms.
[2026-05-22 17:40:00] [INFO ] Implicit Places using invariants in 719 ms returned []
[2026-05-22 17:40:00] [INFO ] Invariant cache hit.
[2026-05-22 17:40:02] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 707/821 places, 1079/1268 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4492 ms. Remains : 707/821 places, 1079/1268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Applied a total of 0 rules in 22 ms. Remains 707 /707 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
[2026-05-22 17:40:02] [INFO ] Invariant cache hit.
[2026-05-22 17:40:03] [INFO ] Implicit Places using invariants in 824 ms returned []
[2026-05-22 17:40:03] [INFO ] Invariant cache hit.
[2026-05-22 17:40:05] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
Running 1078 sub problems to find dead transitions.
[2026-05-22 17:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/1786 variables, and 70 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 70/76 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 1078/1078 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1078 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/1786 variables, and 70 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 70/76 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 0/1078 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60595ms problems are : Problem set: 0 solved, 1078 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Finished structural reductions in LTL mode , in 1 iterations and 63272 ms. Remains : 707/707 places, 1079/1079 transitions.
Support contains 32 out of 707 places after structural reductions.
[2026-05-22 17:41:06] [INFO ] Flatten gal took : 105 ms
[2026-05-22 17:41:06] [INFO ] Flatten gal took : 54 ms
[2026-05-22 17:41:06] [INFO ] Input system was already deterministic with 1079 transitions.
RANDOM walk for 40000 steps (355 resets) in 2551 ms. (15 steps per ms) remains 8/17 properties
BEST_FIRST walk for 40003 steps (80 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (74 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 308 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (71 resets) in 154 ms. (258 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (79 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
[2026-05-22 17:41:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 233/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 88/335 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 363/698 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 9/707 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1079/1786 variables, 707/801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1786 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1786 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1786/1786 variables, and 801 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 233/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 88/335 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 363/698 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 9/707 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1079/1786 variables, 707/801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1786 variables, 7/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1786 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1786 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1786/1786 variables, and 808 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6256ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4650 ms.
Support contains 14 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 707 transition count 959
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 242 place count 587 transition count 957
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 585 transition count 957
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 244 place count 585 transition count 877
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 27 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 431 place count 478 transition count 877
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 23 rules applied. Total rules applied 454 place count 470 transition count 862
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 471 place count 455 transition count 860
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 473 place count 453 transition count 860
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 473 place count 453 transition count 857
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 479 place count 450 transition count 857
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 484 place count 445 transition count 852
Iterating global reduction 6 with 5 rules applied. Total rules applied 489 place count 445 transition count 852
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 492 place count 445 transition count 849
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 492 place count 445 transition count 848
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 494 place count 444 transition count 848
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 586 place count 398 transition count 802
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 589 place count 398 transition count 799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 592 place count 395 transition count 799
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 611 place count 395 transition count 780
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 630 place count 376 transition count 780
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 631 place count 376 transition count 779
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 639 place count 376 transition count 779
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 640 place count 375 transition count 778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 642 place count 373 transition count 778
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 642 place count 373 transition count 772
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 13 rules applied. Total rules applied 655 place count 366 transition count 772
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 656 place count 365 transition count 771
Iterating global reduction 10 with 1 rules applied. Total rules applied 657 place count 365 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 658 place count 365 transition count 770
Applied a total of 658 rules in 238 ms. Remains 365 /707 variables (removed 342) and now considering 770/1079 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 365/707 places, 770/1079 transitions.
RANDOM walk for 40000 steps (724 resets) in 423 ms. (94 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (206 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (192 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (177 resets) in 108 ms. (367 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (195 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (226 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (206 resets) in 102 ms. (388 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-4852674691140385358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4165789738164687276.kers'
[2026-05-22 17:41:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4852674691140385358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4165789738164687276.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 770 rows 362 cols 3137 entries
Finished phase 1 with 146 SingleSign rule and 163 generalized
[2026-05-22 17:41:19] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4165789738164687276.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/158 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/298 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 32/330 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 35/365 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 770/1135 variables, 365/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1135 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1135 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 421 constraints, problems are : Problem set: 0 solved, 5 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/158 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/298 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 32/330 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 35/365 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 770/1135 variables, 365/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1135 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1135 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1135 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 426 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8120 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8906ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 10506 ms.
Support contains 7 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 770/770 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 365 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 362 transition count 767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 362 transition count 765
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 358 transition count 765
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 13 place count 358 transition count 765
Applied a total of 13 rules in 36 ms. Remains 358 /365 variables (removed 7) and now considering 765/770 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 358/365 places, 765/770 transitions.
RANDOM walk for 40000 steps (735 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (228 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (219 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (211 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (211 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 298187 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 4
Probabilistic random walk after 298187 steps, saw 145078 distinct states, run finished after 3009 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-22 17:41:41] [INFO ] Flow matrix only has 764 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3542362188401402937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4966682653556818119.kers'
[2026-05-22 17:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3542362188401402937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4966682653556818119.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 764 rows 354 cols 3114 entries
Finished phase 1 with 139 SingleSign rule and 165 generalized
[2026-05-22 17:41:41] [INFO ] Computed 54 invariants in 4 ms
Computed 54 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4966682653556818119.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/157 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 136/294 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 32/326 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/358 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 764/1122 variables, 358/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1122 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1122 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1122/1122 variables, and 412 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/157 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 136/294 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 32/326 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/358 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 764/1122 variables, 358/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1122 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1122 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1122/1122 variables, and 416 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3717 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4793ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1402 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 765/765 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 358 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 356 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 356 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 354 transition count 763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 353 transition count 762
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 353 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 353 transition count 761
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 353 transition count 760
Applied a total of 10 rules in 39 ms. Remains 353 /358 variables (removed 5) and now considering 760/765 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 353/358 places, 760/765 transitions.
RANDOM walk for 40000 steps (722 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (219 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (226 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 507533 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :1 out of 2
Probabilistic random walk after 507533 steps, saw 266518 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9017802378837419119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17586485240800340799.kers'
[2026-05-22 17:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9017802378837419119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17586485240800340799.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 760 rows 350 cols 3100 entries
Finished phase 1 with 137 SingleSign rule and 164 generalized
[2026-05-22 17:41:51] [INFO ] Computed 52 invariants in 12 ms
Computed 52 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-17586485240800340799.kers
Total runtime 14 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/115 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/151 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/288 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/321 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/353 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 760/1113 variables, 353/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1113 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1113 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/115 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/151 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/288 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/321 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/353 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 760/1113 variables, 353/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1113 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1113 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1113 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 406 constraints, problems are : Problem set: 0 solved, 1 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1193ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 760/760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 350 transition count 758
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 350 transition count 754
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 346 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 345 transition count 753
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 345 transition count 753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 344 transition count 752
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 344 transition count 752
Applied a total of 17 rules in 46 ms. Remains 344 /353 variables (removed 9) and now considering 752/760 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 344/353 places, 752/760 transitions.
RANDOM walk for 40000 steps (746 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (222 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 625718 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 625718 steps, saw 311472 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) 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-13065646205129165052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8919090325540706422.kers'
[2026-05-22 17:41:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13065646205129165052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8919090325540706422.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 752 rows 342 cols 3080 entries
Finished phase 1 with 130 SingleSign rule and 163 generalized
[2026-05-22 17:41:55] [INFO ] Computed 51 invariants in 12 ms
Computed 51 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8919090325540706422.kers
Total runtime 13 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/114 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/150 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/280 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/312 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/344 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 752/1096 variables, 344/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1096 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1096 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/114 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/150 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/280 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/312 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/344 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 752/1096 variables, 344/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1096 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1096 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1096 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 752/752 transitions.
Applied a total of 0 rules in 23 ms. Remains 344 /344 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 344/344 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 752/752 transitions.
Applied a total of 0 rules in 9 ms. Remains 344 /344 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2026-05-22 17:41:56] [INFO ] Invariant cache hit.
[2026-05-22 17:41:57] [INFO ] Implicit Places using invariants in 600 ms returned [71, 88, 94, 97, 99, 106, 107, 159, 176, 182, 185, 187, 188, 193, 194, 263, 269, 272, 274, 277]
[2026-05-22 17:41:57] [INFO ] Actually due to overlaps returned [188, 193, 194, 88, 94, 99, 176, 182, 187, 263, 269, 274, 71, 159, 277]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 604 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 329/344 places, 752/752 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 316 transition count 739
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 316 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 313 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 313 transition count 736
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 308 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 308 transition count 730
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 308 transition count 721
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 299 transition count 721
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 299 transition count 719
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 297 transition count 719
Applied a total of 65 rules in 82 ms. Remains 297 /329 variables (removed 32) and now considering 719/752 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4392249501580478789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4987905045924248523.kers'
[2026-05-22 17:41:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4392249501580478789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4987905045924248523.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 719 rows 296 cols 2967 entries
Finished phase 1 with 117 SingleSign rule and 144 generalized
[2026-05-22 17:41:57] [INFO ] Computed 36 invariants in 4 ms
Computed 36 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4987905045924248523.kers
Total runtime 6 ms.
[2026-05-22 17:41:57] [INFO ] Implicit Places using invariants in 414 ms returned [91, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 295/344 places, 719/752 transitions.
Applied a total of 0 rules in 15 ms. Remains 295 /295 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1126 ms. Remains : 295/344 places, 719/752 transitions.
RANDOM walk for 40000 steps (814 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (255 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739661 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739661 steps, saw 228096 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) 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-1615923802581457134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18201565029805338872.kers'
[2026-05-22 17:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1615923802581457134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18201565029805338872.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 719 rows 294 cols 2940 entries
Finished phase 1 with 110 SingleSign rule and 151 generalized
[2026-05-22 17:42:00] [INFO ] Computed 34 invariants in 7 ms
Computed 34 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18201565029805338872.kers
Total runtime 9 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/91 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/168 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 72/240 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/258 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/295 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 719/1014 variables, 295/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1014 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/91 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/168 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 72/240 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/258 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/295 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 719/1014 variables, 295/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1014 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 719/719 transitions.
Applied a total of 0 rules in 9 ms. Remains 295 /295 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 295/295 places, 719/719 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 719/719 transitions.
Applied a total of 0 rules in 9 ms. Remains 295 /295 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2026-05-22 17:42:01] [INFO ] Invariant cache hit.
[2026-05-22 17:42:02] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-22 17:42:02] [INFO ] Invariant cache hit.
[2026-05-22 17:42:03] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2026-05-22 17:42:03] [INFO ] Redundant transitions in 45 ms returned []
Running 701 sub problems to find dead transitions.
[2026-05-22 17:42:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 1/295 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1014 variables, and 35 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 1/295 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1014 variables, and 38 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 0/701 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61424 ms. Remains : 295/295 places, 719/719 transitions.
Computed a total of 1 stabilizing places and 1 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((X((X(X(p1))||G(p2)))||p0)))'
Support contains 5 out of 707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Applied a total of 0 rules in 13 ms. Remains 707 /707 variables (removed 0) and now considering 1079/1079 (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-10113807259978889240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14170767168878045455.kers'
[2026-05-22 17:43:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10113807259978889240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14170767168878045455.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1079 rows 707 cols 3773 entries
Finished phase 1 with 448 SingleSign rule and 165 generalized
[2026-05-22 17:43:03] [INFO ] Computed 94 invariants in 15 ms
Computed 94 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14170767168878045455.kers
Total runtime 17 ms.
[2026-05-22 17:43:04] [INFO ] Implicit Places using invariants in 720 ms returned [210, 573]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 723 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 705/707 places, 1079/1079 transitions.
Applied a total of 0 rules in 12 ms. Remains 705 /705 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 748 ms. Remains : 705/707 places, 1079/1079 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((X((X(X(p1))||G(p2)))||p0)))'
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-00
Product exploration explored 100000 steps with 25000 reset in 414 ms.
Product exploration explored 100000 steps with 25000 reset in 431 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (349 resets) in 331 ms. (120 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1514688308163854319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1984831782110687393.kers'
[2026-05-22 17:43:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1514688308163854319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1984831782110687393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1079 rows 705 cols 3751 entries
Finished phase 1 with 463 SingleSign rule and 150 generalized
[2026-05-22 17:43:06] [INFO ] Computed 92 invariants in 5 ms
Computed 92 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1984831782110687393.kers
Total runtime 6 ms.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/148 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 171/319 variables, 11/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/705 variables, 75/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1079/1784 variables, 705/797 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1784 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1784 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1784/1784 variables, and 797 constraints, problems are : Problem set: 1 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/192 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/363 variables, 11/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 342/705 variables, 72/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1079/1784 variables, 705/797 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1784 variables, 1/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1784 variables, 0/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1784 variables, 0/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1784/1784 variables, and 798 constraints, problems are : Problem set: 1 solved, 1 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1630ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1079/1079 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 705 transition count 944
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 270 place count 570 transition count 944
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 270 place count 570 transition count 855
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 476 place count 453 transition count 855
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 492 place count 446 transition count 846
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 501 place count 437 transition count 846
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 501 place count 437 transition count 835
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 523 place count 426 transition count 835
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 421 transition count 830
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 421 transition count 830
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 536 place count 421 transition count 827
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 536 place count 421 transition count 826
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 420 transition count 826
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 626 place count 376 transition count 782
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 629 place count 376 transition count 779
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 632 place count 373 transition count 779
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 645 place count 373 transition count 766
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 659 place count 359 transition count 766
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 662 place count 359 transition count 763
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 672 place count 359 transition count 763
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 673 place count 358 transition count 762
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 676 place count 355 transition count 762
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 676 place count 355 transition count 756
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 15 rules applied. Total rules applied 691 place count 346 transition count 756
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 694 place count 343 transition count 753
Iterating global reduction 8 with 3 rules applied. Total rules applied 697 place count 343 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 700 place count 343 transition count 750
Applied a total of 700 rules in 158 ms. Remains 343 /705 variables (removed 362) and now considering 750/1079 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 343/705 places, 750/1079 transitions.
RANDOM walk for 40000 steps (774 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (246 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27504 steps, run visited all 1 properties in 125 ms. (steps per millisecond=220 )
Probabilistic random walk after 27504 steps, saw 10054 distinct states, run finished after 129 ms. (steps per millisecond=213 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 2774 ms.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 705/705 places, 1079/1079 transitions.
Applied a total of 0 rules in 31 ms. Remains 705 /705 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
[2026-05-22 17:43:08] [INFO ] Invariant cache hit.
[2026-05-22 17:43:09] [INFO ] Implicit Places using invariants in 656 ms returned []
[2026-05-22 17:43:09] [INFO ] Invariant cache hit.
[2026-05-22 17:43:11] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
Running 1078 sub problems to find dead transitions.
[2026-05-22 17:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/1784 variables, and 70 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 70/75 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 1078/1078 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1078 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 2 (OVERLAPS) 1/705 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/1784 variables, and 92 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 0/1078 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 1078 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Finished structural reductions in LTL mode , in 1 iterations and 63033 ms. Remains : 705/705 places, 1079/1079 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 6894 steps (69 resets) in 34 ms. (196 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 262 ms.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 277 ms.
Product exploration explored 100000 steps with 25000 reset in 287 ms.
Spot run failed in 113 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14680835803292191822
[2026-05-22 17:44:13] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14680835803292191822
Running compilation step : cd /tmp/ltsmin14680835803292191822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1894 ms.
Running link step : cd /tmp/ltsmin14680835803292191822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin14680835803292191822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11290257820364116347.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA ASLink-PT-03a-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03a-LTLCardinality-00 finished in 71639 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(((X(X(p1)) U G(p2))||p0))))'
Support contains 6 out of 707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 707 transition count 951
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 579 transition count 951
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 256 place count 579 transition count 870
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 446 place count 470 transition count 870
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 17 rules applied. Total rules applied 463 place count 462 transition count 861
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 472 place count 453 transition count 861
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 472 place count 453 transition count 857
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 480 place count 449 transition count 857
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 486 place count 443 transition count 851
Iterating global reduction 4 with 6 rules applied. Total rules applied 492 place count 443 transition count 851
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 496 place count 443 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 497 place count 442 transition count 847
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 497 place count 442 transition count 846
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 499 place count 441 transition count 846
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 587 place count 397 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 588 place count 396 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 589 place count 396 transition count 801
Applied a total of 589 rules in 64 ms. Remains 396 /707 variables (removed 311) and now considering 801/1079 (removed 278) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12608671715931149029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17464759953595090708.kers'
[2026-05-22 17:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12608671715931149029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17464759953595090708.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 801 rows 395 cols 3200 entries
Finished phase 1 with 186 SingleSign rule and 152 generalized
[2026-05-22 17:44:15] [INFO ] Computed 58 invariants in 4 ms
Computed 58 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17464759953595090708.kers
Total runtime 5 ms.
[2026-05-22 17:44:15] [INFO ] Implicit Places using invariants in 459 ms returned [200, 213, 229, 393]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 463 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/707 places, 801/1079 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 392 transition count 800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 391 transition count 800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 391 transition count 798
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 389 transition count 798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 388 transition count 797
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 388 transition count 797
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 387 transition count 796
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 387 transition count 796
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 385 transition count 794
Applied a total of 14 rules in 34 ms. Remains 385 /392 variables (removed 7) and now considering 794/801 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16708732759921822732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10787009259275056879.kers'
[2026-05-22 17:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16708732759921822732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10787009259275056879.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 794 rows 385 cols 3178 entries
Finished phase 1 with 180 SingleSign rule and 151 generalized
[2026-05-22 17:44:15] [INFO ] Computed 54 invariants in 4 ms
Computed 54 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10787009259275056879.kers
Total runtime 5 ms.
[2026-05-22 17:44:16] [INFO ] Implicit Places using invariants in 1118 ms returned [209, 212]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 383/707 places, 794/1079 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 383 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 382 transition count 793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 381 transition count 792
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 381 transition count 792
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 381 transition count 791
Applied a total of 5 rules in 110 ms. Remains 381 /383 variables (removed 2) and now considering 791/794 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5453403098018761105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15214612866489884584.kers'
[2026-05-22 17:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5453403098018761105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15214612866489884584.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 791 rows 381 cols 3150 entries
Finished phase 1 with 179 SingleSign rule and 150 generalized
[2026-05-22 17:44:17] [INFO ] Computed 52 invariants in 4 ms
Computed 52 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15214612866489884584.kers
Total runtime 5 ms.
[2026-05-22 17:44:17] [INFO ] Implicit Places using invariants in 775 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 777 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 380/707 places, 791/1079 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 790
Applied a total of 2 rules in 30 ms. Remains 379 /380 variables (removed 1) and now considering 790/791 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1102428784626179919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14326202479375904508.kers'
[2026-05-22 17:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1102428784626179919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14326202479375904508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 790 rows 379 cols 3153 entries
Finished phase 1 with 179 SingleSign rule and 149 generalized
[2026-05-22 17:44:17] [INFO ] Computed 51 invariants in 4 ms
Computed 51 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14326202479375904508.kers
Total runtime 5 ms.
[2026-05-22 17:44:18] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-22 17:44:18] [INFO ] Invariant cache hit.
[2026-05-22 17:44:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 17:44:18] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 379/707 places, 790/1079 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3574 ms. Remains : 379/707 places, 790/1079 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(((X(X(p1)) U G(p2))||p0))))'
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-06
Product exploration explored 100000 steps with 18162 reset in 306 ms.
Product exploration explored 100000 steps with 18083 reset in 349 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 18 factoid took 93 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (616 resets) in 253 ms. (157 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40004 steps (183 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (129 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (133 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (168 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (185 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (155 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (191 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
[2026-05-22 17:44:20] [INFO ] Invariant cache hit.
[2026-05-22 17:44:20] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 105/159 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 217/376 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/379 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 790/1169 variables, 379/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1169 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1169 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 437 constraints, problems are : Problem set: 0 solved, 7 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 105/159 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 217/376 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/379 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 790/1169 variables, 379/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1169 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1169 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1169 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 444 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2755ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6796 ms.
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 790/790 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 379 transition count 785
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 11 place count 374 transition count 784
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 24 place count 374 transition count 771
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 37 place count 361 transition count 771
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 361 transition count 771
Applied a total of 44 rules in 48 ms. Remains 361 /379 variables (removed 18) and now considering 771/790 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 361/379 places, 771/790 transitions.
RANDOM walk for 40000 steps (680 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (185 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (126 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (145 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (188 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (158 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (192 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 207210 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 7
Probabilistic random walk after 207210 steps, saw 128886 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) 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-5193411765764499985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2004367531926441210.kers'
[2026-05-22 17:44:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5193411765764499985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2004367531926441210.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 771 rows 360 cols 3171 entries
Finished phase 1 with 153 SingleSign rule and 157 generalized
[2026-05-22 17:44:33] [INFO ] Computed 51 invariants in 4 ms
Computed 51 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2004367531926441210.kers
Total runtime 5 ms.
[2026-05-22 17:44:33] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 108/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 130/244 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/361 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 771/1132 variables, 361/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1132 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1132 variables, and 420 constraints, problems are : Problem set: 0 solved, 7 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 108/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 130/244 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/361 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 771/1132 variables, 361/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1132 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1132 variables, and 427 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2986 ms.
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 771/771 transitions.
Applied a total of 0 rules in 10 ms. Remains 361 /361 variables (removed 0) and now considering 771/771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 361/361 places, 771/771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 771/771 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 771/771 (removed 0) transitions.
[2026-05-22 17:44:38] [INFO ] Invariant cache hit.
[2026-05-22 17:44:39] [INFO ] Implicit Places using invariants in 331 ms returned [105, 113, 120, 121, 122, 200, 201, 285, 293]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 333 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/361 places, 771/771 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 352 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 770
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 349 transition count 768
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 349 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 349 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 349 transition count 766
Applied a total of 8 rules in 40 ms. Remains 349 /352 variables (removed 3) and now considering 766/771 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14431699267506767737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1396311002356578206.kers'
[2026-05-22 17:44:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14431699267506767737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1396311002356578206.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 766 rows 349 cols 3091 entries
Finished phase 1 with 144 SingleSign rule and 163 generalized
[2026-05-22 17:44:39] [INFO ] Computed 42 invariants in 4 ms
Computed 42 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1396311002356578206.kers
Total runtime 8 ms.
[2026-05-22 17:44:39] [INFO ] Implicit Places using invariants in 234 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/361 places, 766/771 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 347 transition count 765
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 347 transition count 764
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 346 transition count 764
Applied a total of 4 rules in 29 ms. Remains 346 /348 variables (removed 2) and now considering 764/766 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7406862558964422011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15237706584231601071.kers'
[2026-05-22 17:44:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7406862558964422011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15237706584231601071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 764 rows 346 cols 3099 entries
Finished phase 1 with 143 SingleSign rule and 162 generalized
[2026-05-22 17:44:39] [INFO ] Computed 41 invariants in 8 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15237706584231601071.kers
Total runtime 9 ms.
[2026-05-22 17:44:39] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-22 17:44:39] [INFO ] Invariant cache hit.
[2026-05-22 17:44:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:44:40] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 346/361 places, 764/771 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1759 ms. Remains : 346/361 places, 764/771 transitions.
RANDOM walk for 40000 steps (671 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (183 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (135 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (133 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (180 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (153 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (186 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 161948 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 7
Probabilistic random walk after 161948 steps, saw 102255 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2026-05-22 17:44:43] [INFO ] Invariant cache hit.
[2026-05-22 17:44:43] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 128/253 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 93/346 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 764/1110 variables, 346/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1110 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 391 constraints, problems are : Problem set: 0 solved, 7 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 128/253 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 93/346 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 764/1110 variables, 346/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 7/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1110 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 398 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4753 ms.
Support contains 6 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 764/764 transitions.
Applied a total of 0 rules in 9 ms. Remains 346 /346 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 346/346 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 764/764 transitions.
Applied a total of 0 rules in 8 ms. Remains 346 /346 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2026-05-22 17:44:51] [INFO ] Invariant cache hit.
[2026-05-22 17:44:51] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-22 17:44:51] [INFO ] Invariant cache hit.
[2026-05-22 17:44:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:44:52] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2026-05-22 17:44:52] [INFO ] Redundant transitions in 8 ms returned []
Running 763 sub problems to find dead transitions.
[2026-05-22 17:44:52] [INFO ] Invariant cache hit.
[2026-05-22 17:44:52] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1110 variables, and 43 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/346 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 763 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 6 (OVERLAPS) 764/1110 variables, 346/389 constraints. Problems are: Problem set: 129 solved, 634 unsolved
SMT process timed out in 60240ms, After SMT, problems are : Problem set: 129 solved, 634 unsolved
Search for dead transitions found 129 dead transitions in 60243ms
Found 129 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 129 transitions
Dead transitions reduction (with SMT) removed 129 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 346/346 places, 635/764 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 331 transition count 620
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 45 place count 316 transition count 620
Applied a total of 45 rules in 8 ms. Remains 316 /346 variables (removed 30) and now considering 620/635 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3728349186432200156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1729341552310066829.kers'
[2026-05-22 17:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3728349186432200156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1729341552310066829.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 620 rows 316 cols 2523 entries
Finished phase 1 with 117 SingleSign rule and 159 generalized
[2026-05-22 17:45:52] [INFO ] Computed 40 invariants in 3 ms
Computed 40 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1729341552310066829.kers
Total runtime 4 ms.
[2026-05-22 17:45:53] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-22 17:45:53] [INFO ] Invariant cache hit.
[2026-05-22 17:45:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:45:54] [INFO ] Implicit Places using invariants and state equation in 859 ms returned [68, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 314/346 places, 620/764 transitions.
Applied a total of 0 rules in 6 ms. Remains 314 /314 variables (removed 0) and now considering 620/620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62426 ms. Remains : 314/346 places, 620/764 transitions.
RANDOM walk for 40000 steps (660 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (176 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (128 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (145 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (164 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (186 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (152 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (182 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 223962 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 7
Probabilistic random walk after 223962 steps, saw 145601 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) 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-6637047301097110585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18206075995836278503.kers'
[2026-05-22 17:45:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6637047301097110585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18206075995836278503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 620 rows 314 cols 2512 entries
Finished phase 1 with 146 SingleSign rule and 130 generalized
[2026-05-22 17:45:57] [INFO ] Computed 38 invariants in 3 ms
Computed 38 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18206075995836278503.kers
Total runtime 4 ms.
[2026-05-22 17:45:57] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 95/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 83/184 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/301 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 620/921 variables, 301/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 13/934 variables, 13/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 934/934 variables, and 356 constraints, problems are : Problem set: 0 solved, 7 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 314/314 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 95/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 83/184 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/301 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 620/921 variables, 301/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 7/350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 13/934 variables, 13/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/934 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/934 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 934/934 variables, and 363 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2355 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 314/314 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2985ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2812 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 620/620 transitions.
Applied a total of 0 rules in 7 ms. Remains 314 /314 variables (removed 0) and now considering 620/620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 314/314 places, 620/620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 620/620 transitions.
Applied a total of 0 rules in 8 ms. Remains 314 /314 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2026-05-22 17:46:03] [INFO ] Invariant cache hit.
[2026-05-22 17:46:03] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-22 17:46:03] [INFO ] Invariant cache hit.
[2026-05-22 17:46:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:46:04] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2026-05-22 17:46:04] [INFO ] Redundant transitions in 11 ms returned []
Running 619 sub problems to find dead transitions.
[2026-05-22 17:46:04] [INFO ] Invariant cache hit.
[2026-05-22 17:46:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/934 variables, and 40 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/314 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 6 (OVERLAPS) 620/934 variables, 314/354 constraints. Problems are: Problem set: 165 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 4/358 constraints. Problems are: Problem set: 165 solved, 454 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/934 variables, 454/812 constraints. Problems are: Problem set: 170 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 934/934 variables, and 812 constraints, problems are : Problem set: 170 solved, 449 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 314/314 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 454/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 170 solved, 449 unsolved
Search for dead transitions found 170 dead transitions in 60215ms
Found 170 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 170 transitions
Dead transitions reduction (with SMT) removed 170 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 314/314 places, 450/620 transitions.
Ensure Unique test removed 15 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 298 transition count 433
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 50 place count 281 transition count 433
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 281 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 280 transition count 432
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 280 transition count 432
Applied a total of 53 rules in 39 ms. Remains 280 /314 variables (removed 34) and now considering 432/450 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14870891297941918063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2922757910232914172.kers'
[2026-05-22 17:47:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14870891297941918063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2922757910232914172.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 280 cols 1764 entries
Finished phase 1 with 125 SingleSign rule and 117 generalized
[2026-05-22 17:47:04] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2922757910232914172.kers
Total runtime 5 ms.
[2026-05-22 17:47:04] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-22 17:47:04] [INFO ] Invariant cache hit.
[2026-05-22 17:47:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 17:47:05] [INFO ] Implicit Places using invariants and state equation in 618 ms returned [2, 62, 63]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 896 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 277/314 places, 432/620 transitions.
Applied a total of 0 rules in 8 ms. Remains 277 /277 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62343 ms. Remains : 277/314 places, 432/620 transitions.
Knowledge based reduction with 18 factoid took 335 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false]
Knowledge-based reduction took 166509 ms.
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false]
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 790/790 transitions.
Applied a total of 0 rules in 19 ms. Remains 379 /379 variables (removed 0) and now considering 790/790 (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-8819438260837739388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17517146026900048418.kers'
[2026-05-22 17:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8819438260837739388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17517146026900048418.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 790 rows 379 cols 3153 entries
Finished phase 1 with 179 SingleSign rule and 149 generalized
[2026-05-22 17:47:06] [INFO ] Computed 51 invariants in 9 ms
Computed 51 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17517146026900048418.kers
Total runtime 12 ms.
[2026-05-22 17:47:07] [INFO ] Implicit Places using invariants in 411 ms returned []
[2026-05-22 17:47:07] [INFO ] Invariant cache hit.
[2026-05-22 17:47:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 17:47:08] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2026-05-22 17:47:08] [INFO ] Redundant transitions in 7 ms returned []
Running 789 sub problems to find dead transitions.
[2026-05-22 17:47:08] [INFO ] Invariant cache hit.
[2026-05-22 17:47:08] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (OVERLAPS) 1/379 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1169 variables, and 51 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/379 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (OVERLAPS) 1/379 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1169 variables, and 52 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/379 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62248 ms. Remains : 379/379 places, 790/790 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 37 factoid took 163 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (636 resets) in 285 ms. (139 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (181 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (143 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (160 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (193 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
[2026-05-22 17:48:09] [INFO ] Invariant cache hit.
[2026-05-22 17:48:09] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/159 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 217/376 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/379 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 790/1169 variables, 379/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1169 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1169 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 437 constraints, problems are : Problem set: 0 solved, 6 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/159 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 217/376 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/379 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 790/1169 variables, 379/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1169 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1169 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1169 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 443 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3192ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2543 ms.
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 790/790 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 379 transition count 785
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 11 place count 374 transition count 784
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 24 place count 374 transition count 771
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 37 place count 361 transition count 771
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 361 transition count 771
Applied a total of 44 rules in 39 ms. Remains 361 /379 variables (removed 18) and now considering 771/790 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 361/379 places, 771/790 transitions.
RANDOM walk for 40000 steps (688 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (184 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (142 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (158 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (166 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (180 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 227325 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 6
Probabilistic random walk after 227325 steps, saw 141049 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) 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-4015356210560284423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5403204688741164086.kers'
[2026-05-22 17:48:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4015356210560284423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5403204688741164086.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 771 rows 360 cols 3171 entries
Finished phase 1 with 153 SingleSign rule and 157 generalized
[2026-05-22 17:48:18] [INFO ] Computed 51 invariants in 4 ms
Computed 51 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5403204688741164086.kers
Total runtime 6 ms.
[2026-05-22 17:48:18] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 108/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 130/244 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/361 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 771/1132 variables, 361/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1132 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1132 variables, and 420 constraints, problems are : Problem set: 0 solved, 6 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 108/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 130/244 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/361 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 771/1132 variables, 361/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1132 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1132 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1843 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2661ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2654 ms.
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 771/771 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 771/771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 361/361 places, 771/771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 771/771 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 771/771 (removed 0) transitions.
[2026-05-22 17:48:23] [INFO ] Invariant cache hit.
[2026-05-22 17:48:24] [INFO ] Implicit Places using invariants in 220 ms returned [105, 113, 120, 121, 122, 200, 201, 285, 293]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 222 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/361 places, 771/771 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 352 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 770
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 349 transition count 768
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 349 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 349 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 349 transition count 766
Applied a total of 8 rules in 44 ms. Remains 349 /352 variables (removed 3) and now considering 766/771 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5765243953780741238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15359895994397104974.kers'
[2026-05-22 17:48:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5765243953780741238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15359895994397104974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 766 rows 349 cols 3091 entries
Finished phase 1 with 144 SingleSign rule and 163 generalized
[2026-05-22 17:48:24] [INFO ] Computed 42 invariants in 4 ms
Computed 42 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15359895994397104974.kers
Total runtime 5 ms.
[2026-05-22 17:48:24] [INFO ] Implicit Places using invariants in 244 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/361 places, 766/771 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 347 transition count 765
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 347 transition count 764
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 346 transition count 764
Applied a total of 4 rules in 24 ms. Remains 346 /348 variables (removed 2) and now considering 764/766 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10541806452154711689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3000275775039778001.kers'
[2026-05-22 17:48:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10541806452154711689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3000275775039778001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 764 rows 346 cols 3099 entries
Finished phase 1 with 143 SingleSign rule and 162 generalized
[2026-05-22 17:48:24] [INFO ] Computed 41 invariants in 4 ms
Computed 41 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3000275775039778001.kers
Total runtime 4 ms.
[2026-05-22 17:48:24] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-22 17:48:24] [INFO ] Invariant cache hit.
[2026-05-22 17:48:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:48:25] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 346/361 places, 764/771 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1560 ms. Remains : 346/361 places, 764/771 transitions.
RANDOM walk for 40000 steps (676 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (185 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (129 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (170 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (162 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (188 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 212388 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 6
Probabilistic random walk after 212388 steps, saw 134303 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2026-05-22 17:48:28] [INFO ] Invariant cache hit.
[2026-05-22 17:48:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 128/253 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 93/346 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 764/1110 variables, 346/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1110 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 391 constraints, problems are : Problem set: 0 solved, 6 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 128/253 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 93/346 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 764/1110 variables, 346/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1110 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2619 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3337ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2634 ms.
Support contains 6 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 764/764 transitions.
Applied a total of 0 rules in 9 ms. Remains 346 /346 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 346/346 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 764/764 transitions.
Applied a total of 0 rules in 9 ms. Remains 346 /346 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2026-05-22 17:48:34] [INFO ] Invariant cache hit.
[2026-05-22 17:48:34] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-22 17:48:34] [INFO ] Invariant cache hit.
[2026-05-22 17:48:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:48:35] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2026-05-22 17:48:35] [INFO ] Redundant transitions in 7 ms returned []
Running 763 sub problems to find dead transitions.
[2026-05-22 17:48:35] [INFO ] Invariant cache hit.
[2026-05-22 17:48:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1110 variables, and 41 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/346 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 763 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1110 variables, and 46 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/346 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/763 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 763 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61261 ms. Remains : 346/346 places, 764/764 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 346 transition count 762
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 344 transition count 762
Applied a total of 4 rules in 16 ms. Remains 344 /346 variables (removed 2) and now considering 762/764 (removed 2) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13954077978241703840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9806091204415919737.kers'
[2026-05-22 17:49:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13954077978241703840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9806091204415919737.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 762 rows 344 cols 3095 entries
Finished phase 1 with 141 SingleSign rule and 162 generalized
[2026-05-22 17:49:35] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9806091204415919737.kers
Total runtime 8 ms.
[2026-05-22 17:49:35] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 17:49:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2026-05-22 17:49:36] [INFO ] [Nat]Absence check using 20 positive and 21 generalized place invariants in 10 ms returned sat
[2026-05-22 17:49:37] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 17:49:37] [INFO ] After 1384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 17:49:37] [INFO ] After 1870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 2020 ms.
Knowledge based reduction with 37 factoid took 223 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false]
Knowledge-based reduction took 89402 ms.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 1623 reset in 393 ms.
Product exploration explored 100000 steps with 1646 reset in 395 ms.
Built C files in :
/tmp/ltsmin13945904057851797123
[2026-05-22 17:49:40] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2026-05-22 17:49:40] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:49:40] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2026-05-22 17:49:40] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:49:40] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2026-05-22 17:49:40] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:49:40] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13945904057851797123
Running compilation step : cd /tmp/ltsmin13945904057851797123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2169 ms.
Running link step : cd /tmp/ltsmin13945904057851797123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin13945904057851797123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9964758464206038844.hoa' '--buchi-type=spotba'
LTSmin run took 3744 ms.
FORMULA ASLink-PT-03a-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03a-LTLCardinality-06 finished in 330978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 6 out of 707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 706 transition count 948
Reduce places removed 133 places and 0 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 136 rules applied. Total rules applied 266 place count 573 transition count 945
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 270 place count 570 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 271 place count 569 transition count 944
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 271 place count 569 transition count 858
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 27 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 199 rules applied. Total rules applied 470 place count 456 transition count 858
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 32 rules applied. Total rules applied 502 place count 445 transition count 837
Reduce places removed 22 places and 0 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 5 with 24 rules applied. Total rules applied 526 place count 423 transition count 835
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 529 place count 421 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 530 place count 420 transition count 834
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 530 place count 420 transition count 826
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 546 place count 412 transition count 826
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 555 place count 403 transition count 817
Iterating global reduction 8 with 9 rules applied. Total rules applied 564 place count 403 transition count 817
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 571 place count 403 transition count 810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 572 place count 402 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 572 place count 402 transition count 809
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 574 place count 401 transition count 809
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 654 place count 361 transition count 769
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 655 place count 360 transition count 768
Iterating global reduction 10 with 1 rules applied. Total rules applied 656 place count 360 transition count 768
Applied a total of 656 rules in 63 ms. Remains 360 /707 variables (removed 347) and now considering 768/1079 (removed 311) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14607352666947403147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13347986844005246948.kers'
[2026-05-22 17:49:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14607352666947403147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13347986844005246948.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 768 rows 359 cols 3077 entries
Finished phase 1 with 154 SingleSign rule and 154 generalized
[2026-05-22 17:49:46] [INFO ] Computed 52 invariants in 9 ms
Computed 52 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13347986844005246948.kers
Total runtime 11 ms.
[2026-05-22 17:49:46] [INFO ] Implicit Places using invariants in 420 ms returned [72, 90, 96, 101, 160, 177, 183, 191, 193, 253, 289, 301, 359]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 424 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/707 places, 768/1079 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 347 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 346 transition count 767
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 346 transition count 763
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 342 transition count 763
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 339 transition count 760
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 339 transition count 760
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 336 transition count 757
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 336 transition count 757
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 335 transition count 756
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 335 transition count 756
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 329 transition count 750
Applied a total of 36 rules in 35 ms. Remains 329 /347 variables (removed 18) and now considering 750/768 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16624204928734362868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1695830175274845385.kers'
[2026-05-22 17:49:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16624204928734362868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1695830175274845385.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 750 rows 329 cols 3004 entries
Finished phase 1 with 148 SingleSign rule and 142 generalized
[2026-05-22 17:49:46] [INFO ] Computed 39 invariants in 4 ms
Computed 39 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1695830175274845385.kers
Total runtime 5 ms.
[2026-05-22 17:49:47] [INFO ] Implicit Places using invariants in 485 ms returned [255, 260]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 489 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 327/707 places, 750/1079 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 326 transition count 749
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 326 transition count 749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 325 transition count 748
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 325 transition count 748
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 324 transition count 747
Applied a total of 6 rules in 22 ms. Remains 324 /327 variables (removed 3) and now considering 747/750 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13602030957919063638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13540103750250441547.kers'
[2026-05-22 17:49:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13602030957919063638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13540103750250441547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 747 rows 324 cols 2993 entries
Finished phase 1 with 149 SingleSign rule and 138 generalized
[2026-05-22 17:49:47] [INFO ] Computed 37 invariants in 4 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13540103750250441547.kers
Total runtime 18 ms.
[2026-05-22 17:49:47] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-22 17:49:47] [INFO ] Invariant cache hit.
[2026-05-22 17:49:48] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 324/707 places, 747/1079 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1948 ms. Remains : 324/707 places, 747/1079 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-07
Product exploration explored 100000 steps with 2113 reset in 247 ms.
Product exploration explored 100000 steps with 2160 reset in 236 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 7 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (751 resets) in 169 ms. (235 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (199 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (195 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
[2026-05-22 17:49:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/241 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/323 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 747/1071 variables, 324/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1071 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1071/1071 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/241 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/323 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 747/1071 variables, 324/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1071 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1071 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1071/1071 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 351 ms.
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 747/747 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 737
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 23 place count 314 transition count 734
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 314 transition count 724
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 43 place count 304 transition count 724
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 304 transition count 724
Applied a total of 46 rules in 30 ms. Remains 304 /324 variables (removed 20) and now considering 724/747 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 304/324 places, 724/747 transitions.
RANDOM walk for 40000 steps (823 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (220 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (235 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 94720 steps, run visited all 2 properties in 841 ms. (steps per millisecond=112 )
Probabilistic random walk after 94720 steps, saw 62871 distinct states, run finished after 851 ms. (steps per millisecond=111 ) properties seen :2
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 2702 ms.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 747/747 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2026-05-22 17:49:51] [INFO ] Invariant cache hit.
[2026-05-22 17:49:51] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-22 17:49:51] [INFO ] Invariant cache hit.
[2026-05-22 17:49:52] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2026-05-22 17:49:52] [INFO ] Redundant transitions in 7 ms returned []
Running 727 sub problems to find dead transitions.
[2026-05-22 17:49:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 3 (OVERLAPS) 1/324 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/1071 variables, and 37 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/324 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 3 (OVERLAPS) 1/324 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/1071 variables, and 39 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/324 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61192 ms. Remains : 324/324 places, 747/747 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 7 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (702 resets) in 125 ms. (317 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (207 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (214 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2026-05-22 17:50:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/241 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/323 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 747/1071 variables, 324/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1071 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1071/1071 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/241 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/323 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 747/1071 variables, 324/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1071 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1071 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1071/1071 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 373 ms.
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 747/747 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 737
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 23 place count 314 transition count 734
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 314 transition count 724
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 43 place count 304 transition count 724
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 304 transition count 724
Applied a total of 46 rules in 32 ms. Remains 304 /324 variables (removed 20) and now considering 724/747 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 304/324 places, 724/747 transitions.
RANDOM walk for 40000 steps (761 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (221 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 35269 steps (187 resets) in 43 ms. (801 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 2016 ms.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2215 reset in 221 ms.
Product exploration explored 100000 steps with 2096 reset in 182 ms.
Built C files in :
/tmp/ltsmin8796710274687075928
[2026-05-22 17:50:55] [INFO ] Computing symmetric may disable matrix : 747 transitions.
[2026-05-22 17:50:55] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:50:55] [INFO ] Computing symmetric may enable matrix : 747 transitions.
[2026-05-22 17:50:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:50:55] [INFO ] Computing Do-Not-Accords matrix : 747 transitions.
[2026-05-22 17:50:55] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:50:55] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8796710274687075928
Running compilation step : cd /tmp/ltsmin8796710274687075928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2017 ms.
Running link step : cd /tmp/ltsmin8796710274687075928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8796710274687075928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11420020899235864276.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 747/747 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2026-05-22 17:51:10] [INFO ] Invariant cache hit.
[2026-05-22 17:51:11] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-22 17:51:11] [INFO ] Invariant cache hit.
[2026-05-22 17:51:11] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2026-05-22 17:51:11] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1054 ms. Remains : 324/324 places, 747/747 transitions.
Built C files in :
/tmp/ltsmin14090947281646311248
[2026-05-22 17:51:11] [INFO ] Computing symmetric may disable matrix : 747 transitions.
[2026-05-22 17:51:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:51:11] [INFO ] Computing symmetric may enable matrix : 747 transitions.
[2026-05-22 17:51:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:51:11] [INFO ] Computing Do-Not-Accords matrix : 747 transitions.
[2026-05-22 17:51:11] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:51:11] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14090947281646311248
Running compilation step : cd /tmp/ltsmin14090947281646311248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1950 ms.
Running link step : cd /tmp/ltsmin14090947281646311248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin14090947281646311248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16402513095356857031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 17:51:26] [INFO ] Flatten gal took : 51 ms
[2026-05-22 17:51:26] [INFO ] Flatten gal took : 40 ms
[2026-05-22 17:51:26] [INFO ] Time to serialize gal into /tmp/LTL14823164011626429759.gal : 8 ms
[2026-05-22 17:51:26] [INFO ] Time to serialize properties into /tmp/LTL3526930372171173265.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/LTL14823164011626429759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4823174182054709608.hoa' '-atoms' '/tmp/LTL3526930372171173265.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3526930372171173265.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4823174182054709608.hoa
Detected timeout of ITS tools.
[2026-05-22 17:51:42] [INFO ] Flatten gal took : 30 ms
[2026-05-22 17:51:42] [INFO ] Flatten gal took : 43 ms
[2026-05-22 17:51:42] [INFO ] Time to serialize gal into /tmp/LTL6660712665525988680.gal : 7 ms
[2026-05-22 17:51:42] [INFO ] Time to serialize properties into /tmp/LTL5705802580875328702.ltl : 12 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/LTL6660712665525988680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5705802580875328702.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("(((p129==0)||(p802==1))||((p362==0)||(p59==1)))"))||(F("((p817==0)&&(p526==1))"))))
Formula 0 simplified : F!"(((p129==0)||(p802==1))||((p362==0)||(p59==1)))" & G!"((p817==0)&&(p526==1))"
Detected timeout of ITS tools.
[2026-05-22 17:51:57] [INFO ] Flatten gal took : 19 ms
[2026-05-22 17:51:57] [INFO ] Applying decomposition
[2026-05-22 17:51:57] [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/graph199620598476912666.txt' '-o' '/tmp/graph199620598476912666.bin' '-w' '/tmp/graph199620598476912666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph199620598476912666.bin' '-l' '-1' '-v' '-w' '/tmp/graph199620598476912666.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:51:57] [INFO ] Decomposing Gal with order
[2026-05-22 17:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:51:57] [INFO ] Removed a total of 1496 redundant transitions.
[2026-05-22 17:51:57] [INFO ] Flatten gal took : 99 ms
[2026-05-22 17:51:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 23 ms.
[2026-05-22 17:51:57] [INFO ] Time to serialize gal into /tmp/LTL8820463050899419646.gal : 7 ms
[2026-05-22 17:51:57] [INFO ] Time to serialize properties into /tmp/LTL16597159372673934178.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/LTL8820463050899419646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16597159372673934178.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("(((i3.u27.p129==0)||(i6.i3.u87.p802==1))||((i4.u45.p362==0)||(i3.u46.p59==1)))"))||(F("((i6.i3.u86.p817==0)&&(i6.i0.u66.p526==1...162
Formula 0 simplified : F!"(((i3.u27.p129==0)||(i6.i3.u87.p802==1))||((i4.u45.p362==0)||(i3.u46.p59==1)))" & G!"((i6.i3.u86.p817==0)&&(i6.i0.u66.p526==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03a-LTLCardinality-07 finished in 146394 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 707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 706 transition count 944
Reduce places removed 137 places and 0 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 140 rules applied. Total rules applied 274 place count 569 transition count 941
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 277 place count 566 transition count 941
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 277 place count 566 transition count 853
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 482 place count 449 transition count 853
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 34 rules applied. Total rules applied 516 place count 438 transition count 830
Reduce places removed 25 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 29 rules applied. Total rules applied 545 place count 413 transition count 826
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 549 place count 409 transition count 826
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 549 place count 409 transition count 813
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 575 place count 396 transition count 813
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 584 place count 387 transition count 804
Iterating global reduction 6 with 9 rules applied. Total rules applied 593 place count 387 transition count 804
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 7 rules applied. Total rules applied 600 place count 387 transition count 797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 601 place count 386 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 601 place count 386 transition count 796
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 603 place count 385 transition count 796
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 681 place count 346 transition count 757
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 682 place count 345 transition count 756
Iterating global reduction 8 with 1 rules applied. Total rules applied 683 place count 345 transition count 756
Applied a total of 683 rules in 43 ms. Remains 345 /707 variables (removed 362) and now considering 756/1079 (removed 323) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12910712203799534798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-110177425812576820.kers'
[2026-05-22 17:52:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12910712203799534798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-110177425812576820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 756 rows 345 cols 3048 entries
Finished phase 1 with 140 SingleSign rule and 156 generalized
[2026-05-22 17:52:12] [INFO ] Computed 49 invariants in 4 ms
Computed 49 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-110177425812576820.kers
Total runtime 5 ms.
[2026-05-22 17:52:13] [INFO ] Implicit Places using invariants in 302 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 342]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 305 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 330/707 places, 756/1079 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 330 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 329 transition count 755
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 323 transition count 749
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 323 transition count 749
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 317 transition count 743
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 317 transition count 743
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 314 transition count 740
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 314 transition count 740
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 308 transition count 734
Applied a total of 44 rules in 27 ms. Remains 308 /330 variables (removed 22) and now considering 734/756 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8310379384832005367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2798266536429328408.kers'
[2026-05-22 17:52:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8310379384832005367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2798266536429328408.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 734 rows 308 cols 2954 entries
Finished phase 1 with 138 SingleSign rule and 136 generalized
[2026-05-22 17:52:13] [INFO ] Computed 34 invariants in 4 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2798266536429328408.kers
Total runtime 4 ms.
[2026-05-22 17:52:13] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-22 17:52:13] [INFO ] Invariant cache hit.
[2026-05-22 17:52:14] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 308/707 places, 734/1079 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1427 ms. Remains : 308/707 places, 734/1079 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 39 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-08
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-08 finished in 1512 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(G((p0||G(p1))))||F(p1)))))'
Support contains 3 out of 707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 706 transition count 1078
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 706 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 705 transition count 1077
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 705 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 704 transition count 1076
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 704 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 703 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 703 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 702 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 702 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 701 transition count 1073
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 701 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 700 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 700 transition count 1072
Applied a total of 14 rules in 102 ms. Remains 700 /707 variables (removed 7) and now considering 1072/1079 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3984032295432307525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12044115326348879234.kers'
[2026-05-22 17:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3984032295432307525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12044115326348879234.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1072 rows 700 cols 3754 entries
Finished phase 1 with 441 SingleSign rule and 165 generalized
[2026-05-22 17:52:14] [INFO ] Computed 94 invariants in 11 ms
Computed 94 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12044115326348879234.kers
Total runtime 15 ms.
[2026-05-22 17:52:14] [INFO ] Implicit Places using invariants in 629 ms returned [210, 573]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 652 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/707 places, 1072/1079 transitions.
Applied a total of 0 rules in 11 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 766 ms. Remains : 698/707 places, 1072/1079 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(G((p0||G(p1))))||F(p1)))))'
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-09
Stuttering criterion allowed to conclude after 144 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-09 finished in 996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Reduce places removed 1 places and 1 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 706 transition count 945
Reduce places removed 136 places and 0 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 139 rules applied. Total rules applied 272 place count 570 transition count 942
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 275 place count 567 transition count 942
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 275 place count 567 transition count 854
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 480 place count 450 transition count 854
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 34 rules applied. Total rules applied 514 place count 439 transition count 831
Reduce places removed 24 places and 0 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 4 with 26 rules applied. Total rules applied 540 place count 415 transition count 829
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 542 place count 413 transition count 829
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 542 place count 413 transition count 820
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 560 place count 404 transition count 820
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 569 place count 395 transition count 811
Iterating global reduction 6 with 9 rules applied. Total rules applied 578 place count 395 transition count 811
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 7 rules applied. Total rules applied 585 place count 395 transition count 804
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 586 place count 394 transition count 804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 586 place count 394 transition count 803
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 588 place count 393 transition count 803
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 668 place count 353 transition count 763
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 669 place count 352 transition count 762
Iterating global reduction 8 with 1 rules applied. Total rules applied 670 place count 352 transition count 762
Applied a total of 670 rules in 83 ms. Remains 352 /707 variables (removed 355) and now considering 762/1079 (removed 317) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4148040821627583904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5261662870922724067.kers'
[2026-05-22 17:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4148040821627583904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5261662870922724067.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 762 rows 351 cols 3060 entries
Finished phase 1 with 146 SingleSign rule and 156 generalized
[2026-05-22 17:52:15] [INFO ] Computed 50 invariants in 3 ms
Computed 50 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5261662870922724067.kers
Total runtime 4 ms.
[2026-05-22 17:52:15] [INFO ] Implicit Places using invariants in 318 ms returned [72, 114, 166, 183, 189, 194, 196, 256, 273, 279, 284, 286, 349]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 322 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 339/707 places, 762/1079 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 339 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 338 transition count 761
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 338 transition count 757
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 334 transition count 757
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 330 transition count 753
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 330 transition count 753
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 326 transition count 749
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 326 transition count 749
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 324 transition count 747
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 324 transition count 747
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 319 transition count 742
Applied a total of 40 rules in 29 ms. Remains 319 /339 variables (removed 20) and now considering 742/762 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6155948160668610495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9095016201502591289.kers'
[2026-05-22 17:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6155948160668610495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9095016201502591289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 742 rows 319 cols 2980 entries
Finished phase 1 with 142 SingleSign rule and 140 generalized
[2026-05-22 17:52:15] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9095016201502591289.kers
Total runtime 4 ms.
[2026-05-22 17:52:15] [INFO ] Implicit Places using invariants in 265 ms returned [87, 93, 98]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 266 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 316/707 places, 742/1079 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 314 transition count 740
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 314 transition count 740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 312 transition count 738
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 312 transition count 738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 311 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 311 transition count 737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 310 transition count 736
Applied a total of 12 rules in 33 ms. Remains 310 /316 variables (removed 6) and now considering 736/742 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13354621766231592966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16311299667568129983.kers'
[2026-05-22 17:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13354621766231592966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16311299667568129983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 736 rows 310 cols 2958 entries
Finished phase 1 with 140 SingleSign rule and 136 generalized
[2026-05-22 17:52:15] [INFO ] Computed 34 invariants in 3 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16311299667568129983.kers
Total runtime 4 ms.
[2026-05-22 17:52:16] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-22 17:52:16] [INFO ] Invariant cache hit.
[2026-05-22 17:52:16] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 310/707 places, 736/1079 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1599 ms. Remains : 310/707 places, 736/1079 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-13
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-13 finished in 1656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||!(p0 U p1)))'
Support contains 4 out of 707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 706 transition count 944
Reduce places removed 137 places and 0 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 140 rules applied. Total rules applied 274 place count 569 transition count 941
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 277 place count 566 transition count 941
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 277 place count 566 transition count 854
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 480 place count 450 transition count 854
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 30 rules applied. Total rules applied 510 place count 439 transition count 835
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 25 rules applied. Total rules applied 535 place count 418 transition count 831
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 539 place count 414 transition count 831
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 539 place count 414 transition count 818
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 565 place count 401 transition count 818
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 574 place count 392 transition count 809
Iterating global reduction 6 with 9 rules applied. Total rules applied 583 place count 392 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 587 place count 392 transition count 805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 588 place count 391 transition count 805
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 588 place count 391 transition count 804
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 590 place count 390 transition count 804
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 593 place count 387 transition count 801
Iterating global reduction 8 with 3 rules applied. Total rules applied 596 place count 387 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 599 place count 387 transition count 798
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 9 with 72 rules applied. Total rules applied 671 place count 351 transition count 762
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 672 place count 350 transition count 761
Iterating global reduction 9 with 1 rules applied. Total rules applied 673 place count 350 transition count 761
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 674 place count 350 transition count 761
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 675 place count 349 transition count 760
Iterating global reduction 9 with 1 rules applied. Total rules applied 676 place count 349 transition count 760
Discarding 1 places :
Implicit places reduction removed 1 places
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 9 with 2 rules applied. Total rules applied 678 place count 348 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 679 place count 347 transition count 759
Applied a total of 679 rules in 95 ms. Remains 347 /707 variables (removed 360) and now considering 759/1079 (removed 320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4327834963386123470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17787961443032183340.kers'
[2026-05-22 17:52:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4327834963386123470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17787961443032183340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 759 rows 347 cols 3050 entries
Finished phase 1 with 143 SingleSign rule and 156 generalized
[2026-05-22 17:52:16] [INFO ] Computed 48 invariants in 4 ms
Computed 48 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17787961443032183340.kers
Total runtime 5 ms.
[2026-05-22 17:52:17] [INFO ] Implicit Places using invariants in 320 ms returned [72, 89, 95, 100, 159, 176, 188, 190, 250, 267, 273, 278, 280]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 322 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 334/707 places, 759/1079 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 329 transition count 754
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 329 transition count 754
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 324 transition count 749
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 324 transition count 749
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 322 transition count 747
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 322 transition count 747
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 316 transition count 741
Applied a total of 36 rules in 30 ms. Remains 316 /334 variables (removed 18) and now considering 741/759 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7586890166173263016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9189226012047237959.kers'
[2026-05-22 17:52:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7586890166173263016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9189226012047237959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 741 rows 316 cols 2972 entries
Finished phase 1 with 144 SingleSign rule and 137 generalized
[2026-05-22 17:52:17] [INFO ] Computed 35 invariants in 12 ms
Computed 35 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-9189226012047237959.kers
Total runtime 26 ms.
[2026-05-22 17:52:17] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-22 17:52:17] [INFO ] Invariant cache hit.
[2026-05-22 17:52:18] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 316/707 places, 741/1079 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1528 ms. Remains : 316/707 places, 741/1079 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||!(p0 U p1)))'
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 92 steps with 3 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-14 finished in 1680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((F(p1) U p2) U p0))))'
Support contains 5 out of 707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 707/707 places, 1079/1079 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 706 transition count 1078
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 706 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 705 transition count 1077
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 705 transition count 1077
Applied a total of 4 rules in 49 ms. Remains 705 /707 variables (removed 2) and now considering 1077/1079 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3225888430330028051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6668725957052074068.kers'
[2026-05-22 17:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3225888430330028051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6668725957052074068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1077 rows 705 cols 3769 entries
Finished phase 1 with 446 SingleSign rule and 165 generalized
[2026-05-22 17:52:18] [INFO ] Computed 94 invariants in 6 ms
Computed 94 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6668725957052074068.kers
Total runtime 7 ms.
[2026-05-22 17:52:19] [INFO ] Implicit Places using invariants in 611 ms returned [210, 573]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 703/707 places, 1077/1079 transitions.
Applied a total of 0 rules in 28 ms. Remains 703 /703 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 690 ms. Remains : 703/707 places, 1077/1079 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((F(p1) U p2) U p0))))'
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-15
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-15 finished in 998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(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 17:52:19] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7182030149570174489
[2026-05-22 17:52:19] [INFO ] Computing symmetric may disable matrix : 1079 transitions.
[2026-05-22 17:52:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:52:19] [INFO ] Computing symmetric may enable matrix : 1079 transitions.
[2026-05-22 17:52:19] [INFO ] Applying decomposition
[2026-05-22 17:52:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:52:19] [INFO ] Flatten gal took : 21 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/graph15520017314538648310.txt' '-o' '/tmp/graph15520017314538648310.bin' '-w' '/tmp/graph15520017314538648310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15520017314538648310.bin' '-l' '-1' '-v' '-w' '/tmp/graph15520017314538648310.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:52:19] [INFO ] Decomposing Gal with order
[2026-05-22 17:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:52:19] [INFO ] Removed a total of 1510 redundant transitions.
[2026-05-22 17:52:19] [INFO ] Flatten gal took : 50 ms
[2026-05-22 17:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 17 ms.
[2026-05-22 17:52:19] [INFO ] Computing Do-Not-Accords matrix : 1079 transitions.
[2026-05-22 17:52:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15884393096509229411.gal : 8 ms
[2026-05-22 17:52:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality1809020535069844369.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/LTLCardinality15884393096509229411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1809020535069844369.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 1 LTL properties
[2026-05-22 17:52:19] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:52:19] [INFO ] Built C files in 270ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7182030149570174489
Running compilation step : cd /tmp/ltsmin7182030149570174489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Checking formula 0 : !(((G("(((i2.i0.u38.p129==0)||(i13.i1.u220.p802==1))||((i7.i0.u109.p362==0)||(i2.i4.u65.p59==1)))"))||(F("((i13.i0.u225.p817==0)&&(i9....177
Formula 0 simplified : F!"(((i2.i0.u38.p129==0)||(i13.i1.u220.p802==1))||((i7.i0.u109.p362==0)||(i2.i4.u65.p59==1)))" & G!"((i13.i0.u225.p817==0)&&(i9.i0.u...169
Compilation finished in 3338 ms.
Running link step : cd /tmp/ltsmin7182030149570174489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin7182030149570174489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t13, t14, t15, t198, t826, t847, t897, t923, t973, t999, t1052, i2.i1...657
Computing Next relation with stutter on 6.33124e+08 deadlock states
Detected timeout of ITS tools.
[2026-05-22 18:16:27] [INFO ] Applying decomposition
[2026-05-22 18:16:27] [INFO ] Flatten gal took : 41 ms
[2026-05-22 18:16:27] [INFO ] Decomposing Gal with order
[2026-05-22 18:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:16:27] [INFO ] Removed a total of 1255 redundant transitions.
[2026-05-22 18:16:27] [INFO ] Flatten gal took : 72 ms
[2026-05-22 18:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 450 labels/synchronizations in 32 ms.
[2026-05-22 18:16:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality3012227045207550548.gal : 9 ms
[2026-05-22 18:16:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality7465111752680498429.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/LTLCardinality3012227045207550548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7465111752680498429.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((i5.u13.p129==0)||(i30.u146.p802==1))||((i14.i5.u57.p362==0)||(u5.p59==1)))"))||(F("((i30.u151.p817==0)&&(i22.i3.u155.p526==1...162
Formula 0 simplified : F!"(((i5.u13.p129==0)||(i30.u146.p802==1))||((i14.i5.u57.p362==0)||(u5.p59==1)))" & G!"((i30.u151.p817==0)&&(i22.i3.u155.p526==1))"
Reverse transition relation is NOT exact ! Due to transitions t627, t817, t818, t821, t826, t838, t847, t900, t923, t973, t999, t1052, i5.t5, i5.t4, i5.t3,...601
Computing Next relation with stutter on 6.33124e+08 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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