About the Execution of ITS-Tools for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 720.468 | 534135.00 | 645487.00 | 3456.30 | FFFFTFFFFFFFFFFF | 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-177946842100604.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:52 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 4.4K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:49 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 192K 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-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779630067078
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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 13:41:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:41:08] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-24 13:41:08] [INFO ] Transformed 782 places.
[2026-05-24 13:41:08] [INFO ] Transformed 697 transitions.
[2026-05-24 13:41:08] [INFO ] Found NUPN structural information;
[2026-05-24 13:41:08] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 201 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 2 formulas.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 117 place count 602 transition count 535
Iterating global reduction 1 with 103 rules applied. Total rules applied 220 place count 602 transition count 535
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 272 place count 550 transition count 483
Iterating global reduction 1 with 52 rules applied. Total rules applied 324 place count 550 transition count 483
Applied a total of 324 rules in 156 ms. Remains 550 /719 variables (removed 169) and now considering 483/638 (removed 155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8902015091770793664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7464627545084288310.kers'
[2026-05-24 13:41:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8902015091770793664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7464627545084288310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 483 rows 550 cols 1535 entries
Finished phase 1 with 364 SingleSign rule and 79 generalized
[2026-05-24 13:41:08] [INFO ] Computed 107 invariants in 4 ms
Computed 107 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7464627545084288310.kers
Total runtime 6 ms.
[2026-05-24 13:41:09] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-24 13:41:09] [INFO ] Invariant cache hit.
[2026-05-24 13:41:10] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2026-05-24 13:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1033 variables, and 167 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 482 unsolved
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 550/719 places, 483/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61914 ms. Remains : 550/719 places, 483/638 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Applied a total of 0 rules in 25 ms. Remains 550 /550 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2026-05-24 13:42:10] [INFO ] Invariant cache hit.
[2026-05-24 13:42:10] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-24 13:42:10] [INFO ] Invariant cache hit.
[2026-05-24 13:42:11] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1311 ms. Remains : 550/550 places, 483/483 transitions.
Support contains 39 out of 550 places after structural reductions.
[2026-05-24 13:42:12] [INFO ] Flatten gal took : 60 ms
[2026-05-24 13:42:12] [INFO ] Flatten gal took : 29 ms
[2026-05-24 13:42:12] [INFO ] Input system was already deterministic with 483 transitions.
Support contains 38 out of 550 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (196 resets) in 2790 ms. (14 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40004 steps (36 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (37 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 104 ms. (380 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (37 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (37 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (24 resets) in 122 ms. (325 steps per ms) remains 6/8 properties
[2026-05-24 13:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 91/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 375/474 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 65/539 variables, 16/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5145ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 257 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1221 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 543 transition count 405
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 474 transition count 405
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 140 place count 474 transition count 295
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 382 place count 342 transition count 295
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 389 place count 335 transition count 288
Iterating global reduction 2 with 7 rules applied. Total rules applied 396 place count 335 transition count 288
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 396 place count 335 transition count 287
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 398 place count 334 transition count 287
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 680 place count 191 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 684 place count 189 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 686 place count 189 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 688 place count 187 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 689 place count 187 transition count 153
Applied a total of 689 rules in 134 ms. Remains 187 /550 variables (removed 363) and now considering 153/483 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 187/550 places, 153/483 transitions.
RANDOM walk for 40000 steps (1926 resets) in 859 ms. (46 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (689 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (677 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2026-05-24 13:42:18] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-804355332063914423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18018899441023039580.kers'
[2026-05-24 13:42:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-804355332063914423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18018899441023039580.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 152 rows 186 cols 1009 entries
Finished phase 1 with 63 SingleSign rule and 43 generalized
[2026-05-24 13:42:18] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18018899441023039580.kers
Total runtime 1 ms.
[2026-05-24 13:42:18] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/145 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/183 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 183/339 variables, and 80 constraints, problems are : Problem set: 1 solved, 0 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 14/16 constraints, State Equation: 0/187 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 480 stabilizing places and 423 stable transitions
Graph (complete) has 1228 edges and 550 vertex of which 548 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(p2)))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 541 transition count 474
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 539 transition count 472
Applied a total of 22 rules in 191 ms. Remains 539 /550 variables (removed 11) and now considering 472/483 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3017314021739310297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14460156034710685743.kers'
[2026-05-24 13:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3017314021739310297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14460156034710685743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 472 rows 539 cols 1513 entries
Finished phase 1 with 353 SingleSign rule and 79 generalized
[2026-05-24 13:42:19] [INFO ] Computed 107 invariants in 8 ms
Computed 107 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14460156034710685743.kers
Total runtime 9 ms.
[2026-05-24 13:42:19] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-24 13:42:19] [INFO ] Invariant cache hit.
[2026-05-24 13:42:20] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-24 13:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1011 variables, and 167 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 464 unsolved
Problem TDEAD419 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 10 solved, 461 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 10 solved, 461 unsolved
SMT process timed out in 60169ms, After SMT, problems are : Problem set: 10 solved, 461 unsolved
Search for dead transitions found 10 dead transitions in 60171ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/550 places, 462/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 539 /539 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61650 ms. Remains : 539/550 places, 462/483 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(p2)))'
Stuttering acceptance computed with spot in 494 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-01 finished in 62224 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||G(p1)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 262 edges and 550 vertex of which 6 / 550 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 1222 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 542 transition count 404
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 472 transition count 404
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 142 place count 472 transition count 291
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 390 place count 337 transition count 291
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 399 place count 328 transition count 282
Iterating global reduction 2 with 9 rules applied. Total rules applied 408 place count 328 transition count 282
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 688 place count 186 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 694 place count 183 transition count 150
Applied a total of 694 rules in 56 ms. Remains 183 /550 variables (removed 367) and now considering 150/483 (removed 333) transitions.
[2026-05-24 13:43:21] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1476227522623590890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11512574616986170795.kers'
[2026-05-24 13:43:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1476227522623590890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11512574616986170795.kers]
Normalized transition count is 148 out of 149 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 148 rows 182 cols 985 entries
Finished phase 1 with 60 SingleSign rule and 42 generalized
[2026-05-24 13:43:21] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11512574616986170795.kers
Total runtime 2 ms.
[2026-05-24 13:43:21] [INFO ] Implicit Places using invariants in 161 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 162 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/550 places, 150/483 transitions.
Applied a total of 0 rules in 14 ms. Remains 159 /159 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 159/550 places, 150/483 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||G(p1)))))'
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0 U (G(!p0)||p1)))) U (G(X(X((!p0 U (p1||G(!p0))))))||(X(X((!p0 U (p1||G(!p0)))))&&p2))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 538 transition count 471
Applied a total of 24 rules in 28 ms. Remains 538 /550 variables (removed 12) and now considering 471/483 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10703516003256551905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9872093635187919887.kers'
[2026-05-24 13:43:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10703516003256551905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9872093635187919887.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 538 cols 1511 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:43:22] [INFO ] Computed 107 invariants in 8 ms
Computed 107 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9872093635187919887.kers
Total runtime 9 ms.
[2026-05-24 13:43:22] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-24 13:43:22] [INFO ] Invariant cache hit.
[2026-05-24 13:43:23] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 167 constraints, problems are : Problem set: 7 solved, 463 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 20 solved, 450 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
SMT process timed out in 60197ms, After SMT, problems are : Problem set: 20 solved, 450 unsolved
Search for dead transitions found 20 dead transitions in 60199ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 451/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61583 ms. Remains : 538/550 places, 451/483 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0 U (G(!p0)||p1)))) U (G(X(X((!p0 U (p1||G(!p0))))))||(X(X((!p0 U (p1||G(!p0)))))&&p2))))'
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 24995 reset in 333 ms.
Product exploration explored 100000 steps with 25113 reset in 200 ms.
Computed a total of 470 stabilizing places and 393 stable transitions
Graph (complete) has 1169 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 470 stabilizing places and 393 stable transitions
Detected a total of 470/538 stabilizing places and 393/451 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 16 factoid took 89 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 40000 steps (197 resets) in 328 ms. (121 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (35 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (33 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 143 ms. (277 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-7086723607125331400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17224465886151141108.kers'
[2026-05-24 13:44:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7086723607125331400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17224465886151141108.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 451 rows 538 cols 1391 entries
Finished phase 1 with 352 SingleSign rule and 78 generalized
[2026-05-24 13:44:24] [INFO ] Computed 108 invariants in 3 ms
Computed 108 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17224465886151141108.kers
Total runtime 4 ms.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 398/465 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 10/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/527 variables, 17/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5068ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 451/451 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1162 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 374
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 374
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 138 place count 463 transition count 264
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 380 place count 331 transition count 264
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 671 place count 183 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 675 place count 181 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 677 place count 181 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 679 place count 179 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 680 place count 179 transition count 126
Applied a total of 680 rules in 47 ms. Remains 179 /538 variables (removed 359) and now considering 126/451 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 179/538 places, 126/451 transitions.
RANDOM walk for 40000 steps (2079 resets) in 220 ms. (180 steps per ms) remains 1/3 properties
BEST_FIRST walk for 24190 steps (464 resets) in 88 ms. (271 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 17 factoid took 240 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Knowledge-based reduction took 5995 ms.
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 451/451 transitions.
Applied a total of 0 rules in 17 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2026-05-24 13:44:30] [INFO ] Invariant cache hit.
[2026-05-24 13:44:30] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 13:44:30] [INFO ] Invariant cache hit.
[2026-05-24 13:44:31] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2026-05-24 13:44:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/989 variables, and 172 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 64/172 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/192 constraints. Problems are: Problem set: 3 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/212 constraints. Problems are: Problem set: 3 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/232 constraints. Problems are: Problem set: 3 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/252 constraints. Problems are: Problem set: 3 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/272 constraints. Problems are: Problem set: 3 solved, 447 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/292 constraints. Problems are: Problem set: 3 solved, 447 unsolved
SMT process timed out in 60163ms, After SMT, problems are : Problem set: 3 solved, 447 unsolved
Search for dead transitions found 3 dead transitions in 60167ms
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 : 538/538 places, 448/451 transitions.
Applied a total of 0 rules in 21 ms. Remains 538 /538 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61256 ms. Remains : 538/538 places, 448/451 transitions.
Computed a total of 470 stabilizing places and 390 stable transitions
Graph (complete) has 1163 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 390 stable transitions
Detected a total of 470/538 stabilizing places and 390/448 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 10 factoid took 110 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (198 resets) in 129 ms. (307 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (37 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-712155725114789867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1232134205009079899.kers'
[2026-05-24 13:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-712155725114789867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1232134205009079899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 538 cols 1373 entries
Finished phase 1 with 352 SingleSign rule and 77 generalized
[2026-05-24 13:45:31] [INFO ] Computed 109 invariants in 4 ms
Computed 109 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1232134205009079899.kers
Total runtime 5 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 404/465 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 64/529 variables, 19/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5719ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 448/448 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1156 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 371
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 138 place count 463 transition count 261
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 380 place count 331 transition count 261
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 292 rules applied. Total rules applied 672 place count 182 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 676 place count 180 transition count 125
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 678 place count 180 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 680 place count 178 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 681 place count 178 transition count 123
Applied a total of 681 rules in 37 ms. Remains 178 /538 variables (removed 360) and now considering 123/448 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 178/538 places, 123/448 transitions.
RANDOM walk for 40000 steps (2129 resets) in 224 ms. (177 steps per ms) remains 1/3 properties
BEST_FIRST walk for 28469 steps (528 resets) in 56 ms. (499 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Knowledge-based reduction took 6454 ms.
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Stuttering acceptance computed with spot in 124 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Product exploration explored 100000 steps with 25107 reset in 142 ms.
Product exploration explored 100000 steps with 25008 reset in 144 ms.
Spot run failed in 86 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/ltsmin12821551616672890352
[2026-05-24 13:45:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12821551616672890352
Running compilation step : cd /tmp/ltsmin12821551616672890352;'/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 817 ms.
Running link step : cd /tmp/ltsmin12821551616672890352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12821551616672890352;'/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/stateBased15219307517954538986.hoa' '--buchi-type=spotba'
LTSmin run took 11460 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 149217 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 263 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1222 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 542 transition count 404
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 472 transition count 404
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 142 place count 472 transition count 292
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 387 place count 339 transition count 292
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 329 transition count 282
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 329 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 407 place count 329 transition count 281
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 409 place count 328 transition count 281
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 691 place count 185 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 697 place count 182 transition count 148
Applied a total of 697 rules in 48 ms. Remains 182 /550 variables (removed 368) and now considering 148/483 (removed 335) transitions.
[2026-05-24 13:45:51] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14239053657401842151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3051932976581407307.kers'
[2026-05-24 13:45:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14239053657401842151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3051932976581407307.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 146 rows 181 cols 989 entries
Finished phase 1 with 57 SingleSign rule and 43 generalized
[2026-05-24 13:45:51] [INFO ] Computed 82 invariants in 1 ms
Computed 82 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3051932976581407307.kers
Total runtime 1 ms.
[2026-05-24 13:45:51] [INFO ] Implicit Places using invariants in 183 ms returned [27, 28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 185 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/550 places, 148/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 157/550 places, 148/483 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 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-06 finished in 297 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 263 edges and 550 vertex of which 6 / 550 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 1222 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 405
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 473 transition count 405
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 142 place count 473 transition count 292
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 390 place count 338 transition count 292
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 399 place count 329 transition count 283
Iterating global reduction 2 with 9 rules applied. Total rules applied 408 place count 329 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 408 place count 329 transition count 282
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 410 place count 328 transition count 282
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 696 place count 183 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 700 place count 181 transition count 148
Applied a total of 700 rules in 33 ms. Remains 181 /550 variables (removed 369) and now considering 148/483 (removed 335) transitions.
[2026-05-24 13:45:51] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3129137512303981238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8772779448822459704.kers'
[2026-05-24 13:45:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3129137512303981238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8772779448822459704.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 146 rows 180 cols 991 entries
Finished phase 1 with 58 SingleSign rule and 42 generalized
[2026-05-24 13:45:51] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8772779448822459704.kers
Total runtime 2 ms.
[2026-05-24 13:45:51] [INFO ] Implicit Places using invariants in 187 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 189 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/550 places, 148/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 157/550 places, 148/483 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 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 285 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))))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 538 transition count 471
Applied a total of 24 rules in 25 ms. Remains 538 /550 variables (removed 12) and now considering 471/483 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10055650803232639633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15487427756545767788.kers'
[2026-05-24 13:45:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10055650803232639633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15487427756545767788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 538 cols 1511 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:45:51] [INFO ] Computed 107 invariants in 2 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15487427756545767788.kers
Total runtime 4 ms.
[2026-05-24 13:45:52] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-24 13:45:52] [INFO ] Invariant cache hit.
[2026-05-24 13:45:53] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 167 constraints, problems are : Problem set: 7 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 20 solved, 450 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
SMT process timed out in 60173ms, After SMT, problems are : Problem set: 20 solved, 450 unsolved
Search for dead transitions found 20 dead transitions in 60176ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 451/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61573 ms. Remains : 538/550 places, 451/483 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))))'
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08
Stuttering criterion allowed to conclude after 372 steps with 1 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 61729 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 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 261 edges and 550 vertex of which 6 / 550 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 1222 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 542 transition count 405
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 473 transition count 405
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 140 place count 473 transition count 294
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 383 place count 341 transition count 294
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 393 place count 331 transition count 284
Iterating global reduction 2 with 10 rules applied. Total rules applied 403 place count 331 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 403 place count 331 transition count 283
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 405 place count 330 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 687 place count 187 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 693 place count 184 transition count 150
Applied a total of 693 rules in 43 ms. Remains 184 /550 variables (removed 366) and now considering 150/483 (removed 333) transitions.
[2026-05-24 13:46:53] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8125280170767658500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8862962639882733711.kers'
[2026-05-24 13:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8125280170767658500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8862962639882733711.kers]
Normalized transition count is 148 out of 149 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 148 rows 183 cols 993 entries
Finished phase 1 with 47 SingleSign rule and 55 generalized
[2026-05-24 13:46:53] [INFO ] Computed 82 invariants in 2 ms
Computed 82 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8862962639882733711.kers
Total runtime 3 ms.
[2026-05-24 13:46:53] [INFO ] Implicit Places using invariants in 171 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 173 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/550 places, 150/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 160/550 places, 150/483 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-09 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X((p0||F(p1)))))&&F(p2)))))'
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 542 transition count 475
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 542 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 540 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 540 transition count 473
Applied a total of 20 rules in 30 ms. Remains 540 /550 variables (removed 10) and now considering 473/483 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8210205981227340200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3194604333983479554.kers'
[2026-05-24 13:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8210205981227340200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3194604333983479554.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 473 rows 540 cols 1515 entries
Finished phase 1 with 354 SingleSign rule and 79 generalized
[2026-05-24 13:46:53] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-3194604333983479554.kers
Total runtime 12 ms.
[2026-05-24 13:46:54] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-24 13:46:54] [INFO ] Invariant cache hit.
[2026-05-24 13:46:55] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 13:46:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1013 variables, and 167 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 472 unsolved
SMT process timed out in 60220ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 540/550 places, 473/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61595 ms. Remains : 540/550 places, 473/483 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X((p0||F(p1)))))&&F(p2)))))'
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-10
Stuttering criterion allowed to conclude after 210 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-10 finished in 61981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((p0 U p1) U p2))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 542 transition count 475
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 542 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 541 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 541 transition count 474
Applied a total of 18 rules in 29 ms. Remains 541 /550 variables (removed 9) and now considering 474/483 (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-4413386955398053923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11879884859006311259.kers'
[2026-05-24 13:47:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4413386955398053923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11879884859006311259.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 474 rows 541 cols 1517 entries
Finished phase 1 with 355 SingleSign rule and 79 generalized
[2026-05-24 13:47:55] [INFO ] Computed 107 invariants in 11 ms
Computed 107 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11879884859006311259.kers
Total runtime 14 ms.
[2026-05-24 13:47:56] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-24 13:47:56] [INFO ] Invariant cache hit.
[2026-05-24 13:47:56] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2026-05-24 13:47:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/1015 variables, and 167 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/541 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 60165ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 541/550 places, 474/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61290 ms. Remains : 541/550 places, 474/483 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((p0 U p1) U p2))))'
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 61517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1||F(p2))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 538 transition count 471
Applied a total of 24 rules in 27 ms. Remains 538 /550 variables (removed 12) and now considering 471/483 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14913984598270230322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9074245255747639642.kers'
[2026-05-24 13:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14913984598270230322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9074245255747639642.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 538 cols 1511 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:48:57] [INFO ] Computed 107 invariants in 6 ms
Computed 107 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9074245255747639642.kers
Total runtime 9 ms.
[2026-05-24 13:48:57] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-24 13:48:57] [INFO ] Invariant cache hit.
[2026-05-24 13:48:58] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 167 constraints, problems are : Problem set: 7 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 20 solved, 450 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1009 variables, and 279 constraints, problems are : Problem set: 20 solved, 450 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 172/172 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 20 solved, 450 unsolved
Search for dead transitions found 20 dead transitions in 60079ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 451/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61399 ms. Remains : 538/550 places, 451/483 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1||F(p2))))'
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12
Product exploration explored 100000 steps with 509 reset in 225 ms.
Stack based approach found an accepted trace after 76874 steps with 376 reset with depth 5 and stack size 5 in 199 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 61993 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(F(p0))||(F(p0)&&X(X(X((p1||G(p2)))))))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 542 transition count 475
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 542 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 541 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 541 transition count 474
Applied a total of 18 rules in 30 ms. Remains 541 /550 variables (removed 9) and now considering 474/483 (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-9904406703388077116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18111669455343102420.kers'
[2026-05-24 13:49:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9904406703388077116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18111669455343102420.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 474 rows 541 cols 1517 entries
Finished phase 1 with 355 SingleSign rule and 79 generalized
[2026-05-24 13:49:59] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-18111669455343102420.kers
Total runtime 12 ms.
[2026-05-24 13:49:59] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-24 13:49:59] [INFO ] Invariant cache hit.
[2026-05-24 13:50:00] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 541/550 places, 474/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1341 ms. Remains : 541/550 places, 474/483 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(F(p0))||(F(p0)&&X(X(X((p1||G(p2)))))))))'
Stuttering acceptance computed with spot in 446 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-15 finished in 1844 ms.
All properties solved by simple procedures.
Total runtime 532971 ms.
BK_STOP 1779630601213
--------------------
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-20"
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-20, 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-177946842100604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 ;