About the Execution of ITS-Tools for BusinessProcesses-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 990.220 | 583024.00 | 690920.00 | 5459.00 | TTTFFFFFFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 BusinessProcesses-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 9.7K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 104K 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 BusinessProcesses-PT-09-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779615829922
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 09:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 09:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:43:51] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-24 09:43:51] [INFO ] Transformed 403 places.
[2026-05-24 09:43:51] [INFO ] Transformed 374 transitions.
[2026-05-24 09:43:51] [INFO ] Found NUPN structural information;
[2026-05-24 09:43:51] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-09-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 55 place count 348 transition count 320
Iterating global reduction 1 with 54 rules applied. Total rules applied 109 place count 348 transition count 320
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 131 place count 326 transition count 298
Iterating global reduction 1 with 22 rules applied. Total rules applied 153 place count 326 transition count 298
Applied a total of 153 rules in 154 ms. Remains 326 /403 variables (removed 77) and now considering 298/374 (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-16563700263700936277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17764648792784399932.kers'
[2026-05-24 09:43:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16563700263700936277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17764648792784399932.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 326 cols 995 entries
Finished phase 1 with 213 SingleSign rule and 49 generalized
[2026-05-24 09:43:51] [INFO ] Computed 64 invariants in 2 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17764648792784399932.kers
Total runtime 3 ms.
[2026-05-24 09:43:52] [INFO ] Implicit Places using invariants in 540 ms returned []
[2026-05-24 09:43:52] [INFO ] Invariant cache hit.
[2026-05-24 09:43:52] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2026-05-24 09:43:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/124 constraints. Problems are: Problem set: 2 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 295 unsolved
Problem TDEAD268 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 20/164 constraints. Problems are: Problem set: 3 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 20/184 constraints. Problems are: Problem set: 3 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 20/204 constraints. Problems are: Problem set: 3 solved, 294 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 3 solved, 294 unsolved
Search for dead transitions found 3 dead transitions in 30135ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 326/403 places, 295/374 transitions.
Applied a total of 0 rules in 13 ms. Remains 326 /326 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31547 ms. Remains : 326/403 places, 295/374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 326/326 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 326 /326 variables (removed 0) and now considering 295/295 (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-3084614481836714617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11077595369395592870.kers'
[2026-05-24 09:44:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3084614481836714617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11077595369395592870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 326 cols 977 entries
Finished phase 1 with 213 SingleSign rule and 49 generalized
[2026-05-24 09:44:23] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11077595369395592870.kers
Total runtime 2 ms.
[2026-05-24 09:44:23] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-24 09:44:23] [INFO ] Invariant cache hit.
[2026-05-24 09:44:23] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-24 09:44:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/124 constraints. Problems are: Problem set: 9 solved, 285 unsolved
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/144 constraints. Problems are: Problem set: 16 solved, 278 unsolved
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 20/164 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 20/184 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 20/204 constraints. Problems are: Problem set: 19 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/621 variables, and 204 constraints, problems are : Problem set: 19 solved, 275 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/326 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/15 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 46/61 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 3/64 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 140/204 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/224 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/244 constraints. Problems are: Problem set: 19 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/264 constraints. Problems are: Problem set: 19 solved, 275 unsolved
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 20/284 constraints. Problems are: Problem set: 30 solved, 264 unsolved
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 20/304 constraints. Problems are: Problem set: 32 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 20/324 constraints. Problems are: Problem set: 32 solved, 262 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 20/344 constraints. Problems are: Problem set: 32 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/621 variables, and 348 constraints, problems are : Problem set: 32 solved, 262 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/326 constraints, PredecessorRefiner: 0/294 constraints, Known Traps: 284/284 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 32 solved, 262 unsolved
Search for dead transitions found 32 dead transitions in 60085ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 326/326 places, 263/295 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 323 transition count 263
Applied a total of 3 rules in 10 ms. Remains 323 /326 variables (removed 3) and now considering 263/263 (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-14325871588511699062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15035525869150161073.kers'
[2026-05-24 09:45:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14325871588511699062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15035525869150161073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 323 cols 779 entries
Finished phase 1 with 214 SingleSign rule and 40 generalized
[2026-05-24 09:45:23] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15035525869150161073.kers
Total runtime 1 ms.
[2026-05-24 09:45:23] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-24 09:45:23] [INFO ] Invariant cache hit.
[2026-05-24 09:45:24] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 323/326 places, 263/295 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61059 ms. Remains : 323/326 places, 263/295 transitions.
Support contains 41 out of 323 places after structural reductions.
[2026-05-24 09:45:24] [INFO ] Flatten gal took : 42 ms
[2026-05-24 09:45:24] [INFO ] Flatten gal took : 18 ms
[2026-05-24 09:45:24] [INFO ] Input system was already deterministic with 263 transitions.
RANDOM walk for 40000 steps (415 resets) in 1350 ms. (29 steps per ms) remains 11/32 properties
BEST_FIRST walk for 40004 steps (79 resets) in 244 ms. (163 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (70 resets) in 90 ms. (439 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
[2026-05-24 09:45:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 186/251 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 5 (OVERLAPS) 69/320 variables, 24/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 261/581 variables, 320/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/586 variables, 3/392 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/392 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/586 variables, 0/392 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 392 constraints, problems are : Problem set: 2 solved, 2 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 196/250 variables, 41/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 3/48 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 6 (OVERLAPS) 70/320 variables, 24/72 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 320/586 variables, and 75 constraints, problems are : Problem set: 4 solved, 0 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 798ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
Computed a total of 193 stabilizing places and 163 stable transitions
Graph (complete) has 676 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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||X(X(G(p1)))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 316 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 316 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 314 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 314 transition count 254
Applied a total of 18 rules in 18 ms. Remains 314 /323 variables (removed 9) and now considering 254/263 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2031857859409747384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4182423732265153155.kers'
[2026-05-24 09:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2031857859409747384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4182423732265153155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 314 cols 761 entries
Finished phase 1 with 205 SingleSign rule and 40 generalized
[2026-05-24 09:45:26] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4182423732265153155.kers
Total runtime 2 ms.
[2026-05-24 09:45:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-24 09:45:26] [INFO ] Invariant cache hit.
[2026-05-24 09:45:26] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-24 09:45:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD227 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/109 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/149 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 15/184 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 20/204 constraints. Problems are: Problem set: 1 solved, 252 unsolved
SMT process timed out in 30043ms, After SMT, problems are : Problem set: 1 solved, 252 unsolved
Search for dead transitions found 1 dead transitions in 30045ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 314/323 places, 253/263 transitions.
Applied a total of 0 rules in 14 ms. Remains 314 /314 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30495 ms. Remains : 314/323 places, 253/263 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||X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-00
Product exploration explored 100000 steps with 1044 reset in 238 ms.
Product exploration explored 100000 steps with 1034 reset in 207 ms.
Computed a total of 186 stabilizing places and 155 stable transitions
Graph (complete) has 661 edges and 314 vertex of which 313 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 186 stabilizing places and 155 stable transitions
Detected a total of 186/314 stabilizing places and 155/253 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 62 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 166 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 342 ms.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 314 /314 variables (removed 0) and now considering 253/253 (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-16612423760762029305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1961988596556857277.kers'
[2026-05-24 09:45:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16612423760762029305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1961988596556857277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 314 cols 755 entries
Finished phase 1 with 205 SingleSign rule and 39 generalized
[2026-05-24 09:45:58] [INFO ] Computed 70 invariants in 2 ms
Computed 70 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1961988596556857277.kers
Total runtime 3 ms.
[2026-05-24 09:45:58] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-24 09:45:58] [INFO ] Invariant cache hit.
[2026-05-24 09:45:58] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 09:45:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 15/213 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/567 variables, and 213 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/314 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 143/143 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 143/213 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 17/279 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/567 variables, and 309 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/314 constraints, PredecessorRefiner: 0/252 constraints, Known Traps: 239/239 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 314/314 places, 253/253 transitions.
Computed a total of 186 stabilizing places and 155 stable transitions
Graph (complete) has 661 edges and 314 vertex of which 313 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 186 stabilizing places and 155 stable transitions
Detected a total of 186/314 stabilizing places and 155/253 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 51 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 232 steps (0 resets) in 8 ms. (25 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 324 ms.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1055 reset in 154 ms.
Product exploration explored 100000 steps with 1049 reset in 163 ms.
Spot run failed in 72 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/ltsmin973880037113319084
[2026-05-24 09:46:59] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin973880037113319084
Running compilation step : cd /tmp/ltsmin973880037113319084;'/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 482 ms.
Running link step : cd /tmp/ltsmin973880037113319084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin973880037113319084;'/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/stateBased377287934074548720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 314 /314 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-24 09:47:14] [INFO ] Invariant cache hit.
[2026-05-24 09:47:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-24 09:47:14] [INFO ] Invariant cache hit.
[2026-05-24 09:47:15] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 314/314 places, 253/253 transitions.
Built C files in :
/tmp/ltsmin5221291700735428952
[2026-05-24 09:47:15] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5221291700735428952
Running compilation step : cd /tmp/ltsmin5221291700735428952;'/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 401 ms.
Running link step : cd /tmp/ltsmin5221291700735428952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5221291700735428952;'/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/stateBased10465262134323703659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 09:47:30] [INFO ] Flatten gal took : 14 ms
[2026-05-24 09:47:30] [INFO ] Flatten gal took : 13 ms
[2026-05-24 09:47:30] [INFO ] Time to serialize gal into /tmp/LTL5231595148551390983.gal : 4 ms
[2026-05-24 09:47:30] [INFO ] Time to serialize properties into /tmp/LTL10104425468014708292.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/LTL5231595148551390983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4681388183140972460.hoa' '-atoms' '/tmp/LTL10104425468014708292.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/LTL10104425468014708292.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4681388183140972460.hoa
Detected timeout of ITS tools.
[2026-05-24 09:47:45] [INFO ] Flatten gal took : 12 ms
[2026-05-24 09:47:45] [INFO ] Flatten gal took : 12 ms
[2026-05-24 09:47:45] [INFO ] Time to serialize gal into /tmp/LTL17945780880857122305.gal : 3 ms
[2026-05-24 09:47:45] [INFO ] Time to serialize properties into /tmp/LTL15933570092060462154.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17945780880857122305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15933570092060462154.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p12==0)")||(X(X(G("(p1!=1)"))))))))
Formula 0 simplified : XF(!"(p12==0)" & XXF!"(p1!=1)")
Detected timeout of ITS tools.
[2026-05-24 09:48:00] [INFO ] Flatten gal took : 14 ms
[2026-05-24 09:48:00] [INFO ] Applying decomposition
[2026-05-24 09:48:00] [INFO ] Flatten gal took : 11 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/graph12561176821368826218.txt' '-o' '/tmp/graph12561176821368826218.bin' '-w' '/tmp/graph12561176821368826218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12561176821368826218.bin' '-l' '-1' '-v' '-w' '/tmp/graph12561176821368826218.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:48:00] [INFO ] Decomposing Gal with order
[2026-05-24 09:48:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:48:00] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-24 09:48:00] [INFO ] Flatten gal took : 72 ms
[2026-05-24 09:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 09:48:00] [INFO ] Time to serialize gal into /tmp/LTL14925423224142427924.gal : 6 ms
[2026-05-24 09:48:00] [INFO ] Time to serialize properties into /tmp/LTL16575338216950752979.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/LTL14925423224142427924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16575338216950752979.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i8.i0.u5.p12==0)")||(X(X(G("(i0.i2.u0.p1!=1)"))))))))
Formula 0 simplified : XF(!"(i8.i0.u5.p12==0)" & XXF!"(i0.i2.u0.p1!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7, t142, t160, t170, t174, t190, t217, t221, t243, t246, t253, t254, t255, t258, i0.i0.t118,...860
Computing Next relation with stutter on 301440 deadlock states
4 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
927 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.31027,250828,1,0,438112,814,4352,787653,313,2279,972637
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-09-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-09-LTLFireability-00 finished in 165256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(p1)))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 316 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 316 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 314 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 314 transition count 254
Applied a total of 18 rules in 20 ms. Remains 314 /323 variables (removed 9) and now considering 254/263 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-629795481769298308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14050203750988587556.kers'
[2026-05-24 09:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-629795481769298308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14050203750988587556.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 314 cols 761 entries
Finished phase 1 with 205 SingleSign rule and 40 generalized
[2026-05-24 09:48:11] [INFO ] Computed 69 invariants in 5 ms
Computed 69 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14050203750988587556.kers
Total runtime 6 ms.
[2026-05-24 09:48:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-24 09:48:11] [INFO ] Invariant cache hit.
[2026-05-24 09:48:11] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-24 09:48:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD227 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/109 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/149 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 15/184 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 20/204 constraints. Problems are: Problem set: 1 solved, 252 unsolved
SMT process timed out in 30088ms, After SMT, problems are : Problem set: 1 solved, 252 unsolved
Search for dead transitions found 1 dead transitions in 30090ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 314/323 places, 253/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 314 /314 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30575 ms. Remains : 314/323 places, 253/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(p1)))))'
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-03 finished in 31028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 147 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 223
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 284 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 283 transition count 222
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 68 place count 283 transition count 157
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 207 place count 209 transition count 157
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 214 place count 202 transition count 150
Iterating global reduction 3 with 7 rules applied. Total rules applied 221 place count 202 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 221 place count 202 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 201 transition count 149
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 385 place count 115 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 114 transition count 76
Applied a total of 387 rules in 60 ms. Remains 114 /323 variables (removed 209) and now considering 76/263 (removed 187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15745466456863415779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15180593073376405719.kers'
[2026-05-24 09:48:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15745466456863415779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15180593073376405719.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 113 cols 384 entries
Finished phase 1 with 43 SingleSign rule and 21 generalized
[2026-05-24 09:48:42] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15180593073376405719.kers
Total runtime 1 ms.
[2026-05-24 09:48:42] [INFO ] Implicit Places using invariants in 76 ms returned [1, 2, 3, 11, 32, 33, 34, 35, 36, 37]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 77 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/323 places, 76/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 104/323 places, 76/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-04 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p1 U p2))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 316 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 316 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 314 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 314 transition count 254
Applied a total of 18 rules in 17 ms. Remains 314 /323 variables (removed 9) and now considering 254/263 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14859227994947634110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8153675080294990816.kers'
[2026-05-24 09:48:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14859227994947634110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8153675080294990816.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 314 cols 761 entries
Finished phase 1 with 205 SingleSign rule and 40 generalized
[2026-05-24 09:48:42] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8153675080294990816.kers
Total runtime 11 ms.
[2026-05-24 09:48:42] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-24 09:48:42] [INFO ] Invariant cache hit.
[2026-05-24 09:48:43] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-24 09:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD227 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/109 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/149 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 15/184 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 20/204 constraints. Problems are: Problem set: 1 solved, 252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/568 variables, and 216 constraints, problems are : Problem set: 1 solved, 252 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/314 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 147/147 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 45/66 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 3/69 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 147/216 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 18/254 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/257 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/277 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 7/284 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 20/304 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 13/317 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 9/326 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 2/328 constraints. Problems are: Problem set: 1 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/568 variables, and 329 constraints, problems are : Problem set: 1 solved, 252 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/314 constraints, PredecessorRefiner: 0/253 constraints, Known Traps: 260/260 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60039ms problems are : Problem set: 1 solved, 252 unsolved
Search for dead transitions found 1 dead transitions in 60045ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 314/323 places, 253/263 transitions.
Applied a total of 0 rules in 10 ms. Remains 314 /314 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60469 ms. Remains : 314/323 places, 253/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0 U p1)&&p2)))))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-05
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-05 finished in 60660 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 p1) U p2)||X(X(G(p3)))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 257
Applied a total of 12 rules in 13 ms. Remains 317 /323 variables (removed 6) and now considering 257/263 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5826799374319560354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3576153800844387041.kers'
[2026-05-24 09:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5826799374319560354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3576153800844387041.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 317 cols 767 entries
Finished phase 1 with 208 SingleSign rule and 40 generalized
[2026-05-24 09:49:43] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3576153800844387041.kers
Total runtime 2 ms.
[2026-05-24 09:49:43] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 09:49:43] [INFO ] Invariant cache hit.
[2026-05-24 09:49:43] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 09:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD230 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 13/197 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 8/205 constraints. Problems are: Problem set: 1 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/574 variables, and 205 constraints, problems are : Problem set: 1 solved, 255 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 136/136 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 45/66 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 3/69 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 136/205 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/225 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/245 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/265 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/285 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 6/291 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 12/303 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/323 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 3/326 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/574 variables, and 346 constraints, problems are : Problem set: 1 solved, 255 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/256 constraints, Known Traps: 277/277 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60038ms problems are : Problem set: 1 solved, 255 unsolved
Search for dead transitions found 1 dead transitions in 60040ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/323 places, 256/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60527 ms. Remains : 317/323 places, 256/263 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 p1) U p2)||X(X(G(p3)))))'
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-06 finished in 60927 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 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 148 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 223
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 284 transition count 223
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 66 place count 284 transition count 156
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 210 place count 207 transition count 156
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 216 place count 201 transition count 150
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 201 transition count 150
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 390 place count 112 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 111 transition count 74
Applied a total of 392 rules in 33 ms. Remains 111 /323 variables (removed 212) and now considering 74/263 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14931618542839265160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12318038602703519090.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14931618542839265160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12318038602703519090.kers]
Normalized transition count is 73 out of 74 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 110 cols 390 entries
Finished phase 1 with 43 SingleSign rule and 19 generalized
[2026-05-24 09:50:44] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12318038602703519090.kers
Total runtime 1 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 71 ms returned [1, 2, 3, 11, 30, 31, 32, 33, 34, 35, 36]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 72 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/323 places, 74/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 100/323 places, 74/263 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-07 finished in 205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1) U (p0||F(p2)))||F(G(p1))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 147 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 222
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 222
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 68 place count 283 transition count 156
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 209 place count 208 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 203 transition count 151
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 203 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 219 place count 203 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 221 place count 202 transition count 150
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 385 place count 115 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 114 transition count 76
Applied a total of 387 rules in 32 ms. Remains 114 /323 variables (removed 209) and now considering 76/263 (removed 187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17687766322313877402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1514126521764137519.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17687766322313877402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1514126521764137519.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 113 cols 384 entries
Finished phase 1 with 43 SingleSign rule and 21 generalized
[2026-05-24 09:50:44] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1514126521764137519.kers
Total runtime 0 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 77 ms returned [1, 2, 3, 11, 30, 31, 32, 33, 34, 35, 36, 83]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 78 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/323 places, 76/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 75
Applied a total of 2 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2476367634069905422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8208922283187825727.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2476367634069905422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8208922283187825727.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 101 cols 333 entries
Finished phase 1 with 43 SingleSign rule and 20 generalized
[2026-05-24 09:50:44] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8208922283187825727.kers
Total runtime 0 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 09:50:44] [INFO ] Invariant cache hit.
[2026-05-24 09:50:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [10, 18, 30, 48, 50, 52, 56, 58, 60, 97]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 167 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/323 places, 75/263 transitions.
Graph (complete) has 245 edges and 91 vertex of which 82 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 69
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 80 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 78 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 77 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 77 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 25 place count 69 transition count 59
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 3 with 2 rules applied. Total rules applied 27 place count 68 transition count 58
Applied a total of 27 rules in 9 ms. Remains 68 /91 variables (removed 23) and now considering 58/75 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7401320097189054148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17978644600100612154.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7401320097189054148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17978644600100612154.kers]
Normalized transition count is 57 out of 58 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 68 cols 230 entries
Finished phase 1 with 36 SingleSign rule and 11 generalized
[2026-05-24 09:50:44] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17978644600100612154.kers
Total runtime 0 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 43 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 66/323 places, 58/263 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 57
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 4 place count 64 transition count 56
Applied a total of 4 rules in 5 ms. Remains 64 /66 variables (removed 2) and now considering 56/58 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-971503815595743874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3140334239093130568.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-971503815595743874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3140334239093130568.kers]
Normalized transition count is 55 out of 56 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 64 cols 222 entries
Finished phase 1 with 36 SingleSign rule and 9 generalized
[2026-05-24 09:50:44] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3140334239093130568.kers
Total runtime 0 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 09:50:44] [INFO ] Invariant cache hit.
[2026-05-24 09:50:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 63/323 places, 56/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 55
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4728215387761264512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10716584554130310994.kers'
[2026-05-24 09:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4728215387761264512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10716584554130310994.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 62 cols 218 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-24 09:50:44] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10716584554130310994.kers
Total runtime 0 ms.
[2026-05-24 09:50:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 09:50:44] [INFO ] Invariant cache hit.
[2026-05-24 09:50:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:50:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 62/323 places, 55/263 transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 556 ms. Remains : 62/323 places, 55/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1) U (p0||F(p2)))||F(G(p1))))'
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-09 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (complete) has 676 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 321 transition count 229
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 289 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 287 transition count 227
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 69 place count 287 transition count 159
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 215 place count 209 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 222 place count 202 transition count 152
Iterating global reduction 3 with 7 rules applied. Total rules applied 229 place count 202 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 229 place count 202 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 201 transition count 151
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 401 place count 111 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 402 place count 111 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 110 transition count 73
Applied a total of 404 rules in 29 ms. Remains 110 /323 variables (removed 213) and now considering 73/263 (removed 190) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14098203947443293337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8122613614150942320.kers'
[2026-05-24 09:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14098203947443293337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8122613614150942320.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 109 cols 406 entries
Finished phase 1 with 42 SingleSign rule and 19 generalized
[2026-05-24 09:50:45] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8122613614150942320.kers
Total runtime 0 ms.
[2026-05-24 09:50:45] [INFO ] Implicit Places using invariants in 95 ms returned [1, 2, 3, 11, 28, 29, 30, 31, 32, 33, 34]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 96 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/323 places, 73/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 99/323 places, 73/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-10
Product exploration explored 100000 steps with 37524 reset in 199 ms.
Product exploration explored 100000 steps with 37476 reset in 207 ms.
Computed a total of 55 stabilizing places and 44 stable transitions
Computed a total of 55 stabilizing places and 44 stable transitions
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11547990515044807585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2940303130389250788.kers'
[2026-05-24 09:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11547990515044807585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2940303130389250788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 99 cols 365 entries
Finished phase 1 with 42 SingleSign rule and 19 generalized
[2026-05-24 09:50:46] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2940303130389250788.kers
Total runtime 1 ms.
[2026-05-24 09:50:46] [INFO ] [Real]Absence check using 25 positive place invariants in 22 ms returned sat
[2026-05-24 09:50:46] [INFO ] [Real]Absence check using 25 positive and 13 generalized place invariants in 8 ms returned sat
[2026-05-24 09:50:46] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-24 09:50:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 09:50:46] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2026-05-24 09:50:46] [INFO ] [Nat]Absence check using 25 positive and 13 generalized place invariants in 7 ms returned sat
[2026-05-24 09:50:46] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-24 09:50:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 09:50:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2026-05-24 09:50:46] [INFO ] Computed and/alt/rep : 62/231/62 causal constraints (skipped 8 transitions) in 5 ms.
[2026-05-24 09:50:46] [INFO ] Added : 29 causal constraints over 6 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 607 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-24 09:50:46] [INFO ] Invariant cache hit.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 09:50:46] [INFO ] Invariant cache hit.
[2026-05-24 09:50:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [10, 17, 29, 47, 49, 51, 55, 57, 59, 95]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 181 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/99 places, 73/73 transitions.
Graph (complete) has 254 edges and 89 vertex of which 80 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 80 transition count 64
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 75 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 74 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 74 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 65 transition count 55
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 2 with 2 rules applied. Total rules applied 31 place count 64 transition count 54
Applied a total of 31 rules in 6 ms. Remains 64 /89 variables (removed 25) and now considering 54/73 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2629590179898330195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5032626857208949868.kers'
[2026-05-24 09:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2629590179898330195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5032626857208949868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 64 cols 246 entries
Finished phase 1 with 32 SingleSign rule and 11 generalized
[2026-05-24 09:50:46] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5032626857208949868.kers
Total runtime 0 ms.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants in 41 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/99 places, 54/73 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 53
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 4 place count 60 transition count 52
Applied a total of 4 rules in 3 ms. Remains 60 /62 variables (removed 2) and now considering 52/54 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14757449009405395648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3232120408232120038.kers'
[2026-05-24 09:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14757449009405395648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3232120408232120038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 52 rows 60 cols 238 entries
Finished phase 1 with 32 SingleSign rule and 9 generalized
[2026-05-24 09:50:46] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3232120408232120038.kers
Total runtime 0 ms.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 09:50:46] [INFO ] Invariant cache hit.
[2026-05-24 09:50:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/99 places, 52/73 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 51
Applied a total of 2 rules in 2 ms. Remains 58 /59 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14553275299693094147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3527188935820245350.kers'
[2026-05-24 09:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14553275299693094147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3527188935820245350.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 58 cols 234 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-05-24 09:50:46] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3527188935820245350.kers
Total runtime 0 ms.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 09:50:46] [INFO ] Invariant cache hit.
[2026-05-24 09:50:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:50:46] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 58/99 places, 51/73 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 443 ms. Remains : 58/99 places, 51/73 transitions.
Computed a total of 14 stabilizing places and 22 stable transitions
Computed a total of 14 stabilizing places and 22 stable transitions
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2026-05-24 09:50:47] [INFO ] Invariant cache hit.
[2026-05-24 09:50:47] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2026-05-24 09:50:47] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 09:50:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-24 09:50:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 09:50:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2026-05-24 09:50:47] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 09:50:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-24 09:50:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:50:47] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2026-05-24 09:50:47] [INFO ] Computed and/alt/rep : 48/166/48 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-24 09:50:47] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 384 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37531 reset in 112 ms.
Product exploration explored 100000 steps with 37461 reset in 115 ms.
Built C files in :
/tmp/ltsmin6491588699883020976
[2026-05-24 09:50:47] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2026-05-24 09:50:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:50:47] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2026-05-24 09:50:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:50:47] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2026-05-24 09:50:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:50:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6491588699883020976
Running compilation step : cd /tmp/ltsmin6491588699883020976;'/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 136 ms.
Running link step : cd /tmp/ltsmin6491588699883020976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6491588699883020976;'/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/stateBased9966707277773835855.hoa' '--buchi-type=spotba'
LTSmin run took 27 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-09-LTLFireability-10 finished in 2620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 149 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 223
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 284 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 283 transition count 222
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 68 place count 283 transition count 156
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 209 place count 208 transition count 156
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 201 transition count 149
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 201 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 223 place count 201 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 200 transition count 148
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 391 place count 112 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 393 place count 111 transition count 73
Applied a total of 393 rules in 35 ms. Remains 111 /323 variables (removed 212) and now considering 73/263 (removed 190) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4849926437429675015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13755892149594008154.kers'
[2026-05-24 09:50:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4849926437429675015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13755892149594008154.kers]
Normalized transition count is 72 out of 73 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 72 rows 110 cols 390 entries
Finished phase 1 with 40 SingleSign rule and 21 generalized
[2026-05-24 09:50:47] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13755892149594008154.kers
Total runtime 0 ms.
[2026-05-24 09:50:47] [INFO ] Implicit Places using invariants in 84 ms returned [1, 2, 3, 11, 28, 29, 30, 31, 32, 33, 36, 88]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 85 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/323 places, 73/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 99/323 places, 73/263 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 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-11 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 148 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 223
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 284 transition count 223
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 284 transition count 157
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 208 transition count 157
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 202 transition count 151
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 202 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 202 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 201 transition count 150
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 390 place count 112 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 111 transition count 74
Applied a total of 392 rules in 23 ms. Remains 111 /323 variables (removed 212) and now considering 74/263 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17328904946777508071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3770514163556028610.kers'
[2026-05-24 09:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17328904946777508071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3770514163556028610.kers]
Normalized transition count is 73 out of 74 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 110 cols 390 entries
Finished phase 1 with 43 SingleSign rule and 19 generalized
[2026-05-24 09:50:48] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3770514163556028610.kers
Total runtime 7 ms.
[2026-05-24 09:50:48] [INFO ] Implicit Places using invariants in 91 ms returned [1, 2, 3, 11, 28, 29, 30, 31, 32, 33, 34]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 94 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/323 places, 74/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 100/323 places, 74/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-12 finished in 166 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 U p1))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Graph (trivial) has 147 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 670 edges and 318 vertex of which 317 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 222
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 222
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 68 place count 283 transition count 158
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 206 place count 209 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 202 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 202 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 202 transition count 150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 201 transition count 150
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 383 place count 116 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 385 place count 115 transition count 77
Applied a total of 385 rules in 18 ms. Remains 115 /323 variables (removed 208) and now considering 77/263 (removed 186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11606641892782398094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1177485883221851125.kers'
[2026-05-24 09:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11606641892782398094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1177485883221851125.kers]
Normalized transition count is 76 out of 77 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 76 rows 114 cols 398 entries
Finished phase 1 with 45 SingleSign rule and 20 generalized
[2026-05-24 09:50:48] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1177485883221851125.kers
Total runtime 1 ms.
[2026-05-24 09:50:48] [INFO ] Implicit Places using invariants in 93 ms returned [1, 2, 3, 12, 31, 32, 33, 34, 35, 36, 37]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 94 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/323 places, 77/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 104/323 places, 77/263 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 U p1))))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-13 finished in 214 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((G((p0||X(p1)))||(X(X((p0||X(p1))))&&F((G(F(p2))||(p3&&F(p2)))))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 317 transition count 257
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 317 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 316 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 316 transition count 256
Applied a total of 14 rules in 24 ms. Remains 316 /323 variables (removed 7) and now considering 256/263 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3581997361940713023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12332469823283384059.kers'
[2026-05-24 09:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3581997361940713023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12332469823283384059.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 316 cols 765 entries
Finished phase 1 with 207 SingleSign rule and 40 generalized
[2026-05-24 09:50:48] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12332469823283384059.kers
Total runtime 5 ms.
[2026-05-24 09:50:48] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 09:50:48] [INFO ] Invariant cache hit.
[2026-05-24 09:50:48] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 09:50:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 20/189 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 9/198 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 20/218 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/572 variables, and 221 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 152/152 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 45/66 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/69 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 152/221 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 18/239 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/259 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 10/269 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 18/287 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/289 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 4/293 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 4/297 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 2/299 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 14 (OVERLAPS) 256/572 variables, 316/615 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/572 variables, 254/869 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 869 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 230/230 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 60042ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 316/323 places, 255/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60460 ms. Remains : 316/323 places, 255/263 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((G((p0||X(p1)))||(X(X((p0||X(p1))))&&F((G(F(p2))||(p3&&F(p2)))))))))'
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 1064 reset in 140 ms.
Product exploration explored 100000 steps with 1051 reset in 154 ms.
Computed a total of 188 stabilizing places and 157 stable transitions
Graph (complete) has 667 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 188 stabilizing places and 157 stable transitions
Detected a total of 188/316 stabilizing places and 157/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 23 factoid took 87 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (425 resets) in 422 ms. (94 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2440263923437764661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4495339606566806670.kers'
[2026-05-24 09:51:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2440263923437764661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4495339606566806670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 316 cols 759 entries
Finished phase 1 with 207 SingleSign rule and 39 generalized
[2026-05-24 09:51:49] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4495339606566806670.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 219/245 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 68/313 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 253/566 variables, 313/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/571 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 4/410 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 0/410 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/571 variables, 0/410 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 410 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2616 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 219/245 variables, 43/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 10/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/313 variables, 25/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 14/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 18/112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 253/566 variables, 313/425 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 2/427 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 2/429 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 2/431 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 20/451 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 1/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 2/454 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/571 variables, 3/457 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 0/457 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/571 variables, 0/457 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 457 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4724 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 7348ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 1950 steps, including 12 resets, run visited all 2 properties in 11 ms. (steps per millisecond=177 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 14 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 25 factoid took 285 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 8089 ms.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 316 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 255/255 transitions.
Graph (trivial) has 137 edges and 316 vertex of which 6 / 316 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 661 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 309 transition count 222
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 284 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 283 transition count 221
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 54 place count 283 transition count 154
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 197 place count 207 transition count 154
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 369 place count 115 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 114 transition count 77
Applied a total of 371 rules in 23 ms. Remains 114 /316 variables (removed 202) and now considering 77/255 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14662615187692758667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5922939235640040268.kers'
[2026-05-24 09:51:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14662615187692758667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5922939235640040268.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 114 cols 398 entries
Finished phase 1 with 48 SingleSign rule and 17 generalized
[2026-05-24 09:51:57] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5922939235640040268.kers
Total runtime 0 ms.
[2026-05-24 09:51:57] [INFO ] Implicit Places using invariants in 85 ms returned [1, 2, 3, 11, 30, 31, 32, 33, 34, 35, 83]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 87 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/316 places, 77/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 103/316 places, 77/255 transitions.
Computed a total of 55 stabilizing places and 45 stable transitions
Computed a total of 55 stabilizing places and 45 stable transitions
Detected a total of 55/103 stabilizing places and 45/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 41 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8870 resets) in 319 ms. (125 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2650 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15759002423557767329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3113037729911098261.kers'
[2026-05-24 09:51:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15759002423557767329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3113037729911098261.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 103 cols 355 entries
Finished phase 1 with 49 SingleSign rule and 16 generalized
[2026-05-24 09:51:57] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3113037729911098261.kers
Total runtime 1 ms.
[2026-05-24 09:51:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/102 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/178 variables, 102/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/179 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/102 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/178 variables, 102/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/179 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/179 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 8 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 580 ms.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 1557 steps with 288 reset in 8 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-14 finished in 69978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X(p0)) U ((!p1&&X(X(p0)))||X(X(G(p0))))))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 263/263 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 317 transition count 257
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 317 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 316 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 316 transition count 256
Applied a total of 14 rules in 14 ms. Remains 316 /323 variables (removed 7) and now considering 256/263 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9514493214635197839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1196440624603709643.kers'
[2026-05-24 09:51:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9514493214635197839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1196440624603709643.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 316 cols 765 entries
Finished phase 1 with 207 SingleSign rule and 40 generalized
[2026-05-24 09:51:58] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1196440624603709643.kers
Total runtime 1 ms.
[2026-05-24 09:51:58] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 09:51:58] [INFO ] Invariant cache hit.
[2026-05-24 09:51:58] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 09:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/149 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 20/189 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 20/209 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 20/229 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/572 variables, and 229 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 160/160 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 45/66 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/69 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 160/229 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 18/247 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 6/253 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/273 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 7/280 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/281 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 11 (OVERLAPS) 256/572 variables, 316/597 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 254/851 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 20/871 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 871 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 60051ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 316/323 places, 255/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 316 /316 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60467 ms. Remains : 316/323 places, 255/263 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X(p0)) U (X(X(G(p0)))||(!p1&&X(X(p0))))))))))'
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 14285 reset in 121 ms.
Product exploration explored 100000 steps with 14285 reset in 130 ms.
Computed a total of 188 stabilizing places and 157 stable transitions
Graph (complete) has 665 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 188 stabilizing places and 157 stable transitions
Detected a total of 188/316 stabilizing places and 157/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (416 resets) in 136 ms. (291 steps per ms) remains 1/4 properties
BEST_FIRST walk for 32377 steps (56 resets) in 32 ms. (981 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 490 ms.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 255/255 (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-5604806881213421265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12267063810082042743.kers'
[2026-05-24 09:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5604806881213421265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12267063810082042743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 316 cols 759 entries
Finished phase 1 with 207 SingleSign rule and 39 generalized
[2026-05-24 09:53:00] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12267063810082042743.kers
Total runtime 1 ms.
[2026-05-24 09:53:00] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-24 09:53:00] [INFO ] Invariant cache hit.
[2026-05-24 09:53:00] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 09:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 254 unsolved
SMT process timed out in 30033ms, After SMT, problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 30033ms
Finished structural reductions in LTL mode , in 1 iterations and 30435 ms. Remains : 316/316 places, 255/255 transitions.
Computed a total of 188 stabilizing places and 157 stable transitions
Graph (complete) has 665 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 188 stabilizing places and 157 stable transitions
Detected a total of 188/316 stabilizing places and 157/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (413 resets) in 134 ms. (296 steps per ms) remains 1/4 properties
BEST_FIRST walk for 34132 steps (61 resets) in 30 ms. (1101 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 572 ms.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 14285 reset in 96 ms.
Product exploration explored 100000 steps with 14285 reset in 103 ms.
Spot run failed in 44 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/ltsmin9491008401962488740
[2026-05-24 09:53:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491008401962488740
Running compilation step : cd /tmp/ltsmin9491008401962488740;'/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 376 ms.
Running link step : cd /tmp/ltsmin9491008401962488740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9491008401962488740;'/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/stateBased6575958110208348241.hoa' '--buchi-type=spotba'
LTSmin run took 444 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-09-LTLFireability-15 finished in 94546 ms.
All properties solved by simple procedures.
Total runtime 581787 ms.
BK_STOP 1779616412946
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;