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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
593.075 195701.00 257090.00 2006.30 FTFTTFFFFFFTFFFF 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-177946842000515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BusinessProcesses-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 9.7K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 104K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779615623958

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 09:40:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 09:40:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:40:25] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-24 09:40:25] [INFO ] Transformed 403 places.
[2026-05-24 09:40:25] [INFO ] Transformed 374 transitions.
[2026-05-24 09:40:25] [INFO ] Found NUPN structural information;
[2026-05-24 09:40:25] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 52 place count 351 transition count 323
Iterating global reduction 1 with 51 rules applied. Total rules applied 103 place count 351 transition count 323
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 124 place count 330 transition count 302
Iterating global reduction 1 with 21 rules applied. Total rules applied 145 place count 330 transition count 302
Applied a total of 145 rules in 101 ms. Remains 330 /403 variables (removed 73) and now considering 302/374 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5199077277505136230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1942605930769555076.kers'
[2026-05-24 09:40:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5199077277505136230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1942605930769555076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 330 cols 1003 entries
Finished phase 1 with 217 SingleSign rule and 49 generalized
[2026-05-24 09:40:25] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1942605930769555076.kers
Total runtime 3 ms.
[2026-05-24 09:40:26] [INFO ] Implicit Places using invariants in 401 ms returned []
[2026-05-24 09:40:26] [INFO ] Invariant cache hit.
[2026-05-24 09:40:26] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2026-05-24 09:40:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/330 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 20/84 constraints. Problems are: Problem set: 3 solved, 298 unsolved
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 20/104 constraints. Problems are: Problem set: 8 solved, 293 unsolved
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 20/124 constraints. Problems are: Problem set: 17 solved, 284 unsolved
Problem TDEAD235 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 20/144 constraints. Problems are: Problem set: 18 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 20/164 constraints. Problems are: Problem set: 18 solved, 283 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 20/184 constraints. Problems are: Problem set: 22 solved, 279 unsolved
SMT process timed out in 30176ms, After SMT, problems are : Problem set: 22 solved, 279 unsolved
Search for dead transitions found 22 dead transitions in 30190ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 330/403 places, 280/374 transitions.
Applied a total of 0 rules in 9 ms. Remains 330 /330 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31342 ms. Remains : 330/403 places, 280/374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 280/280 transitions.
Applied a total of 0 rules in 19 ms. Remains 330 /330 variables (removed 0) and now considering 280/280 (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-12435120399352632595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6472692794938793046.kers'
[2026-05-24 09:40:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12435120399352632595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6472692794938793046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 330 cols 871 entries
Finished phase 1 with 215 SingleSign rule and 51 generalized
[2026-05-24 09:40:56] [INFO ] Computed 64 invariants in 5 ms
Computed 64 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6472692794938793046.kers
Total runtime 7 ms.
[2026-05-24 09:40:57] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-24 09:40:57] [INFO ] Invariant cache hit.
[2026-05-24 09:40:57] [INFO ] Implicit Places using invariants and state equation in 360 ms returned [81, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 550 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 328/330 places, 280/280 transitions.
Applied a total of 0 rules in 9 ms. Remains 328 /328 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 328/330 places, 280/280 transitions.
Support contains 33 out of 328 places after structural reductions.
[2026-05-24 09:40:57] [INFO ] Flatten gal took : 66 ms
[2026-05-24 09:40:57] [INFO ] Flatten gal took : 20 ms
[2026-05-24 09:40:57] [INFO ] Input system was already deterministic with 280 transitions.
RANDOM walk for 40000 steps (417 resets) in 783 ms. (51 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (73 resets) in 172 ms. (231 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (86 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7351534160770443936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1376808043005617085.kers'
[2026-05-24 09:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7351534160770443936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1376808043005617085.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 328 cols 867 entries
Finished phase 1 with 217 SingleSign rule and 49 generalized
[2026-05-24 09:40:58] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1376808043005617085.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/222 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/305 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/325 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 278/603 variables, 325/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/608 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/222 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 83/305 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/325 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 278/603 variables, 325/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/608 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/608 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/608 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1462ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 152 edges and 328 vertex of which 6 / 328 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 702 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 322 transition count 238
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 288 transition count 238
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 70 place count 288 transition count 170
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 216 place count 210 transition count 170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 224 place count 202 transition count 162
Iterating global reduction 2 with 8 rules applied. Total rules applied 232 place count 202 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 232 place count 202 transition count 160
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 236 place count 200 transition count 160
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 391 place count 121 transition count 84
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 393 place count 120 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 395 place count 120 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 397 place count 118 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 398 place count 118 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 117 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 116 transition count 84
Applied a total of 400 rules in 78 ms. Remains 116 /328 variables (removed 212) and now considering 84/280 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 116/328 places, 84/280 transitions.
RANDOM walk for 37198 steps (2406 resets) in 278 ms. (133 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-09-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-09-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 195 stabilizing places and 177 stable transitions
Graph (complete) has 709 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 319 transition count 271
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 319 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 317 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 317 transition count 269
Applied a total of 22 rules in 36 ms. Remains 317 /328 variables (removed 11) and now considering 269/280 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8858681345696875732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14222155619515942969.kers'
[2026-05-24 09:41:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8858681345696875732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14222155619515942969.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 317 cols 845 entries
Finished phase 1 with 206 SingleSign rule and 49 generalized
[2026-05-24 09:41:00] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14222155619515942969.kers
Total runtime 1 ms.
[2026-05-24 09:41:00] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-24 09:41:00] [INFO ] Invariant cache hit.
[2026-05-24 09:41:00] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-24 09:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Problem TDEAD218 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/122 constraints. Problems are: Problem set: 3 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/142 constraints. Problems are: Problem set: 3 solved, 265 unsolved
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/162 constraints. Problems are: Problem set: 6 solved, 262 unsolved
Problem TDEAD228 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/182 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/202 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 10/212 constraints. Problems are: Problem set: 8 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/586 variables, and 215 constraints, problems are : Problem set: 8 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 153/153 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 43/56 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/62 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 153/215 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/235 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 13/248 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/268 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 4/272 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 3/275 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 1/276 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 6/282 constraints. Problems are: Problem set: 8 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/586 variables, and 282 constraints, problems are : Problem set: 8 solved, 260 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/268 constraints, Known Traps: 220/220 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 8 solved, 260 unsolved
Search for dead transitions found 8 dead transitions in 60065ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/328 places, 261/280 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 261
Applied a total of 1 rules in 7 ms. Remains 316 /317 variables (removed 1) and now considering 261/261 (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-5743696227881626051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4457416353723587847.kers'
[2026-05-24 09:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5743696227881626051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4457416353723587847.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 316 cols 795 entries
Finished phase 1 with 207 SingleSign rule and 45 generalized
[2026-05-24 09:42:00] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4457416353723587847.kers
Total runtime 2 ms.
[2026-05-24 09:42:01] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-24 09:42:01] [INFO ] Invariant cache hit.
[2026-05-24 09:42:01] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 316/328 places, 261/280 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61249 ms. Remains : 316/328 places, 261/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Stuttering acceptance computed with spot in 879 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 273 ms.
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Computed a total of 186 stabilizing places and 161 stable transitions
Graph (complete) has 675 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 186 stabilizing places and 161 stable transitions
Detected a total of 186/316 stabilizing places and 161/261 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 20 ms. Proved property starting from automaton with 7 states, 10 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 38 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLCardinality-04 finished in 62865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 153 edges and 328 vertex of which 6 / 328 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 703 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 321 transition count 237
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 286 transition count 237
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 72 place count 286 transition count 169
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 218 place count 208 transition count 169
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 201 transition count 162
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 201 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 232 place count 201 transition count 160
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 236 place count 199 transition count 160
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 391 place count 120 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 393 place count 119 transition count 87
Applied a total of 393 rules in 55 ms. Remains 119 /328 variables (removed 209) and now considering 87/280 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12562183823495552945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17781980800082679390.kers'
[2026-05-24 09:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12562183823495552945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17781980800082679390.kers]
Normalized transition count is 86 out of 87 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 118 cols 484 entries
Finished phase 1 with 53 SingleSign rule and 17 generalized
[2026-05-24 09:42:03] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17781980800082679390.kers
Total runtime 14 ms.
[2026-05-24 09:42:03] [INFO ] Implicit Places using invariants in 196 ms returned [1, 2, 3, 11, 34, 35, 36, 37, 38, 39, 40]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 197 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/328 places, 87/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 108/328 places, 87/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-05
Product exploration explored 100000 steps with 20128 reset in 397 ms.
Product exploration explored 100000 steps with 19956 reset in 281 ms.
Computed a total of 64 stabilizing places and 58 stable transitions
Computed a total of 64 stabilizing places and 58 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 293 steps (68 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 169 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 87/87 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 87/87 (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-9050609614015402690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9657385836165514573.kers'
[2026-05-24 09:42:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9050609614015402690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9657385836165514573.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 108 cols 443 entries
Finished phase 1 with 53 SingleSign rule and 17 generalized
[2026-05-24 09:42:04] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9657385836165514573.kers
Total runtime 2 ms.
[2026-05-24 09:42:04] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-24 09:42:04] [INFO ] Invariant cache hit.
[2026-05-24 09:42:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 09:42:04] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [10, 14, 18, 20, 35, 55, 57, 63, 65, 100, 104]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 270 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/108 places, 87/87 transitions.
Graph (complete) has 323 edges and 97 vertex of which 88 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 87 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 84 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 84 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 83 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 83 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 15 place count 81 transition count 71
Applied a total of 15 rules in 12 ms. Remains 81 /97 variables (removed 16) and now considering 71/87 (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-9976537482877184935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-269328412245338738.kers'
[2026-05-24 09:42:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9976537482877184935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-269328412245338738.kers]
Normalized transition count is 70 out of 71 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 81 cols 307 entries
Finished phase 1 with 45 SingleSign rule and 11 generalized
[2026-05-24 09:42:04] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-269328412245338738.kers
Total runtime 1 ms.
[2026-05-24 09:42:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 09:42:04] [INFO ] Invariant cache hit.
[2026-05-24 09:42:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 09:42:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/108 places, 71/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 455 ms. Remains : 80/108 places, 71/87 transitions.
Computed a total of 36 stabilizing places and 42 stable transitions
Computed a total of 36 stabilizing places and 42 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 570 steps (149 resets) in 12 ms. (43 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 175 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20627 reset in 145 ms.
Product exploration explored 100000 steps with 20645 reset in 134 ms.
Built C files in :
/tmp/ltsmin8471157868307451511
[2026-05-24 09:42:05] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2026-05-24 09:42:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:42:05] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2026-05-24 09:42:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:42:05] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2026-05-24 09:42:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:42:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8471157868307451511
Running compilation step : cd /tmp/ltsmin8471157868307451511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin8471157868307451511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8471157868307451511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6949870982374649727.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-09-LTLCardinality-05 finished in 2661 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)&&F(!p0)))||(F(p0)&&F(!p0)&&F(!p1))))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 150 edges and 328 vertex of which 6 / 328 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 703 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 321 transition count 238
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 287 transition count 238
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 70 place count 287 transition count 172
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 212 place count 211 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 218 place count 205 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 224 place count 205 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 224 place count 205 transition count 164
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 228 place count 203 transition count 164
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 382 place count 125 transition count 88
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 384 place count 124 transition count 91
Applied a total of 384 rules in 34 ms. Remains 124 /328 variables (removed 204) and now considering 91/280 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11887815906170446993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15286435259506301137.kers'
[2026-05-24 09:42:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11887815906170446993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15286435259506301137.kers]
Normalized transition count is 90 out of 91 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 90 rows 123 cols 490 entries
Finished phase 1 with 53 SingleSign rule and 21 generalized
[2026-05-24 09:42:05] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15286435259506301137.kers
Total runtime 1 ms.
[2026-05-24 09:42:05] [INFO ] Implicit Places using invariants in 94 ms returned [1, 2, 3, 4, 13, 36, 37, 38, 39, 40, 41, 42]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 95 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/328 places, 91/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 112/328 places, 91/280 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)&&F(!p0)))||(F(p0)&&F(!p0)&&F(p1))))'
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), p0, (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-06 finished in 404 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 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 152 edges and 328 vertex of which 6 / 328 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 703 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 321 transition count 238
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 287 transition count 238
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 70 place count 287 transition count 171
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 213 place count 211 transition count 171
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 221 place count 203 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 229 place count 203 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 229 place count 203 transition count 161
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 233 place count 201 transition count 161
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 390 place count 121 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 120 transition count 87
Applied a total of 392 rules in 25 ms. Remains 120 /328 variables (removed 208) and now considering 87/280 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12354488366257436356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1824943796845658077.kers'
[2026-05-24 09:42:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12354488366257436356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1824943796845658077.kers]
Normalized transition count is 86 out of 87 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 119 cols 486 entries
Finished phase 1 with 53 SingleSign rule and 17 generalized
[2026-05-24 09:42:06] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1824943796845658077.kers
Total runtime 2 ms.
[2026-05-24 09:42:06] [INFO ] Implicit Places using invariants in 92 ms returned [1, 2, 3, 11, 35, 36, 37, 38, 39, 40, 41, 42]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 93 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/328 places, 87/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 108/328 places, 87/280 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 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-07 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1))||(F(p2)&&F(p3)))))'
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 149 edges and 328 vertex of which 6 / 328 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 322 transition count 241
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 290 transition count 241
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 65 place count 290 transition count 172
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 213 place count 211 transition count 172
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 220 place count 204 transition count 165
Iterating global reduction 2 with 7 rules applied. Total rules applied 227 place count 204 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 204 transition count 163
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 231 place count 202 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 378 place count 128 transition count 90
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 380 place count 127 transition count 93
Applied a total of 380 rules in 28 ms. Remains 127 /328 variables (removed 201) and now considering 93/280 (removed 187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15251733719734345389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5467549702600958469.kers'
[2026-05-24 09:42:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15251733719734345389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5467549702600958469.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 126 cols 483 entries
Finished phase 1 with 59 SingleSign rule and 17 generalized
[2026-05-24 09:42:06] [INFO ] Computed 51 invariants in 1 ms
Computed 51 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5467549702600958469.kers
Total runtime 2 ms.
[2026-05-24 09:42:06] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 3, 14, 40, 41, 42, 43, 44, 45, 105, 107]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 97 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/328 places, 93/280 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 115/328 places, 93/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1))||(F(p2)&&F(p3)))))'
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-08
Stuttering criterion allowed to conclude after 11596 steps with 1747 reset in 53 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-08 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))&&X(X(F((G(p3)||p2))))))'
Support contains 7 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 319 transition count 271
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 319 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 316 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 316 transition count 268
Applied a total of 24 rules in 17 ms. Remains 316 /328 variables (removed 12) and now considering 268/280 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14629581088060365881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8187185822530389726.kers'
[2026-05-24 09:42:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14629581088060365881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8187185822530389726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 316 cols 843 entries
Finished phase 1 with 205 SingleSign rule and 49 generalized
[2026-05-24 09:42:06] [INFO ] Computed 62 invariants in 5 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8187185822530389726.kers
Total runtime 5 ms.
[2026-05-24 09:42:06] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-24 09:42:06] [INFO ] Invariant cache hit.
[2026-05-24 09:42:07] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-24 09:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 20/182 constraints. Problems are: Problem set: 5 solved, 262 unsolved
Problem TDEAD217 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 20/202 constraints. Problems are: Problem set: 6 solved, 261 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/584 variables, and 213 constraints, problems are : Problem set: 6 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 151/151 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 6 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 43/56 constraints. Problems are: Problem set: 6 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 6/62 constraints. Problems are: Problem set: 6 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 151/213 constraints. Problems are: Problem set: 6 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/233 constraints. Problems are: Problem set: 6 solved, 261 unsolved
Problem TDEAD225 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/253 constraints. Problems are: Problem set: 7 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/273 constraints. Problems are: Problem set: 7 solved, 260 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 19/292 constraints. Problems are: Problem set: 8 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 9/301 constraints. Problems are: Problem set: 8 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 4/305 constraints. Problems are: Problem set: 8 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 3/308 constraints. Problems are: Problem set: 8 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/584 variables, and 311 constraints, problems are : Problem set: 8 solved, 259 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 0/267 constraints, Known Traps: 249/249 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 8 solved, 259 unsolved
Search for dead transitions found 8 dead transitions in 60050ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 316/328 places, 260/280 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Applied a total of 1 rules in 16 ms. Remains 315 /316 variables (removed 1) and now considering 260/260 (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-7179695386552255800.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16557968095702860666.kers'
[2026-05-24 09:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7179695386552255800.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16557968095702860666.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 315 cols 793 entries
Finished phase 1 with 206 SingleSign rule and 45 generalized
[2026-05-24 09:43:07] [INFO ] Computed 64 invariants in 2 ms
Computed 64 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16557968095702860666.kers
Total runtime 2 ms.
[2026-05-24 09:43:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-24 09:43:07] [INFO ] Invariant cache hit.
[2026-05-24 09:43:07] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 315/328 places, 260/280 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61143 ms. Remains : 315/328 places, 260/280 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))&&X(X(F((G(p3)||p2))))))'
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-09
Product exploration explored 100000 steps with 5148 reset in 143 ms.
Stack based approach found an accepted trace after 654 steps with 31 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-09 finished in 61580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 319 transition count 271
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 319 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 316 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 316 transition count 268
Applied a total of 24 rules in 10 ms. Remains 316 /328 variables (removed 12) and now considering 268/280 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9261040175931106512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13099395356699221938.kers'
[2026-05-24 09:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9261040175931106512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13099395356699221938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 316 cols 843 entries
Finished phase 1 with 205 SingleSign rule and 49 generalized
[2026-05-24 09:43:08] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13099395356699221938.kers
Total runtime 6 ms.
[2026-05-24 09:43:08] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-24 09:43:08] [INFO ] Invariant cache hit.
[2026-05-24 09:43:09] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-24 09:43:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 20/182 constraints. Problems are: Problem set: 3 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 20/202 constraints. Problems are: Problem set: 3 solved, 264 unsolved
SMT process timed out in 30046ms, After SMT, problems are : Problem set: 3 solved, 264 unsolved
Search for dead transitions found 3 dead transitions in 30046ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 316/328 places, 265/280 transitions.
Applied a total of 0 rules in 2 ms. Remains 316 /316 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30817 ms. Remains : 316/328 places, 265/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-14 finished in 30947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 280/280 transitions.
Graph (trivial) has 152 edges and 328 vertex of which 6 / 328 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 703 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 321 transition count 238
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 287 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 286 transition count 237
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 286 transition count 171
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 213 place count 211 transition count 171
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 220 place count 204 transition count 164
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 204 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 227 place count 204 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 202 transition count 162
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 390 place count 121 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 120 transition count 87
Applied a total of 392 rules in 23 ms. Remains 120 /328 variables (removed 208) and now considering 87/280 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17098646181849776851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4346250201484642669.kers'
[2026-05-24 09:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17098646181849776851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4346250201484642669.kers]
Normalized transition count is 86 out of 87 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 119 cols 486 entries
Finished phase 1 with 52 SingleSign rule and 18 generalized
[2026-05-24 09:43:39] [INFO ] Computed 50 invariants in 11 ms
Computed 50 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-4346250201484642669.kers
Total runtime 11 ms.
[2026-05-24 09:43:39] [INFO ] Implicit Places using invariants in 237 ms returned [1, 2, 3, 11, 34, 35, 38, 39, 40, 41, 42, 93]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 251 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/328 places, 87/280 transitions.
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 108/328 places, 87/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-15 finished in 338 ms.
All properties solved by simple procedures.
Total runtime 194468 ms.

BK_STOP 1779615819659

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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