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-177946842100603.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BusinessProcesses-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 192K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779629726838

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 13:35:27] [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 13:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:35:28] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-24 13:35:28] [INFO ] Transformed 782 places.
[2026-05-24 13:35:28] [INFO ] Transformed 697 transitions.
[2026-05-24 13:35:28] [INFO ] Found NUPN structural information;
[2026-05-24 13:35:28] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 114 place count 605 transition count 538
Iterating global reduction 1 with 100 rules applied. Total rules applied 214 place count 605 transition count 538
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 266 place count 553 transition count 486
Iterating global reduction 1 with 52 rules applied. Total rules applied 318 place count 553 transition count 486
Applied a total of 318 rules in 153 ms. Remains 553 /719 variables (removed 166) and now considering 486/638 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1500785178696128920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3093837490462134168.kers'
[2026-05-24 13:35:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1500785178696128920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3093837490462134168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 486 rows 553 cols 1541 entries
Finished phase 1 with 367 SingleSign rule and 79 generalized
[2026-05-24 13:35:28] [INFO ] Computed 107 invariants in 2 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3093837490462134168.kers
Total runtime 4 ms.
[2026-05-24 13:35:29] [INFO ] Implicit Places using invariants in 550 ms returned []
[2026-05-24 13:35:29] [INFO ] Invariant cache hit.
[2026-05-24 13:35:30] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2026-05-24 13:35:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1039 variables, and 167 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 485 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Problem TDEAD467 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 20/287 constraints. Problems are: Problem set: 1 solved, 484 unsolved
SMT process timed out in 60311ms, After SMT, problems are : Problem set: 1 solved, 484 unsolved
Search for dead transitions found 1 dead transitions in 60328ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 553/719 places, 485/638 transitions.
Applied a total of 0 rules in 71 ms. Remains 553 /553 variables (removed 0) and now considering 485/485 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62157 ms. Remains : 553/719 places, 485/638 transitions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Applied a total of 0 rules in 19 ms. Remains 553 /553 variables (removed 0) and now considering 485/485 (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-9995214955765033866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13464558229314929526.kers'
[2026-05-24 13:36:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9995214955765033866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13464558229314929526.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 485 rows 553 cols 1535 entries
Finished phase 1 with 367 SingleSign rule and 79 generalized
[2026-05-24 13:36:30] [INFO ] Computed 107 invariants in 3 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13464558229314929526.kers
Total runtime 4 ms.
[2026-05-24 13:36:30] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-24 13:36:30] [INFO ] Invariant cache hit.
[2026-05-24 13:36:31] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
Running 484 sub problems to find dead transitions.
[2026-05-24 13:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1038 variables, and 167 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1038 variables, and 287 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 0/484 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in LTL mode , in 1 iterations and 61369 ms. Remains : 553/553 places, 485/485 transitions.
Support contains 38 out of 553 places after structural reductions.
[2026-05-24 13:37:32] [INFO ] Flatten gal took : 61 ms
[2026-05-24 13:37:32] [INFO ] Flatten gal took : 30 ms
[2026-05-24 13:37:32] [INFO ] Input system was already deterministic with 485 transitions.
RANDOM walk for 40000 steps (196 resets) in 1389 ms. (28 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (34 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 104 ms. (380 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (36 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
[2026-05-24 13:37:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 113/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/479 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 67/546 variables, 18/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 480/1026 variables, 546/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/1037 variables, 6/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1037 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1038 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1038 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1038 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1038/1038 variables, and 660 constraints, problems are : Problem set: 0 solved, 4 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 553/553 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 113/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/479 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 67/546 variables, 18/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1038 variables, and 134 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5549ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 485/485 transitions.
Graph (trivial) has 259 edges and 553 vertex of which 6 / 553 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 1222 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 546 transition count 406
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 476 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 475 transition count 405
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 144 place count 475 transition count 295
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 386 place count 343 transition count 295
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 396 place count 333 transition count 285
Iterating global reduction 3 with 10 rules applied. Total rules applied 406 place count 333 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 406 place count 333 transition count 284
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 408 place count 332 transition count 284
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 684 place count 192 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 688 place count 190 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 690 place count 190 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 692 place count 188 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 187 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 694 place count 186 transition count 152
Applied a total of 694 rules in 118 ms. Remains 186 /553 variables (removed 367) and now considering 152/485 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 186/553 places, 152/485 transitions.
RANDOM walk for 39373 steps (1889 resets) in 1012 ms. (38 steps per ms) remains 0/4 properties
Computed a total of 484 stabilizing places and 426 stable transitions
Graph (complete) has 1229 edges and 553 vertex of which 551 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 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))'
Support contains 3 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 540 transition count 472
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 538 transition count 470
Applied a total of 30 rules in 73 ms. Remains 538 /553 variables (removed 15) and now considering 470/485 (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-12445806367080115333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3523163334945393447.kers'
[2026-05-24 13:37:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12445806367080115333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3523163334945393447.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 470 rows 538 cols 1505 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:37:39] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-3523163334945393447.kers
Total runtime 11 ms.
[2026-05-24 13:37:39] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-24 13:37:39] [INFO ] Invariant cache hit.
[2026-05-24 13:37:40] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2026-05-24 13:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1008 variables, and 167 constraints, problems are : Problem set: 3 solved, 466 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 3 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 3 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 3 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 3 solved, 466 unsolved
Problem TDEAD409 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 4 solved, 465 unsolved
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 7 solved, 462 unsolved
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 14 solved, 455 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 14 solved, 455 unsolved
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 14 solved, 455 unsolved
Search for dead transitions found 14 dead transitions in 60166ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/553 places, 456/485 transitions.
Applied a total of 0 rules in 14 ms. Remains 538 /538 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61563 ms. Remains : 538/553 places, 456/485 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))'
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 470 stabilizing places and 398 stable transitions
Graph (complete) has 1179 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 398 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLCardinality-02 finished in 62418 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))'
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 541 transition count 473
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 541 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 540 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 540 transition count 472
Applied a total of 26 rules in 40 ms. Remains 540 /553 variables (removed 13) and now considering 472/485 (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-5279089653097568533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14210871054041053080.kers'
[2026-05-24 13:38:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5279089653097568533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14210871054041053080.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 472 rows 540 cols 1509 entries
Finished phase 1 with 354 SingleSign rule and 79 generalized
[2026-05-24 13:38:41] [INFO ] Computed 107 invariants in 7 ms
Computed 107 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14210871054041053080.kers
Total runtime 9 ms.
[2026-05-24 13:38:42] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 13:38:42] [INFO ] Invariant cache hit.
[2026-05-24 13:38:43] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-24 13:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30144ms
Starting structural reductions in LTL mode, iteration 1 : 540/553 places, 472/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31456 ms. Remains : 540/553 places, 472/485 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))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-05 finished in 31581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (p1||G(!p0))))))'
Support contains 5 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 543 transition count 475
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 541 transition count 473
Applied a total of 24 rules in 34 ms. Remains 541 /553 variables (removed 12) and now considering 473/485 (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-7737714079208267318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12774481017184279403.kers'
[2026-05-24 13:39:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7737714079208267318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12774481017184279403.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 473 rows 541 cols 1511 entries
Finished phase 1 with 355 SingleSign rule and 79 generalized
[2026-05-24 13:39:13] [INFO ] Computed 107 invariants in 8 ms
Computed 107 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12774481017184279403.kers
Total runtime 9 ms.
[2026-05-24 13:39:13] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-24 13:39:13] [INFO ] Invariant cache hit.
[2026-05-24 13:39:14] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 13:39:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 30108ms
Starting structural reductions in LTL mode, iteration 1 : 541/553 places, 473/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31438 ms. Remains : 541/553 places, 473/485 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-06 finished in 31625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Graph (trivial) has 266 edges and 553 vertex of which 6 / 553 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 545 transition count 403
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 472 transition count 403
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 148 place count 472 transition count 289
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 398 place count 336 transition count 289
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 411 place count 323 transition count 276
Iterating global reduction 2 with 13 rules applied. Total rules applied 424 place count 323 transition count 276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 424 place count 323 transition count 275
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 426 place count 322 transition count 275
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 698 place count 184 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 702 place count 182 transition count 148
Applied a total of 702 rules in 59 ms. Remains 182 /553 variables (removed 371) and now considering 148/485 (removed 337) transitions.
[2026-05-24 13:39:45] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13904349397137222032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5966885201261660181.kers'
[2026-05-24 13:39:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13904349397137222032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5966885201261660181.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 146 rows 181 cols 929 entries
Finished phase 1 with 59 SingleSign rule and 42 generalized
[2026-05-24 13:39:45] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5966885201261660181.kers
Total runtime 2 ms.
[2026-05-24 13:39:45] [INFO ] Implicit Places using invariants in 163 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 165 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/553 places, 148/485 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 158/553 places, 148/485 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 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-07 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(!p0)||(!p0&&F(p1)))))||(F((G(!p0)||(!p0&&F(p1))))&&(X(!p2) U ((p3&&X(!p2))||X(G(!p2))))))))'
Support contains 6 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 543 transition count 475
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 541 transition count 473
Applied a total of 24 rules in 50 ms. Remains 541 /553 variables (removed 12) and now considering 473/485 (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-15222171718176909453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13390102206047517083.kers'
[2026-05-24 13:39:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15222171718176909453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13390102206047517083.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 473 rows 541 cols 1511 entries
Finished phase 1 with 355 SingleSign rule and 79 generalized
[2026-05-24 13:39:45] [INFO ] Computed 107 invariants in 8 ms
Computed 107 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13390102206047517083.kers
Total runtime 9 ms.
[2026-05-24 13:39:45] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 13:39:45] [INFO ] Invariant cache hit.
[2026-05-24 13:39:46] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 541/553 places, 473/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1324 ms. Remains : 541/553 places, 473/485 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)||(F(p2)&&p1))))||(F((G(p0)||(F(p2)&&p3)))&&(X(!p4) U ((p5&&X(!p4))||X(G(!p4))))))))'
Stuttering acceptance computed with spot in 608 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) p4), false, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) p4), false, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p0) (NOT p1) p4)), false, (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-08
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-08 finished in 2067 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(p1)&&F(p2))))'
Support contains 6 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Graph (trivial) has 261 edges and 553 vertex of which 6 / 553 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 1223 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 545 transition count 405
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 474 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 473 transition count 404
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 146 place count 473 transition count 294
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 385 place count 344 transition count 294
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 397 place count 332 transition count 282
Iterating global reduction 3 with 12 rules applied. Total rules applied 409 place count 332 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 409 place count 332 transition count 281
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 411 place count 331 transition count 281
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 681 place count 194 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 685 place count 192 transition count 155
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 691 place count 192 transition count 155
Applied a total of 691 rules in 69 ms. Remains 192 /553 variables (removed 361) and now considering 155/485 (removed 330) transitions.
[2026-05-24 13:39:47] [INFO ] Flow matrix only has 154 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8162375788959187873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14986055272205436817.kers'
[2026-05-24 13:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8162375788959187873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14986055272205436817.kers]
Normalized transition count is 153 out of 154 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 153 rows 191 cols 916 entries
Finished phase 1 with 51 SingleSign rule and 57 generalized
[2026-05-24 13:39:47] [INFO ] Computed 84 invariants in 1 ms
Computed 84 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14986055272205436817.kers
Total runtime 2 ms.
[2026-05-24 13:39:47] [INFO ] Implicit Places using invariants in 172 ms returned [27, 28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 52, 53, 54, 55, 59, 60, 61, 62, 63, 161, 165]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 173 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/553 places, 155/485 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 165/553 places, 155/485 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(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-09 finished in 473 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&&F(p1)&&X(p0))))&&(p2 U X(p2))))'
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 541 transition count 473
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 539 transition count 471
Applied a total of 28 rules in 38 ms. Remains 539 /553 variables (removed 14) and now considering 471/485 (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-6964213281198377009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-982376236254677351.kers'
[2026-05-24 13:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6964213281198377009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-982376236254677351.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 539 cols 1507 entries
Finished phase 1 with 353 SingleSign rule and 79 generalized
[2026-05-24 13:39:47] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-982376236254677351.kers
Total runtime 11 ms.
[2026-05-24 13:39:48] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-24 13:39:48] [INFO ] Invariant cache hit.
[2026-05-24 13:39:49] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1010 variables, and 167 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 470 unsolved
SMT process timed out in 60144ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 539/553 places, 471/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61528 ms. Remains : 539/553 places, 471/485 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&&F(p1)&&X(p0))))&&(p2 U X(p2))))'
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-13 finished in 61906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p2)||p1) U p3)))'
Support contains 6 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 541 transition count 473
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 539 transition count 471
Applied a total of 28 rules in 38 ms. Remains 539 /553 variables (removed 14) and now considering 471/485 (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-17480305746189615482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7399011891616755697.kers'
[2026-05-24 13:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17480305746189615482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7399011891616755697.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 539 cols 1507 entries
Finished phase 1 with 353 SingleSign rule and 79 generalized
[2026-05-24 13:40:49] [INFO ] Computed 107 invariants in 5 ms
Computed 107 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7399011891616755697.kers
Total runtime 7 ms.
[2026-05-24 13:40:50] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-24 13:40:50] [INFO ] Invariant cache hit.
[2026-05-24 13:40:50] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 539/553 places, 471/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1246 ms. Remains : 539/553 places, 471/485 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p2)||p1) U p3)))'
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-14
Product exploration explored 100000 steps with 1282 reset in 168 ms.
Stack based approach found an accepted trace after 856 steps with 12 reset with depth 6 and stack size 6 in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-14 finished in 1691 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 (F(p2) U p3)) U (G((p1 U (F(p2) U p3)))||(!p4&&(p1 U (F(p2) U p3)))))))'
Support contains 8 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 485/485 transitions.
Graph (trivial) has 260 edges and 553 vertex of which 6 / 553 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 1223 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 545 transition count 407
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 476 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 475 transition count 406
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 142 place count 475 transition count 293
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 389 place count 341 transition count 293
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 399 place count 331 transition count 283
Iterating global reduction 3 with 10 rules applied. Total rules applied 409 place count 331 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 409 place count 331 transition count 282
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 411 place count 330 transition count 282
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 685 place count 191 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 689 place count 189 transition count 154
Applied a total of 689 rules in 49 ms. Remains 189 /553 variables (removed 364) and now considering 154/485 (removed 331) transitions.
[2026-05-24 13:40:51] [INFO ] Flow matrix only has 153 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14214471077925366542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2949836293937489831.kers'
[2026-05-24 13:40:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14214471077925366542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2949836293937489831.kers]
Normalized transition count is 152 out of 153 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 152 rows 188 cols 994 entries
Finished phase 1 with 61 SingleSign rule and 46 generalized
[2026-05-24 13:40:51] [INFO ] Computed 82 invariants in 3 ms
Computed 82 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2949836293937489831.kers
Total runtime 4 ms.
[2026-05-24 13:40:51] [INFO ] Implicit Places using invariants in 156 ms returned [27, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58, 61, 157]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 157 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/553 places, 154/485 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 166/553 places, 154/485 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 (F(p2) U p3)) U (G((p1 U (F(p2) U p3)))||(!p4&&(p1 U (F(p2) U p3)))))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p2), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-15 finished in 510 ms.
All properties solved by simple procedures.
Total runtime 323891 ms.

BK_STOP 1779630051931

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "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 ;