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.r178-oct2-177969019900179.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 MedleyA-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 160K 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 MedleyA-PT-11-LTLCardinality-00
FORMULA_NAME MedleyA-PT-11-LTLCardinality-01
FORMULA_NAME MedleyA-PT-11-LTLCardinality-02
FORMULA_NAME MedleyA-PT-11-LTLCardinality-03
FORMULA_NAME MedleyA-PT-11-LTLCardinality-04
FORMULA_NAME MedleyA-PT-11-LTLCardinality-05
FORMULA_NAME MedleyA-PT-11-LTLCardinality-06
FORMULA_NAME MedleyA-PT-11-LTLCardinality-07
FORMULA_NAME MedleyA-PT-11-LTLCardinality-08
FORMULA_NAME MedleyA-PT-11-LTLCardinality-09
FORMULA_NAME MedleyA-PT-11-LTLCardinality-10
FORMULA_NAME MedleyA-PT-11-LTLCardinality-11
FORMULA_NAME MedleyA-PT-11-LTLCardinality-12
FORMULA_NAME MedleyA-PT-11-LTLCardinality-13
FORMULA_NAME MedleyA-PT-11-LTLCardinality-14
FORMULA_NAME MedleyA-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699887153

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:04:48] [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-25 09:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:04:48] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-25 09:04:48] [INFO ] Transformed 150 places.
[2026-05-25 09:04:48] [INFO ] Transformed 478 transitions.
[2026-05-25 09:04:48] [INFO ] Found NUPN structural information;
[2026-05-25 09:04:48] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 126 transition count 433
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 126 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 123 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 123 transition count 416
Applied a total of 54 rules in 59 ms. Remains 123 /150 variables (removed 27) and now considering 416/469 (removed 53) transitions.
[2026-05-25 09:04:49] [INFO ] Flow matrix only has 344 transitions (discarded 72 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14403703716595545679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-435512252574047887.kers'
[2026-05-25 09:04:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14403703716595545679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-435512252574047887.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 344 rows 120 cols 1399 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 09:04:49] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-435512252574047887.kers
Total runtime 2 ms.
[2026-05-25 09:04:49] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-25 09:04:49] [INFO ] Flow matrix only has 344 transitions (discarded 72 similar events)
[2026-05-25 09:04:49] [INFO ] Invariant cache hit.
[2026-05-25 09:04:49] [INFO ] State equation strengthened by 165 read => feed constraints.
[2026-05-25 09:04:49] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2026-05-25 09:04:49] [INFO ] Flow matrix only has 344 transitions (discarded 72 similar events)
[2026-05-25 09:04:49] [INFO ] Invariant cache hit.
[2026-05-25 09:04:49] [INFO ] State equation strengthened by 165 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/123 variables, 15/23 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 3/46 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/46 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 344/467 variables, 123/169 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 165/334 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 9/343 constraints. Problems are: Problem set: 108 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/343 constraints. Problems are: Problem set: 108 solved, 307 unsolved
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 108 solved, 307 unsolved
Search for dead transitions found 108 dead transitions in 30404ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/150 places, 308/469 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 120 transition count 308
Applied a total of 3 rules in 5 ms. Remains 120 /123 variables (removed 3) and now considering 308/308 (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-11109305071531942703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8017778557476796691.kers'
[2026-05-25 09:05:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11109305071531942703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8017778557476796691.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 120 cols 1219 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 09:05:20] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8017778557476796691.kers
Total runtime 1 ms.
[2026-05-25 09:05:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:05:20] [INFO ] Invariant cache hit.
[2026-05-25 09:05:20] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-25 09:05:20] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/150 places, 308/469 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31560 ms. Remains : 120/150 places, 308/469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2026-05-25 09:05:20] [INFO ] Invariant cache hit.
[2026-05-25 09:05:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:05:20] [INFO ] Invariant cache hit.
[2026-05-25 09:05:20] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-25 09:05:20] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:05:20] [INFO ] Invariant cache hit.
[2026-05-25 09:05:20] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 308/428 variables, 120/167 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 129/296 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 307 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/428 variables, 120/183 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 129/312 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 307/619 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 622 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 120/120 places, 308/308 transitions.
Support contains 33 out of 120 places after structural reductions.
[2026-05-25 09:06:21] [INFO ] Flatten gal took : 85 ms
[2026-05-25 09:06:21] [INFO ] Flatten gal took : 45 ms
[2026-05-25 09:06:21] [INFO ] Input system was already deterministic with 308 transitions.
RANDOM walk for 40000 steps (3124 resets) in 1604 ms. (24 steps per ms) remains 9/20 properties
BEST_FIRST walk for 40003 steps (551 resets) in 121 ms. (327 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (548 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (487 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (493 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (545 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (538 resets) in 91 ms. (434 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (620 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (542 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
[2026-05-25 09:06:22] [INFO ] Invariant cache hit.
[2026-05-25 09:06:22] [INFO ] State equation strengthened by 129 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 31/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 12/117 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 306/423 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 129/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/428 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 269 constraints, problems are : Problem set: 0 solved, 7 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 31/105 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 12/117 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 306/423 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 129/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 5/428 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 287 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5504ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 308/308 transitions.
Graph (complete) has 562 edges and 120 vertex of which 118 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 108 transition count 285
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 108 transition count 285
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 105 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 105 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 104 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 104 transition count 264
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 37 place count 100 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 63 place count 100 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 65 place count 99 transition count 277
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 81 place count 99 transition count 524
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 111 place count 83 transition count 510
Applied a total of 111 rules in 130 ms. Remains 83 /120 variables (removed 37) and now considering 510/308 (removed -202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 83/120 places, 510/308 transitions.
RANDOM walk for 40000 steps (5807 resets) in 2375 ms. (16 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (1509 resets) in 110 ms. (360 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1459 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2026-05-25 09:06:28] [INFO ] Flow matrix only has 498 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17775992991588591279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13015055409444028710.kers'
[2026-05-25 09:06:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17775992991588591279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13015055409444028710.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 83 cols 2600 entries
Finished phase 1 with 59 SingleSign rule and 4 generalized
[2026-05-25 09:06:28] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13015055409444028710.kers
Total runtime 2 ms.
[2026-05-25 09:06:28] [INFO ] State equation strengthened by 261 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/71 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/82 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 498/580 variables, 82/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/581 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/581 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 261/261 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/82 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 498/580 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 261/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/581 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/581 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1655ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 196 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 510/510 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 494
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 8 place count 79 transition count 493
Free-agglomeration rule (complex) applied 4 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 79 transition count 582
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 35 place count 75 transition count 563
Applied a total of 35 rules in 53 ms. Remains 75 /83 variables (removed 8) and now considering 563/510 (removed -53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 75/83 places, 563/510 transitions.
RANDOM walk for 40000 steps (6496 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1445 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17727 steps, run visited all 1 properties in 100 ms. (steps per millisecond=177 )
Probabilistic random walk after 17727 steps, saw 4519 distinct states, run finished after 104 ms. (steps per millisecond=170 ) properties seen :1
FORMULA MedleyA-PT-11-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 124 stable transitions
Graph (complete) has 695 edges and 120 vertex of which 118 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 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 U p1) U (p2&&X(X(p3))))))'
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 105 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 105 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 102 transition count 259
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 102 transition count 259
Applied a total of 36 rules in 13 ms. Remains 102 /120 variables (removed 18) and now considering 259/308 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9566687273883715596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-939450379448399030.kers'
[2026-05-25 09:06:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9566687273883715596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-939450379448399030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 102 cols 1046 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:06:31] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-939450379448399030.kers
Total runtime 2 ms.
[2026-05-25 09:06:31] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 09:06:31] [INFO ] Invariant cache hit.
[2026-05-25 09:06:31] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-25 09:06:31] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-25 09:06:31] [INFO ] Invariant cache hit.
[2026-05-25 09:06:31] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 259/361 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 0/361 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 253 constraints, problems are : Problem set: 0 solved, 258 unsolved in 22255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 259/361 variables, 102/140 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 117/257 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 258/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 519 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52399ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 52401ms
Starting structural reductions in LTL mode, iteration 1 : 102/120 places, 259/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52848 ms. Remains : 102/120 places, 259/308 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 U p1) U (X(X(p2))&&p3))))'
Stuttering acceptance computed with spot in 715 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 24947 reset in 513 ms.
Product exploration explored 100000 steps with 24960 reset in 398 ms.
Computed a total of 13 stabilizing places and 105 stable transitions
Graph (complete) has 603 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 13 stabilizing places and 105 stable transitions
Knowledge based reduction with 34 factoid took 373 ms. Reduced automaton from 13 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 43 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (3130 resets) in 1070 ms. (37 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (52 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (52 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (53 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (50 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (56 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4003 steps (54 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (56 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (54 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (53 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
[2026-05-25 09:07:26] [INFO ] Invariant cache hit.
[2026-05-25 09:07:26] [INFO ] State equation strengthened by 117 read => feed constraints.
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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 40/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 13/100 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 258/358 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 117/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/361 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 239 constraints, problems are : Problem set: 0 solved, 14 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 40/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 13/100 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 258/358 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 117/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 3/361 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 257 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 9 properties in 1520 ms.
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 259/259 transitions.
Graph (complete) has 478 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 place count 100 transition count 257
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
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 13 place count 95 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 43 place count 95 transition count 266
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 59 place count 95 transition count 425
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 99 place count 79 transition count 401
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 100 place count 79 transition count 400
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 79 transition count 400
Applied a total of 107 rules in 50 ms. Remains 79 /102 variables (removed 23) and now considering 400/259 (removed -141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 79/102 places, 400/259 transitions.
RANDOM walk for 40000 steps (5579 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1360 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1241 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1235 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1343 resets) in 80 ms. (493 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (1250 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-524249425467581863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15203661088187095986.kers'
[2026-05-25 09:07:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-524249425467581863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15203661088187095986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 79 cols 2069 entries
Finished phase 1 with 55 SingleSign rule and 4 generalized
[2026-05-25 09:07:32] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15203661088187095986.kers
Total runtime 1 ms.
[2026-05-25 09:07:32] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 400/478 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/479 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 294 constraints, problems are : Problem set: 0 solved, 3 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 400/478 variables, 78/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 195/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 298 constraints, problems are : Problem set: 0 solved, 3 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 79/79 places, 400/400 transitions.
RANDOM walk for 40000 steps (5595 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1361 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1361 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1217 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 800872 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :1 out of 3
Probabilistic random walk after 800872 steps, saw 164614 distinct states, run finished after 3007 ms. (steps per millisecond=266 ) properties seen :1
[2026-05-25 09:07:36] [INFO ] Invariant cache hit.
[2026-05-25 09:07:36] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 400/478 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/479 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 294 constraints, problems are : Problem set: 0 solved, 2 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 400/478 variables, 78/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 195/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 15 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 79/79 places, 400/400 transitions.
RANDOM walk for 40000 steps (5596 resets) in 344 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1343 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1332 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 811795 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 2
Probabilistic random walk after 811795 steps, saw 166952 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
[2026-05-25 09:07:40] [INFO ] Invariant cache hit.
[2026-05-25 09:07:40] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 400/478 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/479 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 294 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 400/478 variables, 78/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 195/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/479 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 876ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 79/79 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2026-05-25 09:07:41] [INFO ] Invariant cache hit.
[2026-05-25 09:07:42] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 09:07:42] [INFO ] Invariant cache hit.
[2026-05-25 09:07:42] [INFO ] State equation strengthened by 195 read => feed constraints.
[2026-05-25 09:07:42] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2026-05-25 09:07:42] [INFO ] Redundant transitions in 27 ms returned []
Running 396 sub problems to find dead transitions.
[2026-05-25 09:07:42] [INFO ] Invariant cache hit.
[2026-05-25 09:07:42] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/44 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 400/479 variables, 79/125 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 195/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 320 constraints, problems are : Problem set: 4 solved, 392 unsolved in 26020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 26/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 400/479 variables, 79/125 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 195/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 392/712 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/713 constraints. Problems are: Problem set: 4 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 713 constraints, problems are : Problem set: 4 solved, 392 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/396 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56348ms problems are : Problem set: 4 solved, 392 unsolved
Search for dead transitions found 4 dead transitions in 56350ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/79 places, 396/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-25 09:08:38] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57121 ms. Remains : 79/79 places, 396/400 transitions.
RANDOM walk for 40000 steps (5595 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1358 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1319 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 758475 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 758475 steps, saw 156735 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) 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-3122413356655958910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9481628409487692371.kers'
[2026-05-25 09:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3122413356655958910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9481628409487692371.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 79 cols 2050 entries
Finished phase 1 with 55 SingleSign rule and 4 generalized
[2026-05-25 09:08:42] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9481628409487692371.kers
Total runtime 5 ms.
[2026-05-25 09:08:42] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 396/474 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/475 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/475 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 294 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 396/474 variables, 78/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 195/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/475 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/475 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1503ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 396/396 transitions.
Applied a total of 0 rules in 9 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 79/79 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 396/396 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-25 09:08:43] [INFO ] Invariant cache hit.
[2026-05-25 09:08:43] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-25 09:08:43] [INFO ] Invariant cache hit.
[2026-05-25 09:08:44] [INFO ] State equation strengthened by 195 read => feed constraints.
[2026-05-25 09:08:44] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2026-05-25 09:08:44] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2026-05-25 09:08:44] [INFO ] Invariant cache hit.
[2026-05-25 09:08:44] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 396/475 variables, 79/123 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 195/318 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 322 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 396/475 variables, 79/127 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 195/322 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 392/714 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 716 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61114 ms. Remains : 79/79 places, 396/396 transitions.
Knowledge based reduction with 34 factoid took 787 ms. Reduced automaton from 13 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 780 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Knowledge-based reduction took 140435 ms.
Stuttering acceptance computed with spot in 726 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 259/259 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 259/259 (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-2522974589840012675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11838149510208201792.kers'
[2026-05-25 09:09:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2522974589840012675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11838149510208201792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 102 cols 1046 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:09:47] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11838149510208201792.kers
Total runtime 4 ms.
[2026-05-25 09:09:47] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 09:09:47] [INFO ] Invariant cache hit.
[2026-05-25 09:09:47] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-25 09:09:47] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-25 09:09:47] [INFO ] Invariant cache hit.
[2026-05-25 09:09:47] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 259/361 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 0/361 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 253 constraints, problems are : Problem set: 0 solved, 258 unsolved in 20423 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 259/361 variables, 102/140 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 117/257 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 258/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 519 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50544ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 50546ms
Finished structural reductions in LTL mode , in 1 iterations and 51032 ms. Remains : 102/102 places, 259/259 transitions.
Computed a total of 13 stabilizing places and 105 stable transitions
Graph (complete) has 603 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 105 stable transitions
Knowledge based reduction with 34 factoid took 310 ms. Reduced automaton from 13 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 43 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (3142 resets) in 386 ms. (103 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40004 steps (553 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (541 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (547 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (545 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (534 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (556 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (545 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (542 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (553 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (554 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (546 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (542 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (547 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (540 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
[2026-05-25 09:10:39] [INFO ] Invariant cache hit.
[2026-05-25 09:10:39] [INFO ] State equation strengthened by 117 read => feed constraints.
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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 40/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 13/100 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 258/358 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 117/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/361 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 239 constraints, problems are : Problem set: 0 solved, 14 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 40/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 13/100 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 258/358 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 117/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 3/361 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 257 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2969 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3477ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 9 properties in 1397 ms.
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 259/259 transitions.
Graph (complete) has 478 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 place count 100 transition count 257
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 95 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 43 place count 95 transition count 266
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 59 place count 95 transition count 425
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 99 place count 79 transition count 401
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 100 place count 79 transition count 400
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 79 transition count 400
Applied a total of 107 rules in 34 ms. Remains 79 /102 variables (removed 23) and now considering 400/259 (removed -141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 79/102 places, 400/259 transitions.
RANDOM walk for 40000 steps (5573 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1319 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1289 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1299 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1334 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1261 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 564556 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :1 out of 5
Probabilistic random walk after 564556 steps, saw 119979 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) 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-5559626128745916962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13869120812332952258.kers'
[2026-05-25 09:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5559626128745916962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13869120812332952258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 79 cols 2069 entries
Finished phase 1 with 55 SingleSign rule and 4 generalized
[2026-05-25 09:10:47] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13869120812332952258.kers
Total runtime 2 ms.
[2026-05-25 09:10:47] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 400/478 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/479 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 294 constraints, problems are : Problem set: 0 solved, 4 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 400/478 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 195/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/479 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 301 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1836ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 79/79 places, 400/400 transitions.
RANDOM walk for 40000 steps (5632 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1316 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1242 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1301 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1350 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 658761 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 4
Probabilistic random walk after 658761 steps, saw 138267 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-25 09:10:52] [INFO ] Invariant cache hit.
[2026-05-25 09:10:52] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 400/478 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/479 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/479 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 294 constraints, problems are : Problem set: 0 solved, 4 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 400/478 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 195/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/479 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 301 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1829ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 79/79 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2026-05-25 09:10:54] [INFO ] Invariant cache hit.
[2026-05-25 09:10:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:10:54] [INFO ] Invariant cache hit.
[2026-05-25 09:10:54] [INFO ] State equation strengthened by 195 read => feed constraints.
[2026-05-25 09:10:54] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2026-05-25 09:10:55] [INFO ] Redundant transitions in 2 ms returned []
Running 396 sub problems to find dead transitions.
[2026-05-25 09:10:55] [INFO ] Invariant cache hit.
[2026-05-25 09:10:55] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/44 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 400/479 variables, 79/125 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 195/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 320 constraints, problems are : Problem set: 4 solved, 392 unsolved in 28929 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 26/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 400/479 variables, 79/125 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 195/320 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 392/712 constraints. Problems are: Problem set: 4 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/713 constraints. Problems are: Problem set: 4 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 713 constraints, problems are : Problem set: 4 solved, 392 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/396 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59287ms problems are : Problem set: 4 solved, 392 unsolved
Search for dead transitions found 4 dead transitions in 59288ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/79 places, 396/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-25 09:11:54] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59929 ms. Remains : 79/79 places, 396/400 transitions.
RANDOM walk for 40000 steps (5569 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1313 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1226 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1281 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1315 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 635515 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 4
Probabilistic random walk after 635515 steps, saw 133739 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) 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-12534640994930672410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13202133944553299901.kers'
[2026-05-25 09:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12534640994930672410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13202133944553299901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 79 cols 2050 entries
Finished phase 1 with 55 SingleSign rule and 4 generalized
[2026-05-25 09:11:57] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13202133944553299901.kers
Total runtime 2 ms.
[2026-05-25 09:11:57] [INFO ] State equation strengthened by 195 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 396/474 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 195/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/475 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/475 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 294 constraints, problems are : Problem set: 0 solved, 4 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/78 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 396/474 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 195/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/475 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/475 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 301 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1779ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 396/396 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 79/79 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 396/396 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-25 09:11:59] [INFO ] Invariant cache hit.
[2026-05-25 09:11:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:11:59] [INFO ] Invariant cache hit.
[2026-05-25 09:11:59] [INFO ] State equation strengthened by 195 read => feed constraints.
[2026-05-25 09:12:00] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2026-05-25 09:12:00] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2026-05-25 09:12:00] [INFO ] Invariant cache hit.
[2026-05-25 09:12:00] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 396/475 variables, 79/123 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 195/318 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 322 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 396/475 variables, 79/127 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 195/322 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 392/714 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 716 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60953 ms. Remains : 79/79 places, 396/396 transitions.
Knowledge based reduction with 34 factoid took 546 ms. Reduced automaton from 13 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 833 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Knowledge-based reduction took 143572 ms.
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Stuttering acceptance computed with spot in 544 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Product exploration explored 100000 steps with 25032 reset in 445 ms.
Product exploration explored 100000 steps with 25004 reset in 361 ms.
Spot run failed in 90 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/ltsmin15971223698842966021
[2026-05-25 09:13:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15971223698842966021
Running compilation step : cd /tmp/ltsmin15971223698842966021;'/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 559 ms.
Running link step : cd /tmp/ltsmin15971223698842966021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin15971223698842966021;'/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/stateBased10002997620139198132.hoa' '--buchi-type=spotba'
LTSmin run took 10560 ms.
FORMULA MedleyA-PT-11-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-11-LTLCardinality-00 finished in 403651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X((!p0 U (p1||G(!p0)))) U G(p2))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 105 transition count 276
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 105 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 99 transition count 244
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 99 transition count 244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 97 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 97 transition count 236
Applied a total of 46 rules in 16 ms. Remains 97 /120 variables (removed 23) and now considering 236/308 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5940281862141429122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14699682931735182825.kers'
[2026-05-25 09:13:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5940281862141429122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14699682931735182825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 236 rows 97 cols 958 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:13:15] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14699682931735182825.kers
Total runtime 4 ms.
[2026-05-25 09:13:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 09:13:15] [INFO ] Invariant cache hit.
[2026-05-25 09:13:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-25 09:13:15] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2026-05-25 09:13:15] [INFO ] Invariant cache hit.
[2026-05-25 09:13:15] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 236/333 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 111/234 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 234 constraints, problems are : Problem set: 0 solved, 235 unsolved in 10090 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 236/333 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 111/234 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 235/469 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 471 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40174ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 40175ms
Starting structural reductions in LTL mode, iteration 1 : 97/120 places, 236/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40539 ms. Remains : 97/120 places, 236/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X((!p0 U (G(!p0)||p1))) U G(p2))))'
Stuttering acceptance computed with spot in 539 ms :[(NOT p2), false, (AND (NOT p0) (NOT p2)), false, (NOT p0), (AND p0 (NOT p1)), true, (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-01
Product exploration explored 100000 steps with 33425 reset in 371 ms.
Product exploration explored 100000 steps with 33289 reset in 361 ms.
Computed a total of 13 stabilizing places and 99 stable transitions
Graph (complete) has 562 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 99 stable transitions
Knowledge based reduction with 21 factoid took 121 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3127 resets) in 323 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (547 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (482 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (554 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (492 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (541 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (496 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (488 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (487 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (483 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (505 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (493 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (476 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (488 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 442923 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 13
Probabilistic random walk after 442923 steps, saw 88137 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-25 09:14:00] [INFO ] Invariant cache hit.
[2026-05-25 09:14:00] [INFO ] State equation strengthened by 111 read => feed constraints.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 56/83 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 235/330 variables, 95/115 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 111/226 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 3/333 variables, 2/228 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/333 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 228 constraints, problems are : Problem set: 2 solved, 11 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 56/83 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 235/330 variables, 95/115 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 111/226 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 1/227 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/227 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 3/333 variables, 2/229 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 10/239 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/333 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 239 constraints, problems are : Problem set: 2 solved, 11 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 337 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Graph (complete) has 440 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 91 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 35 place count 91 transition count 244
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 52 place count 91 transition count 417
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 88 place count 74 transition count 398
Applied a total of 88 rules in 16 ms. Remains 74 /97 variables (removed 23) and now considering 398/236 (removed -162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 74/97 places, 398/236 transitions.
RANDOM walk for 40000 steps (5530 resets) in 375 ms. (106 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (1235 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1168 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1197 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3465124394888565474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3249391952391095811.kers'
[2026-05-25 09:14:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3465124394888565474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3249391952391095811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 74 cols 2099 entries
Finished phase 1 with 50 SingleSign rule and 4 generalized
[2026-05-25 09:14:03] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3249391952391095811.kers
Total runtime 2 ms.
[2026-05-25 09:14:03] [INFO ] State equation strengthened by 199 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 398/471 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 199/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/472 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 398/471 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 199/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/472 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 296 constraints, problems are : Problem set: 0 solved, 3 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 74/74 places, 398/398 transitions.
RANDOM walk for 40000 steps (5566 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1230 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1172 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1202 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1193017 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :2 out of 3
Probabilistic random walk after 1193017 steps, saw 223046 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :2
[2026-05-25 09:14:07] [INFO ] Invariant cache hit.
[2026-05-25 09:14:07] [INFO ] State equation strengthened by 199 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 398/471 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 199/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/472 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 398/471 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 199/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/472 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 398/398 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 414
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 73 transition count 405
Applied a total of 11 rules in 23 ms. Remains 73 /74 variables (removed 1) and now considering 405/398 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 73/74 places, 405/398 transitions.
RANDOM walk for 40000 steps (5539 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1217 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1365628 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :0 out of 1
Probabilistic random walk after 1365628 steps, saw 243652 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) 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-5609736613741657816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6257560150399203535.kers'
[2026-05-25 09:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5609736613741657816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6257560150399203535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 73 cols 2148 entries
Finished phase 1 with 49 SingleSign rule and 4 generalized
[2026-05-25 09:14:10] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6257560150399203535.kers
Total runtime 3 ms.
[2026-05-25 09:14:10] [INFO ] State equation strengthened by 203 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 405/477 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 203/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/478 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/478 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 405/477 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 203/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/478 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/478 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 405/405 transitions.
Applied a total of 0 rules in 15 ms. Remains 73 /73 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 73/73 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 405/405 transitions.
Applied a total of 0 rules in 12 ms. Remains 73 /73 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2026-05-25 09:14:11] [INFO ] Invariant cache hit.
[2026-05-25 09:14:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:14:11] [INFO ] Invariant cache hit.
[2026-05-25 09:14:11] [INFO ] State equation strengthened by 203 read => feed constraints.
[2026-05-25 09:14:11] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2026-05-25 09:14:12] [INFO ] Redundant transitions in 5 ms returned []
Running 401 sub problems to find dead transitions.
[2026-05-25 09:14:12] [INFO ] Invariant cache hit.
[2026-05-25 09:14:12] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 405/478 variables, 73/99 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 203/302 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 304 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 405/478 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 203/304 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 401/705 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 705 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60967 ms. Remains : 73/73 places, 405/405 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 444 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 65 transition count 368
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 1 with 2 rules applied. Total rules applied 40 place count 64 transition count 367
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 41 place count 64 transition count 366
Free-agglomeration rule (complex) applied 4 times with reduction of 54 identical transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 64 transition count 413
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 60 transition count 413
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 60 transition count 413
Applied a total of 61 rules in 27 ms. Remains 60 /73 variables (removed 13) and now considering 413/405 (removed -8) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3057051793456291274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8471467538638691808.kers'
[2026-05-25 09:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3057051793456291274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8471467538638691808.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 60 cols 2096 entries
Finished phase 1 with 41 SingleSign rule and 5 generalized
[2026-05-25 09:15:12] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8471467538638691808.kers
Total runtime 2 ms.
[2026-05-25 09:15:12] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 09:15:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 09:15:12] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-25 09:15:12] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 09:15:12] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 09:15:12] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
Found 2 invariant AP formulas.
Negative knowledge disproves property using: (G (AND (OR p0 p2) (OR (NOT p1) p2)))
Knowledge based reduction with 23 factoid took 37 ms. Proved property starting from automaton with 11 states, 29 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 75848 ms.
FORMULA MedleyA-PT-11-LTLCardinality-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLCardinality-01 finished in 117711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U X(X(p2)))||X(G(p0))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 104 transition count 276
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 104 transition count 276
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 97 transition count 240
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 97 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 95 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 95 transition count 232
Applied a total of 50 rules in 2 ms. Remains 95 /120 variables (removed 25) and now considering 232/308 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10770774856266923413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18089476124642808024.kers'
[2026-05-25 09:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10770774856266923413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18089476124642808024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 95 cols 946 entries
Finished phase 1 with 71 SingleSign rule and 4 generalized
[2026-05-25 09:15:12] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18089476124642808024.kers
Total runtime 1 ms.
[2026-05-25 09:15:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:15:12] [INFO ] Invariant cache hit.
[2026-05-25 09:15:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 09:15:13] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-25 09:15:13] [INFO ] Invariant cache hit.
[2026-05-25 09:15:13] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/327 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 110/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 231 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/327 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 110/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 231/462 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 463 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41143ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 41143ms
Starting structural reductions in LTL mode, iteration 1 : 95/120 places, 232/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41512 ms. Remains : 95/120 places, 232/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U X(X(p2)))||X(G(p0))))'
Stuttering acceptance computed with spot in 522 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-02
Product exploration explored 100000 steps with 7827 reset in 216 ms.
Product exploration explored 100000 steps with 7787 reset in 230 ms.
Computed a total of 12 stabilizing places and 97 stable transitions
Graph (complete) has 553 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 97 stable transitions
Knowledge based reduction with 18 factoid took 76 ms. Reduced automaton from 17 states, 50 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3143 resets) in 199 ms. (200 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (542 resets) in 60 ms. (655 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (538 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (547 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (556 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (540 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (541 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (549 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
[2026-05-25 09:15:55] [INFO ] Invariant cache hit.
[2026-05-25 09:15:55] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/80 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/93 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 231/324 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 110/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/327 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/327 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 225 constraints, problems are : Problem set: 0 solved, 6 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/80 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/93 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 231/324 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 110/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/327 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 232 constraints, problems are : Problem set: 0 solved, 6 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1163ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 341 ms.
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 232/232 transitions.
Graph (complete) has 432 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 place count 93 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 88 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 37 place count 88 transition count 239
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 54 place count 88 transition count 407
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 98 place count 71 transition count 380
Applied a total of 98 rules in 19 ms. Remains 71 /95 variables (removed 24) and now considering 380/232 (removed -148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 71/95 places, 380/232 transitions.
RANDOM walk for 40000 steps (6393 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1341 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1329 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1319 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 82462 steps, run visited all 3 properties in 445 ms. (steps per millisecond=185 )
Probabilistic random walk after 82462 steps, saw 19155 distinct states, run finished after 446 ms. (steps per millisecond=184 ) properties seen :3
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 18 factoid took 132 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 2580 ms.
FORMULA MedleyA-PT-11-LTLCardinality-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLCardinality-02 finished in 45111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Graph (complete) has 695 edges and 120 vertex of which 118 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 100 transition count 266
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 100 transition count 266
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 43 place count 92 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 51 place count 92 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 54 place count 89 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 89 transition count 213
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 65 place count 85 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 77 place count 85 transition count 206
Applied a total of 77 rules in 18 ms. Remains 85 /120 variables (removed 35) and now considering 206/308 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9189303036897503732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10228276285815603200.kers'
[2026-05-25 09:15:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9189303036897503732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10228276285815603200.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 85 cols 837 entries
Finished phase 1 with 61 SingleSign rule and 4 generalized
[2026-05-25 09:15:57] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10228276285815603200.kers
Total runtime 1 ms.
[2026-05-25 09:15:57] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 09:15:57] [INFO ] Invariant cache hit.
[2026-05-25 09:15:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:15:58] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2026-05-25 09:15:58] [INFO ] Redundant transitions in 1 ms returned []
Running 197 sub problems to find dead transitions.
[2026-05-25 09:15:58] [INFO ] Invariant cache hit.
[2026-05-25 09:15:58] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 145 constraints, problems are : Problem set: 0 solved, 197 unsolved in 11256 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 197/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 344 constraints, problems are : Problem set: 0 solved, 197 unsolved in 24117 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35429ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 35429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/120 places, 206/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35740 ms. Remains : 85/120 places, 206/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-03
Product exploration explored 100000 steps with 9756 reset in 128 ms.
Product exploration explored 100000 steps with 9783 reset in 137 ms.
Computed a total of 10 stabilizing places and 90 stable transitions
Computed a total of 10 stabilizing places and 90 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2708 steps (263 resets) in 9 ms. (270 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 231 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 206/206 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2026-05-25 09:16:34] [INFO ] Invariant cache hit.
[2026-05-25 09:16:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:16:34] [INFO ] Invariant cache hit.
[2026-05-25 09:16:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:16:34] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2026-05-25 09:16:34] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 85/85 places, 206/206 transitions.
Computed a total of 10 stabilizing places and 90 stable transitions
Computed a total of 10 stabilizing places and 90 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1469 steps (140 resets) in 9 ms. (146 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 208 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9783 reset in 123 ms.
Product exploration explored 100000 steps with 9726 reset in 153 ms.
Built C files in :
/tmp/ltsmin15628264714664583712
[2026-05-25 09:16:35] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2026-05-25 09:16:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:35] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2026-05-25 09:16:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:35] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2026-05-25 09:16:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:35] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15628264714664583712
Running compilation step : cd /tmp/ltsmin15628264714664583712;'/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 472 ms.
Running link step : cd /tmp/ltsmin15628264714664583712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15628264714664583712;'/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/stateBased6385741869459584604.hoa' '--buchi-type=spotba'
LTSmin run took 1471 ms.
FORMULA MedleyA-PT-11-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-11-LTLCardinality-03 finished in 39375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U !(X((X(p1) U p1)) U (p0 U p1))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 105 transition count 275
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 105 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 99 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 99 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 96 transition count 230
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 96 transition count 230
Applied a total of 48 rules in 2 ms. Remains 96 /120 variables (removed 24) and now considering 230/308 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4534264346808603573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3744465403384927759.kers'
[2026-05-25 09:16:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4534264346808603573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3744465403384927759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 96 cols 931 entries
Finished phase 1 with 72 SingleSign rule and 4 generalized
[2026-05-25 09:16:37] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3744465403384927759.kers
Total runtime 3 ms.
[2026-05-25 09:16:37] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:16:37] [INFO ] Invariant cache hit.
[2026-05-25 09:16:37] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-25 09:16:37] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-25 09:16:37] [INFO ] Invariant cache hit.
[2026-05-25 09:16:37] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 230/326 variables, 96/119 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 109/228 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 228 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 230/326 variables, 96/119 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 109/228 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 229/457 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 460 constraints, problems are : Problem set: 0 solved, 229 unsolved in 25887 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35053ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 35055ms
Starting structural reductions in LTL mode, iteration 1 : 96/120 places, 230/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35353 ms. Remains : 96/120 places, 230/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U !(X((X(p1) U p1)) U (p0 U p1))))'
Stuttering acceptance computed with spot in 225 ms :[p1, (NOT p0), p1, p1, (NOT p0), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-04 finished in 35642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 103 transition count 273
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 103 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 96 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 96 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 93 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 93 transition count 224
Applied a total of 54 rules in 2 ms. Remains 93 /120 variables (removed 27) and now considering 224/308 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3003324105342773817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13584833504034445909.kers'
[2026-05-25 09:17:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3003324105342773817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13584833504034445909.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 93 cols 916 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:17:12] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13584833504034445909.kers
Total runtime 2 ms.
[2026-05-25 09:17:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 09:17:12] [INFO ] Invariant cache hit.
[2026-05-25 09:17:13] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:17:13] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:17:13] [INFO ] Invariant cache hit.
[2026-05-25 09:17:13] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 225 constraints, problems are : Problem set: 0 solved, 223 unsolved in 9062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 223/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39145ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 39146ms
Starting structural reductions in LTL mode, iteration 1 : 93/120 places, 224/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39507 ms. Remains : 93/120 places, 224/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-06 finished in 39645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 102 transition count 268
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 102 transition count 268
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 94 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 94 transition count 227
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 91 transition count 215
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 91 transition count 215
Applied a total of 58 rules in 3 ms. Remains 91 /120 variables (removed 29) and now considering 215/308 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6344559998929146997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13090700096649268324.kers'
[2026-05-25 09:17:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6344559998929146997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13090700096649268324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 91 cols 882 entries
Finished phase 1 with 67 SingleSign rule and 4 generalized
[2026-05-25 09:17:52] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13090700096649268324.kers
Total runtime 2 ms.
[2026-05-25 09:17:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:17:52] [INFO ] Invariant cache hit.
[2026-05-25 09:17:52] [INFO ] State equation strengthened by 105 read => feed constraints.
[2026-05-25 09:17:52] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-25 09:17:52] [INFO ] Invariant cache hit.
[2026-05-25 09:17:52] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9302 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 433 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21114 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30458ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 30459ms
Starting structural reductions in LTL mode, iteration 1 : 91/120 places, 215/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30708 ms. Remains : 91/120 places, 215/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-12 finished in 30816 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 U p1)||X(p2))))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 105 transition count 272
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 105 transition count 272
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 96 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 96 transition count 228
Applied a total of 48 rules in 5 ms. Remains 96 /120 variables (removed 24) and now considering 228/308 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-486805791686198247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2912891510221102002.kers'
[2026-05-25 09:18:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-486805791686198247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2912891510221102002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 96 cols 928 entries
Finished phase 1 with 72 SingleSign rule and 4 generalized
[2026-05-25 09:18:23] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2912891510221102002.kers
Total runtime 2 ms.
[2026-05-25 09:18:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 09:18:23] [INFO ] Invariant cache hit.
[2026-05-25 09:18:23] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:18:23] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-25 09:18:23] [INFO ] Invariant cache hit.
[2026-05-25 09:18:23] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 228 constraints, problems are : Problem set: 0 solved, 227 unsolved in 10863 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 227/455 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/324 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 458 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40925ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 40925ms
Starting structural reductions in LTL mode, iteration 1 : 96/120 places, 228/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41168 ms. Remains : 96/120 places, 228/308 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 U p1)||X(p2))))'
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-13
Product exploration explored 100000 steps with 7850 reset in 229 ms.
Product exploration explored 100000 steps with 7833 reset in 228 ms.
Computed a total of 14 stabilizing places and 97 stable transitions
Graph (complete) has 549 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 97 stable transitions
Knowledge based reduction with 10 factoid took 105 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3102 resets) in 338 ms. (117 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (546 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (545 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (548 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (546 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (548 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (541 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
[2026-05-25 09:19:05] [INFO ] Invariant cache hit.
[2026-05-25 09:19:05] [INFO ] State equation strengthened by 108 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) 36/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/94 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 227/321 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/324 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 224 constraints, problems are : Problem set: 0 solved, 6 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 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) 36/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/94 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 227/321 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 108/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/324 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/324 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 233 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1381ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 203 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 228/228 transitions.
Graph (complete) has 429 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 place count 94 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 89 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 89 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 37 place count 88 transition count 245
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 50 place count 88 transition count 317
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 75 transition count 305
Applied a total of 75 rules in 14 ms. Remains 75 /96 variables (removed 21) and now considering 305/228 (removed -77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 75/96 places, 305/228 transitions.
RANDOM walk for 40000 steps (7455 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1443 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1419 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1047333 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 2
Probabilistic random walk after 1047333 steps, saw 197122 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) 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-7043214848475199644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14797544999945252888.kers'
[2026-05-25 09:19:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7043214848475199644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14797544999945252888.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 305 rows 75 cols 1559 entries
Finished phase 1 with 51 SingleSign rule and 4 generalized
[2026-05-25 09:19:10] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14797544999945252888.kers
Total runtime 2 ms.
[2026-05-25 09:19:10] [INFO ] State equation strengthened by 155 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/74 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/379 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 155/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 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) 29/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/74 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/379 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 155/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/380 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 823ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 305/305 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 75/75 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 305/305 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2026-05-25 09:19:11] [INFO ] Invariant cache hit.
[2026-05-25 09:19:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:19:11] [INFO ] Invariant cache hit.
[2026-05-25 09:19:11] [INFO ] State equation strengthened by 155 read => feed constraints.
[2026-05-25 09:19:11] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2026-05-25 09:19:11] [INFO ] Redundant transitions in 3 ms returned []
Running 297 sub problems to find dead transitions.
[2026-05-25 09:19:11] [INFO ] Invariant cache hit.
[2026-05-25 09:19:11] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 305/380 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 155/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 262 constraints, problems are : Problem set: 0 solved, 297 unsolved in 19896 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 305/380 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 155/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 297/559 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 560 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50122ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 50123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50565 ms. Remains : 75/75 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 404 edges and 75 vertex of which 68 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 68 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 68 transition count 282
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 68 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 67 transition count 281
Free-agglomeration rule (complex) applied 4 times with reduction of 31 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 67 transition count 314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 63 transition count 314
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 63 transition count 314
Applied a total of 46 rules in 42 ms. Remains 63 /75 variables (removed 12) and now considering 314/305 (removed -9) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8010091274162815991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18147736179602802576.kers'
[2026-05-25 09:20:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8010091274162815991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18147736179602802576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 63 cols 1564 entries
Finished phase 1 with 43 SingleSign rule and 6 generalized
[2026-05-25 09:20:01] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18147736179602802576.kers
Total runtime 3 ms.
[2026-05-25 09:20:01] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 09:20:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 09:20:01] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 09:20:01] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 09:20:01] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 09:20:02] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
Knowledge based reduction with 10 factoid took 163 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Knowledge-based reduction took 57355 ms.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 228/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 228/228 (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-2391271722049911398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6419847732211740604.kers'
[2026-05-25 09:20:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2391271722049911398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6419847732211740604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 96 cols 928 entries
Finished phase 1 with 72 SingleSign rule and 4 generalized
[2026-05-25 09:20:02] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6419847732211740604.kers
Total runtime 2 ms.
[2026-05-25 09:20:02] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 09:20:02] [INFO ] Invariant cache hit.
[2026-05-25 09:20:02] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:20:03] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-25 09:20:03] [INFO ] Invariant cache hit.
[2026-05-25 09:20:03] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 228 constraints, problems are : Problem set: 0 solved, 227 unsolved in 11272 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 227/455 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/324 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 458 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41364ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 41366ms
Finished structural reductions in LTL mode , in 1 iterations and 41711 ms. Remains : 96/96 places, 228/228 transitions.
Computed a total of 14 stabilizing places and 97 stable transitions
Graph (complete) has 549 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 97 stable transitions
Knowledge based reduction with 10 factoid took 59 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3135 resets) in 312 ms. (127 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (547 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (558 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (551 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (546 resets) in 43 ms. (909 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (555 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
[2026-05-25 09:20:44] [INFO ] Invariant cache hit.
[2026-05-25 09:20:44] [INFO ] State equation strengthened by 108 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/94 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 227/321 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/324 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 224 constraints, problems are : Problem set: 0 solved, 5 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/94 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 227/321 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 108/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/324 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/324 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 231 constraints, problems are : Problem set: 0 solved, 5 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 240 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 228/228 transitions.
Graph (complete) has 429 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 place count 94 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 89 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 89 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 37 place count 88 transition count 245
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 50 place count 88 transition count 317
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 75 transition count 305
Applied a total of 75 rules in 14 ms. Remains 75 /96 variables (removed 21) and now considering 305/228 (removed -77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 75/96 places, 305/228 transitions.
RANDOM walk for 40000 steps (7499 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1430 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1395 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1062199 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 2
Probabilistic random walk after 1062199 steps, saw 200378 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) 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-7563207729499230273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12758638609815553259.kers'
[2026-05-25 09:20:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7563207729499230273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12758638609815553259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 305 rows 75 cols 1559 entries
Finished phase 1 with 51 SingleSign rule and 4 generalized
[2026-05-25 09:20:49] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12758638609815553259.kers
Total runtime 1 ms.
[2026-05-25 09:20:49] [INFO ] State equation strengthened by 155 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/74 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/379 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 155/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 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) 29/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/74 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/379 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 155/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/380 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 305/305 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 75/75 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2026-05-25 09:20:50] [INFO ] Invariant cache hit.
[2026-05-25 09:20:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:20:50] [INFO ] Invariant cache hit.
[2026-05-25 09:20:50] [INFO ] State equation strengthened by 155 read => feed constraints.
[2026-05-25 09:20:50] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2026-05-25 09:20:50] [INFO ] Redundant transitions in 3 ms returned []
Running 297 sub problems to find dead transitions.
[2026-05-25 09:20:50] [INFO ] Invariant cache hit.
[2026-05-25 09:20:50] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 305/380 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 155/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 262 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18274 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 305/380 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 155/262 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 297/559 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 560 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48492ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 48493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48901 ms. Remains : 75/75 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 404 edges and 75 vertex of which 68 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 68 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 68 transition count 282
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 68 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 67 transition count 281
Free-agglomeration rule (complex) applied 4 times with reduction of 31 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 67 transition count 314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 63 transition count 314
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 63 transition count 314
Applied a total of 46 rules in 16 ms. Remains 63 /75 variables (removed 12) and now considering 314/305 (removed -9) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-879482866644751698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9734946636911328042.kers'
[2026-05-25 09:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-879482866644751698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9734946636911328042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 63 cols 1564 entries
Finished phase 1 with 43 SingleSign rule and 6 generalized
[2026-05-25 09:21:38] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9734946636911328042.kers
Total runtime 1 ms.
[2026-05-25 09:21:38] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 09:21:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 09:21:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 09:21:39] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 09:21:39] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 09:21:39] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Knowledge-based reduction took 55062 ms.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Product exploration explored 100000 steps with 7855 reset in 237 ms.
Product exploration explored 100000 steps with 7853 reset in 240 ms.
Spot run failed in 75 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/ltsmin13860868759007379560
[2026-05-25 09:21:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13860868759007379560
Running compilation step : cd /tmp/ltsmin13860868759007379560;'/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 344 ms.
Running link step : cd /tmp/ltsmin13860868759007379560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13860868759007379560;'/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/stateBased4588441906341657059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 228/228 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 228/228 (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-423778581980780958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18418668655829817549.kers'
[2026-05-25 09:21:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-423778581980780958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18418668655829817549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 96 cols 928 entries
Finished phase 1 with 72 SingleSign rule and 4 generalized
[2026-05-25 09:21:55] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18418668655829817549.kers
Total runtime 1 ms.
[2026-05-25 09:21:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:21:55] [INFO ] Invariant cache hit.
[2026-05-25 09:21:55] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:21:55] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-25 09:21:55] [INFO ] Invariant cache hit.
[2026-05-25 09:21:55] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 228 constraints, problems are : Problem set: 0 solved, 227 unsolved in 10506 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/324 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 227/455 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/324 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 458 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40592ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 40593ms
Finished structural reductions in LTL mode , in 1 iterations and 40893 ms. Remains : 96/96 places, 228/228 transitions.
Built C files in :
/tmp/ltsmin1717617638181523597
[2026-05-25 09:22:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1717617638181523597
Running compilation step : cd /tmp/ltsmin1717617638181523597;'/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 426 ms.
Running link step : cd /tmp/ltsmin1717617638181523597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1717617638181523597;'/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/stateBased16454952436409064727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:22:51] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:22:51] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:22:51] [INFO ] Time to serialize gal into /tmp/LTL6513963199940653444.gal : 3 ms
[2026-05-25 09:22:51] [INFO ] Time to serialize properties into /tmp/LTL5159637055501713087.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6513963199940653444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15786187652786129930.hoa' '-atoms' '/tmp/LTL5159637055501713087.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/LTL5159637055501713087.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15786187652786129930.hoa
Detected timeout of ITS tools.
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:23:06] [INFO ] Time to serialize gal into /tmp/LTL15379625805645864986.gal : 3 ms
[2026-05-25 09:23:06] [INFO ] Time to serialize properties into /tmp/LTL7438681960448261624.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15379625805645864986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7438681960448261624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("((p6==0)||(p123==1))")U("((p60==0)||(p45==1))"))||(X("((p23==0)||(p68==1))")))))
Formula 0 simplified : F((!"((p6==0)||(p123==1))" R !"((p60==0)||(p45==1))") & X!"((p23==0)||(p68==1))")
Detected timeout of ITS tools.
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:23:21] [INFO ] Applying decomposition
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 9 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/graph17810006559263447946.txt' '-o' '/tmp/graph17810006559263447946.bin' '-w' '/tmp/graph17810006559263447946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17810006559263447946.bin' '-l' '-1' '-v' '-w' '/tmp/graph17810006559263447946.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:21] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:21] [INFO ] Removed a total of 451 redundant transitions.
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 90 ms
[2026-05-25 09:23:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 9 ms.
[2026-05-25 09:23:22] [INFO ] Time to serialize gal into /tmp/LTL6660097285369646512.gal : 3 ms
[2026-05-25 09:23:22] [INFO ] Time to serialize properties into /tmp/LTL2596073841008087563.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/LTL6660097285369646512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2596073841008087563.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((("((i0.i1.u7.p6==0)||(i3.u21.p123==1))")U("((i1.u9.p60==0)||(i1.u8.p45==1))"))||(X("((i0.i0.u4.p23==0)||(i1.u12.p68==1))")))))
Formula 0 simplified : F((!"((i0.i1.u7.p6==0)||(i3.u21.p123==1))" R !"((i1.u9.p60==0)||(i1.u8.p45==1))") & X!"((i0.i0.u4.p23==0)||(i1.u12.p68==1))")
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-11-LTLCardinality-13 finished in 313756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 308/308 transitions.
Graph (complete) has 695 edges and 120 vertex of which 118 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 100 transition count 266
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 100 transition count 266
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 43 place count 92 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 51 place count 92 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 90 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 90 transition count 217
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 63 place count 86 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 75 place count 86 transition count 210
Applied a total of 75 rules in 10 ms. Remains 86 /120 variables (removed 34) and now considering 210/308 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3065600887220819230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18084022533300303643.kers'
[2026-05-25 09:23:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3065600887220819230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18084022533300303643.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 86 cols 847 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:23:37] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18084022533300303643.kers
Total runtime 1 ms.
[2026-05-25 09:23:37] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 09:23:37] [INFO ] Invariant cache hit.
[2026-05-25 09:23:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:23:37] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2026-05-25 09:23:37] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2026-05-25 09:23:37] [INFO ] Invariant cache hit.
[2026-05-25 09:23:37] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 210/296 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 147 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11494 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 210/296 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 201/348 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 348 constraints, problems are : Problem set: 0 solved, 201 unsolved in 12333 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23867ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 23867ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/120 places, 210/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24238 ms. Remains : 86/120 places, 210/308 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-14 finished in 24332 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 U p1)||X(p2))))'
Spot run failed in 60 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-25 09:24:01] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin732288850177220271
[2026-05-25 09:24:01] [INFO ] Computing symmetric may disable matrix : 308 transitions.
[2026-05-25 09:24:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:01] [INFO ] Computing symmetric may enable matrix : 308 transitions.
[2026-05-25 09:24:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:01] [INFO ] Applying decomposition
[2026-05-25 09:24:01] [INFO ] Computing Do-Not-Accords matrix : 308 transitions.
[2026-05-25 09:24:01] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:24:01] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:01] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin732288850177220271
Running compilation step : cd /tmp/ltsmin732288850177220271;'/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'
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/graph10763015087296684399.txt' '-o' '/tmp/graph10763015087296684399.bin' '-w' '/tmp/graph10763015087296684399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10763015087296684399.bin' '-l' '-1' '-v' '-w' '/tmp/graph10763015087296684399.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:24:01] [INFO ] Decomposing Gal with order
[2026-05-25 09:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:24:01] [INFO ] Removed a total of 471 redundant transitions.
[2026-05-25 09:24:01] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 6 ms.
[2026-05-25 09:24:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality16198268997675255991.gal : 3 ms
[2026-05-25 09:24:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality17088818666012333302.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/LTLCardinality16198268997675255991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17088818666012333302.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((("((i0.u5.p6==0)||(i7.u19.p123==1))")U("((u8.p60==0)||(i4.u7.p45==1))"))||(X("((i0.u3.p23==0)||(i4.u11.p68==1))")))))
Formula 0 simplified : F((!"((i0.u5.p6==0)||(i7.u19.p123==1))" R !"((u8.p60==0)||(i4.u7.p45==1))") & X!"((i0.u3.p23==0)||(i4.u11.p68==1))")
Compilation finished in 690 ms.
Running link step : cd /tmp/ltsmin732288850177220271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin732288850177220271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((((LTLAPp0==true) U (LTLAPp1==true))||X((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t30, t60, t95, t103, t131, t132, t134, t135, t136, t139, t142, t143, t144, t145, t146, t147, ...1594
Computing Next relation with stutter on 4428 deadlock states
Detected timeout of ITS tools.
[2026-05-25 09:50:26] [INFO ] Applying decomposition
[2026-05-25 09:50:26] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:50:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:50:26] [INFO ] Removed a total of 611 redundant transitions.
[2026-05-25 09:50:26] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2026-05-25 09:50:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality9329854409440748389.gal : 3 ms
[2026-05-25 09:50:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality5994636722724378662.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/LTLCardinality9329854409440748389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5994636722724378662.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((("((u1.p6==0)||(i5.u24.p123==1))")U("((i3.i0.u12.p60==0)||(u9.p45==1))"))||(X("((i1.i0.u6.p23==0)||(i3.i0.u15.p68==1))")))))
Formula 0 simplified : F((!"((u1.p6==0)||(i5.u24.p123==1))" R !"((i3.i0.u12.p60==0)||(u9.p45==1))") & X!"((i1.i0.u6.p23==0)||(i3.i0.u15.p68==1))")

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="MedleyA-PT-11"
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 MedleyA-PT-11, 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 r178-oct2-177969019900179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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