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-177946842000452.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-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:42 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 47K 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-01-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779609857146

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 08:04:18] [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 08:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:04:18] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-24 08:04:18] [INFO ] Transformed 200 places.
[2026-05-24 08:04:18] [INFO ] Transformed 178 transitions.
[2026-05-24 08:04:18] [INFO ] Found NUPN structural information;
[2026-05-24 08:04:18] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 173 transition count 153
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 173 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 152
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 164 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 164 transition count 143
Applied a total of 69 rules in 41 ms. Remains 164 /199 variables (removed 35) and now considering 143/177 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4793939637592621663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3324533282268842583.kers'
[2026-05-24 08:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4793939637592621663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3324533282268842583.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 164 cols 415 entries
Finished phase 1 with 120 SingleSign rule and 16 generalized
[2026-05-24 08:04:18] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3324533282268842583.kers
Total runtime 1 ms.
[2026-05-24 08:04:18] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 08:04:18] [INFO ] Invariant cache hit.
[2026-05-24 08:04:19] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-24 08:04:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 3 solved, 139 unsolved
Problem TDEAD121 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 13/61 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 3/64 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 1/65 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 143/307 variables, 164/229 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 4/233 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 5/238 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 2/240 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 3/243 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 1/244 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 1/245 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/245 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 17 (OVERLAPS) 0/307 variables, 0/245 constraints. Problems are: Problem set: 4 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 245 constraints, problems are : Problem set: 4 solved, 138 unsolved in 19366 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 23/26 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/28 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 49/77 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/79 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/79 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 143/307 variables, 164/243 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 138/381 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 11/392 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 11/403 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 10/413 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 1/414 constraints. Problems are: Problem set: 4 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 1/415 constraints. Problems are: Problem set: 4 solved, 138 unsolved
SMT process timed out in 49442ms, After SMT, problems are : Problem set: 4 solved, 138 unsolved
Search for dead transitions found 4 dead transitions in 49451ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/199 places, 139/177 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 139
Applied a total of 1 rules in 4 ms. Remains 163 /164 variables (removed 1) and now considering 139/139 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16311234811442679839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17930940883642411091.kers'
[2026-05-24 08:05:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16311234811442679839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17930940883642411091.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 139 rows 162 cols 387 entries
Finished phase 1 with 122 SingleSign rule and 12 generalized
[2026-05-24 08:05:08] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17930940883642411091.kers
Total runtime 1 ms.
[2026-05-24 08:05:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 08:05:08] [INFO ] Invariant cache hit.
[2026-05-24 08:05:08] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/199 places, 139/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50129 ms. Remains : 163/199 places, 139/177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-24 08:05:08] [INFO ] Invariant cache hit.
[2026-05-24 08:05:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 08:05:08] [INFO ] Invariant cache hit.
[2026-05-24 08:05:08] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-24 08:05:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 139/302 variables, 163/233 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 5/238 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/302 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/302 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/302 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/302 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/302 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 24 (OVERLAPS) 0/302 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 256 constraints, problems are : Problem set: 0 solved, 138 unsolved in 28614 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 59/88 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 139/302 variables, 163/252 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 138/390 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 402 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/5 constraints]
After SMT, in 58651ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 58652ms
Finished structural reductions in LTL mode , in 1 iterations and 58836 ms. Remains : 163/163 places, 139/139 transitions.
Support contains 42 out of 163 places after structural reductions.
[2026-05-24 08:06:07] [INFO ] Flatten gal took : 30 ms
[2026-05-24 08:06:07] [INFO ] Flatten gal took : 16 ms
[2026-05-24 08:06:07] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 40000 steps (460 resets) in 790 ms. (50 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (98 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2026-05-24 08:06:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/31 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 104/135 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 7 (OVERLAPS) 22/157 variables, 5/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 135/292 variables, 157/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/301 variables, 5/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/302 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 194 constraints, problems are : Problem set: 1 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Int declared 27/302 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 2/23 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-01-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 136 stabilizing places and 113 stable transitions
Graph (complete) has 328 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Graph (trivial) has 89 edges and 163 vertex of which 6 / 163 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 322 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 155 transition count 108
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 132 transition count 108
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 48 place count 132 transition count 79
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 111 place count 98 transition count 79
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 123 place count 86 transition count 67
Iterating global reduction 2 with 12 rules applied. Total rules applied 135 place count 86 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 135 place count 86 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 85 transition count 66
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 207 place count 49 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 48 transition count 35
Applied a total of 209 rules in 31 ms. Remains 48 /163 variables (removed 115) and now considering 35/139 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14266469898412726117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8713522737980780377.kers'
[2026-05-24 08:06:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14266469898412726117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8713522737980780377.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 47 cols 173 entries
Finished phase 1 with 25 SingleSign rule and 2 generalized
[2026-05-24 08:06:08] [INFO ] Computed 21 invariants in 3 ms
Computed 21 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8713522737980780377.kers
Total runtime 7 ms.
[2026-05-24 08:06:08] [INFO ] Implicit Places using invariants in 58 ms returned [1, 2, 5, 6, 7, 8, 12]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/163 places, 35/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 41/163 places, 35/139 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 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-00 finished in 324 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||G(p1))))||F(p2))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 148 transition count 125
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 148 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 143 transition count 120
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 143 transition count 120
Applied a total of 39 rules in 15 ms. Remains 143 /163 variables (removed 20) and now considering 120/139 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13493851838810644470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1782370475259677665.kers'
[2026-05-24 08:06:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13493851838810644470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1782370475259677665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 143 cols 349 entries
Finished phase 1 with 103 SingleSign rule and 12 generalized
[2026-05-24 08:06:09] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1782370475259677665.kers
Total runtime 1 ms.
[2026-05-24 08:06:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 08:06:09] [INFO ] Invariant cache hit.
[2026-05-24 08:06:09] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 08:06:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 120/263 variables, 143/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11513 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 119/318 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 337 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 41537ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 41538ms
Starting structural reductions in LTL mode, iteration 1 : 143/163 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41722 ms. Remains : 143/163 places, 120/139 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||G(p1))))||F(p2))))'
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 120 stabilizing places and 98 stable transitions
Graph (complete) has 296 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 120 stabilizing places and 98 stable transitions
Detected a total of 120/143 stabilizing places and 98/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 20 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 33 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLFireability-01 finished in 42166 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((p0 U (p1||G(p0)))))||(F(p2)&&X((p0 U (p1||G(p0))))))) U (G((X((p0 U (p1||G(p0)))) U ((F(p2)&&X((p0 U (p1||G(p0)))))||G(X((p0 U (p1||G(p0))))))))||(X(F(!p2))&&(X((p0 U (p1||G(p0)))) U ((F(p2)&&X((p0 U (p1||G(p0)))))||G(X((p0 U (p1||G(p0))))))))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 149 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 126
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 144 transition count 121
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 144 transition count 121
Applied a total of 37 rules in 15 ms. Remains 144 /163 variables (removed 19) and now considering 121/139 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6057337172712366218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-328470659734969800.kers'
[2026-05-24 08:06:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6057337172712366218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-328470659734969800.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:06:51] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-328470659734969800.kers
Total runtime 1 ms.
[2026-05-24 08:06:51] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 08:06:51] [INFO ] Invariant cache hit.
[2026-05-24 08:06:51] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2026-05-24 08:06:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (OVERLAPS) 0/265 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 216 constraints, problems are : Problem set: 0 solved, 120 unsolved in 14282 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 42/70 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 144/218 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 120/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 348 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 44305ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 44306ms
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 121/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44472 ms. Remains : 144/163 places, 121/139 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((p0 U (p1||G(p0)))))||(F(p2)&&X((p0 U (p1||G(p0))))))) U (G((X((p0 U (p1||G(p0)))) U ((F(p2)&&X((p0 U (p1||G(p0)))))||G(X((p0 U (p1||G(p0))))))))||(X(F(!p2))&&(X((p0 U (p1||G(p0)))) U ((F(p2)&&X((p0 U (p1||G(p0)))))||G(X((p0 U (p1||G(p0))))))))))))'
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, (NOT p2), p2]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-02
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-02 finished in 44890 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((p0||X(p1))))) U G(p2)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 148 transition count 125
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 148 transition count 125
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 144 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 144 transition count 121
Applied a total of 37 rules in 9 ms. Remains 144 /163 variables (removed 19) and now considering 121/139 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15040205882091518748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-392825035137090881.kers'
[2026-05-24 08:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15040205882091518748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-392825035137090881.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:07:36] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-392825035137090881.kers
Total runtime 1 ms.
[2026-05-24 08:07:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:07:36] [INFO ] Invariant cache hit.
[2026-05-24 08:07:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 121/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 144/163 places, 121/139 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((p0||X(p1))))) U G(p2)))'
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-03
Product exploration explored 100000 steps with 16687 reset in 74 ms.
Stack based approach found an accepted trace after 5289 steps with 882 reset with depth 5 and stack size 5 in 8 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-03 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(p1&&F(p0))))&&F(G(p2)))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Graph (trivial) has 86 edges and 163 vertex of which 6 / 163 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 322 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 155 transition count 110
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 134 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 133 transition count 109
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 46 place count 133 transition count 80
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 110 place count 98 transition count 80
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 89 transition count 71
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 89 transition count 71
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 202 place count 51 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 50 transition count 38
Applied a total of 204 rules in 15 ms. Remains 50 /163 variables (removed 113) and now considering 38/139 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1409302018308764762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7148036227645070216.kers'
[2026-05-24 08:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1409302018308764762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7148036227645070216.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 49 cols 177 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-24 08:07:36] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7148036227645070216.kers
Total runtime 0 ms.
[2026-05-24 08:07:37] [INFO ] Implicit Places using invariants in 286 ms returned [4, 9, 10, 11, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 287 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/163 places, 38/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 45/163 places, 38/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(p1&&F(p0))))&&F(G(p2)))))'
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-04
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-04 finished in 422 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 ((X(X(p0))&&G(p1))||X(X(G(p0))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 149 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 126
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 144 transition count 121
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 144 transition count 121
Applied a total of 37 rules in 12 ms. Remains 144 /163 variables (removed 19) and now considering 121/139 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12774811873511521209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17659117866369413996.kers'
[2026-05-24 08:07:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12774811873511521209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17659117866369413996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:07:37] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17659117866369413996.kers
Total runtime 1 ms.
[2026-05-24 08:07:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 08:07:37] [INFO ] Invariant cache hit.
[2026-05-24 08:07:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 121/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 144/163 places, 121/139 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 (X(X(G(p0)))||(X(X(p0))&&G(p1)))))'
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-06
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-06 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X((p1 U p2)))&&(p3||X(X(F(p3))))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 152 transition count 129
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 152 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 148 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 148 transition count 125
Applied a total of 29 rules in 9 ms. Remains 148 /163 variables (removed 15) and now considering 125/139 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3149129523281593373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4697534882885281336.kers'
[2026-05-24 08:07:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3149129523281593373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4697534882885281336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 148 cols 359 entries
Finished phase 1 with 108 SingleSign rule and 12 generalized
[2026-05-24 08:07:37] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4697534882885281336.kers
Total runtime 1 ms.
[2026-05-24 08:07:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 08:07:37] [INFO ] Invariant cache hit.
[2026-05-24 08:07:38] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 08:07:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 125/273 variables, 148/211 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (OVERLAPS) 0/273 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 217 constraints, problems are : Problem set: 0 solved, 124 unsolved in 14441 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 125/273 variables, 148/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 124/339 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 390 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44461ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 44462ms
Starting structural reductions in LTL mode, iteration 1 : 148/163 places, 125/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44643 ms. Remains : 148/163 places, 125/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X((p1 U p2)))&&(p3||X(X(F(p3))))))))'
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), true, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-07 finished in 44955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 149 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 126
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 144 transition count 121
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 144 transition count 121
Applied a total of 37 rules in 9 ms. Remains 144 /163 variables (removed 19) and now considering 121/139 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13103008287283579314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6796871350485138992.kers'
[2026-05-24 08:08:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13103008287283579314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6796871350485138992.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:08:22] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6796871350485138992.kers
Total runtime 0 ms.
[2026-05-24 08:08:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 08:08:22] [INFO ] Invariant cache hit.
[2026-05-24 08:08:22] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2026-05-24 08:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 202 constraints, problems are : Problem set: 0 solved, 120 unsolved in 11983 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 120/321 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 340 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 42004ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 42005ms
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 121/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42168 ms. Remains : 144/163 places, 121/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3008 steps with 28 reset in 13 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-09 finished in 42336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&F(X(p0))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 149 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 126
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 145 transition count 122
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 145 transition count 122
Applied a total of 35 rules in 4 ms. Remains 145 /163 variables (removed 18) and now considering 122/139 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1504164375643930876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18003379587134800067.kers'
[2026-05-24 08:09:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1504164375643930876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18003379587134800067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 145 cols 353 entries
Finished phase 1 with 105 SingleSign rule and 12 generalized
[2026-05-24 08:09:05] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18003379587134800067.kers
Total runtime 1 ms.
[2026-05-24 08:09:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 08:09:05] [INFO ] Invariant cache hit.
[2026-05-24 08:09:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 08:09:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/267 variables, 145/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 195 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10430 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/267 variables, 145/198 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 121/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 338 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40456ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 40458ms
Starting structural reductions in LTL mode, iteration 1 : 145/163 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40629 ms. Remains : 145/163 places, 122/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&F(X(p0))))'
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) p1), true, p1, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-11
Stuttering criterion allowed to conclude after 182 steps with 1 reset in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-11 finished in 40766 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 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Graph (trivial) has 84 edges and 163 vertex of which 6 / 163 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 322 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 155 transition count 111
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 135 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 134 transition count 110
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 44 place count 134 transition count 81
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 107 place count 100 transition count 81
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 118 place count 89 transition count 70
Iterating global reduction 3 with 11 rules applied. Total rules applied 129 place count 89 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 129 place count 89 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 88 transition count 69
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 199 place count 53 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 52 transition count 39
Applied a total of 201 rules in 24 ms. Remains 52 /163 variables (removed 111) and now considering 39/139 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11579645942436303795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15348887867386347111.kers'
[2026-05-24 08:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11579645942436303795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15348887867386347111.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 52 cols 185 entries
Finished phase 1 with 29 SingleSign rule and 2 generalized
[2026-05-24 08:09:45] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15348887867386347111.kers
Total runtime 0 ms.
[2026-05-24 08:09:45] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 41 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/163 places, 39/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 47/163 places, 39/139 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 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-12 finished in 126 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||X(F((p0&&X(X(X(F(p1)))))))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Graph (trivial) has 85 edges and 163 vertex of which 6 / 163 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 322 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 155 transition count 110
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 134 transition count 110
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 44 place count 134 transition count 83
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 104 place count 101 transition count 83
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 91 transition count 73
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 91 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 91 transition count 72
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 126 place count 90 transition count 72
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 200 place count 52 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 51 transition count 39
Applied a total of 202 rules in 21 ms. Remains 51 /163 variables (removed 112) and now considering 39/139 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14826497512611744775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8873164688844267643.kers'
[2026-05-24 08:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14826497512611744775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8873164688844267643.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 50 cols 177 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-24 08:09:46] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8873164688844267643.kers
Total runtime 0 ms.
[2026-05-24 08:09:46] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 7, 8, 9, 14]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 35 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/163 places, 39/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 45/163 places, 39/139 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||X(F((p0&&X(X(X(F(p1)))))))))))'
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-13 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(X(p1))) U X(X(X(p2)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 149 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 126
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 145 transition count 122
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 145 transition count 122
Applied a total of 35 rules in 6 ms. Remains 145 /163 variables (removed 18) and now considering 122/139 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11395835494515348325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2935476774309613004.kers'
[2026-05-24 08:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11395835494515348325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2935476774309613004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 145 cols 353 entries
Finished phase 1 with 105 SingleSign rule and 12 generalized
[2026-05-24 08:09:46] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2935476774309613004.kers
Total runtime 1 ms.
[2026-05-24 08:09:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 08:09:46] [INFO ] Invariant cache hit.
[2026-05-24 08:09:46] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 145/163 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 145/163 places, 122/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(X(p1))) U X(X(X(p2)))))'
Stuttering acceptance computed with spot in 640 ms :[(NOT p2), false, (NOT p2), false, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-14
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-14 finished in 859 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(F(p0))))))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 139/139 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 148 transition count 125
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 148 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 143 transition count 120
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 143 transition count 120
Applied a total of 39 rules in 6 ms. Remains 143 /163 variables (removed 20) and now considering 120/139 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4416600536779642319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3575618171208409426.kers'
[2026-05-24 08:09:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4416600536779642319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3575618171208409426.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 143 cols 349 entries
Finished phase 1 with 103 SingleSign rule and 12 generalized
[2026-05-24 08:09:47] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3575618171208409426.kers
Total runtime 1 ms.
[2026-05-24 08:09:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 08:09:47] [INFO ] Invariant cache hit.
[2026-05-24 08:09:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 08:09:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 120/263 variables, 143/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11122 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 119/318 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 337 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 41146ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 41149ms
Starting structural reductions in LTL mode, iteration 1 : 143/163 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41301 ms. Remains : 143/163 places, 120/139 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(F(p0))))))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-15 finished in 41524 ms.
All properties solved by simple procedures.
Total runtime 370321 ms.

BK_STOP 1779610228639

--------------------
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-01"
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-01, 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-177946842000452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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