fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r034-tall-177946842000476
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for BusinessProcesses-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
553.768 550288.00 633070.00 1152.50 FFFFFFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000476.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-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.1K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:43 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 79K 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-04-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779611102097

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 08:25:03] [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:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:25:03] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-24 08:25:03] [INFO ] Transformed 288 places.
[2026-05-24 08:25:03] [INFO ] Transformed 283 transitions.
[2026-05-24 08:25:03] [INFO ] Found NUPN structural information;
[2026-05-24 08:25:03] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 250 transition count 248
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 250 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 250 transition count 247
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 85 place count 235 transition count 232
Iterating global reduction 2 with 15 rules applied. Total rules applied 100 place count 235 transition count 232
Applied a total of 100 rules in 58 ms. Remains 235 /286 variables (removed 51) and now considering 232/281 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10231634315440436724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1309547783460237230.kers'
[2026-05-24 08:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10231634315440436724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1309547783460237230.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 235 cols 811 entries
Finished phase 1 with 149 SingleSign rule and 45 generalized
[2026-05-24 08:25:03] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1309547783460237230.kers
Total runtime 2 ms.
[2026-05-24 08:25:03] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-24 08:25:03] [INFO ] Invariant cache hit.
[2026-05-24 08:25:04] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:25:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/61 constraints. Problems are: Problem set: 17 solved, 214 unsolved
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 20/81 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD187 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 20/101 constraints. Problems are: Problem set: 25 solved, 206 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 20/121 constraints. Problems are: Problem set: 30 solved, 201 unsolved
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 20/141 constraints. Problems are: Problem set: 38 solved, 193 unsolved
Problem TDEAD190 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 9/150 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/152 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 6/158 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 4/162 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 2/164 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 2/166 constraints. Problems are: Problem set: 40 solved, 191 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 6/172 constraints. Problems are: Problem set: 40 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/467 variables, and 172 constraints, problems are : Problem set: 40 solved, 191 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 131/131 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 12/12 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 25/37 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 4/41 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 131/172 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 7/179 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 12/191 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/192 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/193 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/197 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 232/467 variables, 235/432 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 191/623 constraints. Problems are: Problem set: 40 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 2/625 constraints. Problems are: Problem set: 40 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 625 constraints, problems are : Problem set: 40 solved, 191 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 191/231 constraints, Known Traps: 158/158 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 40 solved, 191 unsolved
Search for dead transitions found 40 dead transitions in 60118ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 235/286 places, 192/281 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 231 transition count 192
Applied a total of 4 rules in 6 ms. Remains 231 /235 variables (removed 4) and now considering 192/192 (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-3528057621419187042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9555280830712575638.kers'
[2026-05-24 08:26:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3528057621419187042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9555280830712575638.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 192 rows 230 cols 561 entries
Finished phase 1 with 155 SingleSign rule and 28 generalized
[2026-05-24 08:26:04] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9555280830712575638.kers
Total runtime 2 ms.
[2026-05-24 08:26:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 08:26:04] [INFO ] Invariant cache hit.
[2026-05-24 08:26:04] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 231/286 places, 192/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61238 ms. Remains : 231/286 places, 192/281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /231 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2026-05-24 08:26:04] [INFO ] Invariant cache hit.
[2026-05-24 08:26:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 08:26:04] [INFO ] Invariant cache hit.
[2026-05-24 08:26:05] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-24 08:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 19/140 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (OVERLAPS) 192/423 variables, 231/385 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 12/397 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 398 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 119/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 192/423 variables, 231/403 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 191/594 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 601 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 131/131 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 60293 ms. Remains : 231/231 places, 192/192 transitions.
Support contains 58 out of 231 places after structural reductions.
[2026-05-24 08:27:05] [INFO ] Flatten gal took : 49 ms
[2026-05-24 08:27:05] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:27:05] [INFO ] Input system was already deterministic with 192 transitions.
Reduction of identical properties reduced properties to check from 41 to 40
RANDOM walk for 40000 steps (439 resets) in 1579 ms. (25 steps per ms) remains 5/40 properties
BEST_FIRST walk for 40003 steps (97 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (89 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
[2026-05-24 08:27:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 2 (OVERLAPS) 71/84 variables, 8/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 73/157 variables, 16/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Real declared 221/423 variables, and 48 constraints, problems are : Problem set: 5 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/231 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-04-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 208 stabilizing places and 170 stable transitions
Graph (complete) has 474 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
FORMULA BusinessProcesses-PT-04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p1||F(p2)))&&(F(p2)||G(p3)))))'
Support contains 7 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 217 transition count 179
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 217 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 214 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 214 transition count 176
Applied a total of 33 rules in 24 ms. Remains 214 /231 variables (removed 17) and now considering 176/192 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2120387569029326815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14649219334466881894.kers'
[2026-05-24 08:27:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2120387569029326815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14649219334466881894.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 214 cols 529 entries
Finished phase 1 with 139 SingleSign rule and 28 generalized
[2026-05-24 08:27:06] [INFO ] Computed 47 invariants in 1 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14649219334466881894.kers
Total runtime 2 ms.
[2026-05-24 08:27:06] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 08:27:06] [INFO ] Invariant cache hit.
[2026-05-24 08:27:07] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 08:27:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/390 variables, 214/315 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/390 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 328 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 64/111 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 176/390 variables, 214/337 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 175/512 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 521 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60034ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 60035ms
Starting structural reductions in LTL mode, iteration 1 : 214/231 places, 176/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60337 ms. Remains : 214/231 places, 176/192 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((p1||F(p2)))&&(F(p2)||G(p3)))))'
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0) p3 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-00
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 8 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-00 finished in 60817 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||(p1&&(p2 U X(p0))))))'
Support contains 3 out of 231 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 : 231/231 places, 192/192 transitions.
Graph (trivial) has 98 edges and 231 vertex of which 6 / 231 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 467 edges and 226 vertex of which 225 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 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 223 transition count 164
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 203 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 202 transition count 163
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 44 place count 202 transition count 117
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 141 place count 151 transition count 117
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 144 transition count 110
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 144 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 144 transition count 109
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 157 place count 143 transition count 109
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 264 place count 84 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 83 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 82 transition count 60
Applied a total of 266 rules in 41 ms. Remains 82 /231 variables (removed 149) and now considering 60/192 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4547562525126749847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1477446545911094795.kers'
[2026-05-24 08:28:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4547562525126749847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1477446545911094795.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 59 rows 71 cols 208 entries
Finished phase 1 with 42 SingleSign rule and 10 generalized
[2026-05-24 08:28:07] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1477446545911094795.kers
Total runtime 0 ms.
[2026-05-24 08:28:07] [INFO ] Implicit Places using invariants in 50 ms returned [0, 8, 22, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/231 places, 60/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 78/231 places, 60/192 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||((p1 U X(p0))&&p2))))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-02 finished in 157 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))&&G(((F(p1) U p2)&&(p0||X((X(p3) U (p0&&X(p3)))))))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 218 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 218 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 215 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 215 transition count 177
Applied a total of 31 rules in 25 ms. Remains 215 /231 variables (removed 16) and now considering 177/192 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-359964626355071924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12932224856326765453.kers'
[2026-05-24 08:28:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-359964626355071924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12932224856326765453.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 215 cols 531 entries
Finished phase 1 with 140 SingleSign rule and 28 generalized
[2026-05-24 08:28:07] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12932224856326765453.kers
Total runtime 1 ms.
[2026-05-24 08:28:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 08:28:07] [INFO ] Invariant cache hit.
[2026-05-24 08:28:07] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-24 08:28:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 177/392 variables, 215/306 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 16 (OVERLAPS) 0/392 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 324 constraints, problems are : Problem set: 0 solved, 176 unsolved in 26970 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 57/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 177/392 variables, 215/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 176/509 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 176 unsolved
SMT process timed out in 56999ms, After SMT, problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 57001ms
Starting structural reductions in LTL mode, iteration 1 : 215/231 places, 177/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57290 ms. Remains : 215/231 places, 177/192 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))&&G(((F(p1) U p2)&&(p0||X((X(p3) U (p0&&X(p3)))))))))'
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), true, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-04
Entered a terminal (fully accepting) state of product in 63 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-04 finished in 57680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p0)||X(p1))))))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 218 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 218 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 215 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 215 transition count 177
Applied a total of 31 rules in 19 ms. Remains 215 /231 variables (removed 16) and now considering 177/192 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4810475696452138357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3259101637730053380.kers'
[2026-05-24 08:29:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4810475696452138357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3259101637730053380.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 215 cols 531 entries
Finished phase 1 with 140 SingleSign rule and 28 generalized
[2026-05-24 08:29:05] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3259101637730053380.kers
Total runtime 1 ms.
[2026-05-24 08:29:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 08:29:05] [INFO ] Invariant cache hit.
[2026-05-24 08:29:05] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 215/231 places, 177/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 215/231 places, 177/192 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p0)||X(p1))))))))'
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-05 finished in 692 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&&X(!p0)) U (F(p2)&&p1)))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Graph (trivial) has 104 edges and 231 vertex of which 6 / 231 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 467 edges and 226 vertex of which 225 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 223 transition count 158
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 197 transition count 158
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 54 place count 197 transition count 115
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 144 place count 150 transition count 115
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 152 place count 142 transition count 107
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 142 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 160 place count 142 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 140 transition count 105
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 103 rules applied. Total rules applied 267 place count 83 transition count 59
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 269 place count 82 transition count 62
Applied a total of 269 rules in 43 ms. Remains 82 /231 variables (removed 149) and now considering 62/192 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11134921806233049240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18145235053387681388.kers'
[2026-05-24 08:29:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11134921806233049240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18145235053387681388.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 61 rows 81 cols 289 entries
Finished phase 1 with 35 SingleSign rule and 15 generalized
[2026-05-24 08:29:06] [INFO ] Computed 32 invariants in 0 ms
Computed 32 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18145235053387681388.kers
Total runtime 0 ms.
[2026-05-24 08:29:06] [INFO ] Implicit Places using invariants in 83 ms returned [1, 9, 10, 22, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 84 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/231 places, 62/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 76/231 places, 62/192 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&&X(!p0)) U (F(p2)&&p1)))'
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-06 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F((p2&&F(G(p3)))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 219 transition count 181
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 219 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 217 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 217 transition count 179
Applied a total of 27 rules in 18 ms. Remains 217 /231 variables (removed 14) and now considering 179/192 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17432222246372835038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3481420717317597596.kers'
[2026-05-24 08:29:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17432222246372835038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3481420717317597596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 217 cols 535 entries
Finished phase 1 with 142 SingleSign rule and 28 generalized
[2026-05-24 08:29:06] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3481420717317597596.kers
Total runtime 1 ms.
[2026-05-24 08:29:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 08:29:06] [INFO ] Invariant cache hit.
[2026-05-24 08:29:06] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-24 08:29:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 179/396 variables, 217/318 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 11/329 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 335 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 67/114 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 179/396 variables, 217/369 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 178/547 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 551 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 179/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 217/231 places, 179/192 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F((p2&&F(G(p3)))))))'
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0)), true, (NOT p1), (NOT p3), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-07 finished in 60648 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 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Graph (trivial) has 107 edges and 231 vertex of which 6 / 231 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 467 edges and 226 vertex of which 225 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 223 transition count 158
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 197 transition count 158
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 54 place count 197 transition count 112
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 152 place count 145 transition count 112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 160 place count 137 transition count 104
Iterating global reduction 2 with 8 rules applied. Total rules applied 168 place count 137 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 168 place count 137 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 135 transition count 102
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 273 place count 79 transition count 57
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 275 place count 78 transition count 60
Applied a total of 275 rules in 25 ms. Remains 78 /231 variables (removed 153) and now considering 60/192 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17341087710808425819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13752993437823017047.kers'
[2026-05-24 08:30:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17341087710808425819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13752993437823017047.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 59 rows 77 cols 277 entries
Finished phase 1 with 41 SingleSign rule and 7 generalized
[2026-05-24 08:30:06] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13752993437823017047.kers
Total runtime 0 ms.
[2026-05-24 08:30:07] [INFO ] Implicit Places using invariants in 48 ms returned [1, 7, 19, 20, 21]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/231 places, 60/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 73/231 places, 60/192 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 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-08
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-08 finished in 156 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))&&F(p1)))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 218 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 218 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 216 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 216 transition count 178
Applied a total of 29 rules in 17 ms. Remains 216 /231 variables (removed 15) and now considering 178/192 (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-6793158498824012579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17271093578551927375.kers'
[2026-05-24 08:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6793158498824012579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17271093578551927375.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 216 cols 533 entries
Finished phase 1 with 141 SingleSign rule and 28 generalized
[2026-05-24 08:30:07] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17271093578551927375.kers
Total runtime 1 ms.
[2026-05-24 08:30:07] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-24 08:30:07] [INFO ] Invariant cache hit.
[2026-05-24 08:30:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 08:30:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 18 (OVERLAPS) 178/394 variables, 216/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/394 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/394 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 345 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 82/129 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/394 variables, 216/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 177/528 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 5/533 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 533 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60023ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60023ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 178/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60327 ms. Remains : 216/231 places, 178/192 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))&&F(p1)))'
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-09 finished in 60494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F(p1))))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 219 transition count 181
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 219 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 217 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 217 transition count 179
Applied a total of 27 rules in 15 ms. Remains 217 /231 variables (removed 14) and now considering 179/192 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-696818602346780813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8938513867868906824.kers'
[2026-05-24 08:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-696818602346780813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8938513867868906824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 217 cols 535 entries
Finished phase 1 with 142 SingleSign rule and 28 generalized
[2026-05-24 08:31:07] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8938513867868906824.kers
Total runtime 1 ms.
[2026-05-24 08:31:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 08:31:07] [INFO ] Invariant cache hit.
[2026-05-24 08:31:07] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-24 08:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (OVERLAPS) 179/396 variables, 217/347 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/396 variables, and 356 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 89/136 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 179/396 variables, 217/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 178/542 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 544 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60035ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60036ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 179/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60337 ms. Remains : 217/231 places, 179/192 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F(p1))))))'
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-10
Stuttering criterion allowed to conclude after 185 steps with 1 reset in 4 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-10 finished in 60526 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((F((p0&&G(p1)))||(p2&&F(G(p3)))))))'
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 219 transition count 181
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 219 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 216 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 216 transition count 178
Applied a total of 29 rules in 10 ms. Remains 216 /231 variables (removed 15) and now considering 178/192 (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-8319845042782887208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16814067524575412745.kers'
[2026-05-24 08:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8319845042782887208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16814067524575412745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 216 cols 533 entries
Finished phase 1 with 141 SingleSign rule and 28 generalized
[2026-05-24 08:32:08] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16814067524575412745.kers
Total runtime 1 ms.
[2026-05-24 08:32:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 08:32:08] [INFO ] Invariant cache hit.
[2026-05-24 08:32:08] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 08:32:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 178/394 variables, 216/326 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 13/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 79/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (OVERLAPS) 178/394 variables, 216/370 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 177/547 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 177 unsolved
SMT process timed out in 60029ms, After SMT, problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60030ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 178/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60284 ms. Remains : 216/231 places, 178/192 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((F((p0&&G(p1)))||(p2&&F(G(p3)))))))'
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 1105 reset in 297 ms.
Product exploration explored 100000 steps with 1101 reset in 230 ms.
Computed a total of 193 stabilizing places and 156 stable transitions
Graph (complete) has 453 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 193 stabilizing places and 156 stable transitions
Detected a total of 193/216 stabilizing places and 156/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 31 factoid took 283 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (444 resets) in 378 ms. (105 steps per ms) remains 3/17 properties
BEST_FIRST walk for 36619 steps (64 resets) in 127 ms. (286 steps per ms) remains 0/3 properties
Knowledge based reduction with 31 factoid took 2749 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 3436 ms.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 178/178 transitions.
Graph (trivial) has 88 edges and 216 vertex of which 6 / 216 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 210 transition count 157
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 196 transition count 157
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 29 place count 196 transition count 110
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 128 place count 144 transition count 110
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 237 place count 84 transition count 61
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 239 place count 83 transition count 64
Applied a total of 239 rules in 19 ms. Remains 83 /216 variables (removed 133) and now considering 64/178 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17954594358162675265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6313281033262728697.kers'
[2026-05-24 08:33:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17954594358162675265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6313281033262728697.kers]
Normalized transition count is 63 out of 64 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 63 rows 82 cols 295 entries
Finished phase 1 with 43 SingleSign rule and 9 generalized
[2026-05-24 08:33:12] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6313281033262728697.kers
Total runtime 0 ms.
[2026-05-24 08:33:12] [INFO ] Implicit Places using invariants in 51 ms returned [1, 8, 23, 24, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 52 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/216 places, 64/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 78/216 places, 64/178 transitions.
Computed a total of 71 stabilizing places and 57 stable transitions
Graph (complete) has 259 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 71 stabilizing places and 57 stable transitions
Detected a total of 71/78 stabilizing places and 57/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 26 factoid took 396 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 9513 steps (1033 resets) in 136 ms. (69 steps per ms) remains 0/17 properties
Knowledge based reduction with 26 factoid took 1042 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 1706 ms.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering criterion allowed to conclude after 313 steps with 28 reset in 3 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-11 finished in 66937 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&&(p1 U X(G((p2 U p3)))))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 192/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 192
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 218 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 218 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 215 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 215 transition count 177
Applied a total of 31 rules in 7 ms. Remains 215 /231 variables (removed 16) and now considering 177/192 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4816686410528681371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8818191810893507210.kers'
[2026-05-24 08:33:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4816686410528681371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8818191810893507210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 215 cols 531 entries
Finished phase 1 with 140 SingleSign rule and 28 generalized
[2026-05-24 08:33:15] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8818191810893507210.kers
Total runtime 1 ms.
[2026-05-24 08:33:15] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 08:33:15] [INFO ] Invariant cache hit.
[2026-05-24 08:33:15] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-24 08:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 177/392 variables, 215/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 16 (OVERLAPS) 0/392 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 346 constraints, problems are : Problem set: 0 solved, 176 unsolved in 26686 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 177/392 variables, 215/356 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 176/532 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 176 unsolved
SMT process timed out in 56709ms, After SMT, problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 56709ms
Starting structural reductions in LTL mode, iteration 1 : 215/231 places, 177/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57023 ms. Remains : 215/231 places, 177/192 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&&(p1 U X(G((p2 U p3)))))))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-14
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-14 finished in 57270 ms.
All properties solved by simple procedures.
Total runtime 549081 ms.

BK_STOP 1779611652385

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

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