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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 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 148K 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779620031103

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 10:53:52] [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 10:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:53:52] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 10:53:52] [INFO ] Transformed 593 places.
[2026-05-24 10:53:52] [INFO ] Transformed 536 transitions.
[2026-05-24 10:53:52] [INFO ] Found NUPN structural information;
[2026-05-24 10:53:52] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 203 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 2 formulas.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 92 place count 493 transition count 441
Iterating global reduction 1 with 87 rules applied. Total rules applied 179 place count 493 transition count 441
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 221 place count 451 transition count 399
Iterating global reduction 1 with 42 rules applied. Total rules applied 263 place count 451 transition count 399
Applied a total of 263 rules in 128 ms. Remains 451 /585 variables (removed 134) and now considering 399/528 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16522237405330850567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7548818350178629042.kers'
[2026-05-24 10:53:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16522237405330850567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7548818350178629042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 451 cols 1303 entries
Finished phase 1 with 290 SingleSign rule and 71 generalized
[2026-05-24 10:53:52] [INFO ] Computed 90 invariants in 2 ms
Computed 90 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7548818350178629042.kers
Total runtime 4 ms.
[2026-05-24 10:53:53] [INFO ] Implicit Places using invariants in 461 ms returned []
[2026-05-24 10:53:53] [INFO ] Invariant cache hit.
[2026-05-24 10:53:54] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2026-05-24 10:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/110 constraints. Problems are: Problem set: 15 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/130 constraints. Problems are: Problem set: 15 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/150 constraints. Problems are: Problem set: 15 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/170 constraints. Problems are: Problem set: 15 solved, 383 unsolved
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 15 solved, 383 unsolved
Search for dead transitions found 15 dead transitions in 30217ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 451/585 places, 384/528 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 384
Applied a total of 1 rules in 23 ms. Remains 450 /451 variables (removed 1) and now considering 384/384 (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-1631913732389708732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10832348790877304608.kers'
[2026-05-24 10:54:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1631913732389708732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10832348790877304608.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 450 cols 1211 entries
Finished phase 1 with 290 SingleSign rule and 69 generalized
[2026-05-24 10:54:24] [INFO ] Computed 91 invariants in 5 ms
Computed 91 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10832348790877304608.kers
Total runtime 7 ms.
[2026-05-24 10:54:24] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-24 10:54:24] [INFO ] Invariant cache hit.
[2026-05-24 10:54:25] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 450/585 places, 384/528 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33228 ms. Remains : 450/585 places, 384/528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 450 /450 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2026-05-24 10:54:25] [INFO ] Invariant cache hit.
[2026-05-24 10:54:26] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 10:54:26] [INFO ] Invariant cache hit.
[2026-05-24 10:54:27] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2026-05-24 10:54:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/450 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Problem TDEAD328 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 20/131 constraints. Problems are: Problem set: 1 solved, 382 unsolved
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 20/151 constraints. Problems are: Problem set: 5 solved, 378 unsolved
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 20/171 constraints. Problems are: Problem set: 10 solved, 373 unsolved
SMT process timed out in 30135ms, After SMT, problems are : Problem set: 10 solved, 373 unsolved
Search for dead transitions found 10 dead transitions in 30139ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 450/450 places, 374/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31332 ms. Remains : 450/450 places, 374/384 transitions.
Support contains 16 out of 450 places after structural reductions.
[2026-05-24 10:54:57] [INFO ] Flatten gal took : 54 ms
[2026-05-24 10:54:57] [INFO ] Flatten gal took : 25 ms
[2026-05-24 10:54:57] [INFO ] Input system was already deterministic with 374 transitions.
RANDOM walk for 40000 steps (286 resets) in 807 ms. (49 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (51 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (49 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (49 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (49 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8856680360433372494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4454034881979650842.kers'
[2026-05-24 10:54:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8856680360433372494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4454034881979650842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 374 rows 450 cols 1151 entries
Finished phase 1 with 289 SingleSign rule and 68 generalized
[2026-05-24 10:54:58] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4454034881979650842.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 258/372 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 66/438 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/440 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 367/807 variables, 440/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/807 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/807 variables, 5/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 11/818 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/818 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/824 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/824 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/824 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 561 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2754 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 258/372 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 66/438 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 18/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 7787ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 374/374 transitions.
Graph (trivial) has 203 edges and 450 vertex of which 6 / 450 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 971 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 444 transition count 323
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 401 transition count 323
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 88 place count 401 transition count 229
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 291 place count 292 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 292 place count 291 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 293 place count 291 transition count 228
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 538 place count 166 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 540 place count 165 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 542 place count 165 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 544 place count 163 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 545 place count 163 transition count 110
Applied a total of 545 rules in 85 ms. Remains 163 /450 variables (removed 287) and now considering 110/374 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 163/450 places, 110/374 transitions.
RANDOM walk for 40000 steps (1591 resets) in 1554 ms. (25 steps per ms) remains 1/5 properties
BEST_FIRST walk for 3282 steps (49 resets) in 10 ms. (298 steps per ms) remains 0/1 properties
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 978 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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)))'
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 446 transition count 370
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 446 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 445 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 445 transition count 369
Applied a total of 10 rules in 46 ms. Remains 445 /450 variables (removed 5) and now considering 369/374 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4192343662476149675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5074145672766422024.kers'
[2026-05-24 10:55:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4192343662476149675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5074145672766422024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 445 cols 1141 entries
Finished phase 1 with 284 SingleSign rule and 68 generalized
[2026-05-24 10:55:06] [INFO ] Computed 93 invariants in 5 ms
Computed 93 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5074145672766422024.kers
Total runtime 5 ms.
[2026-05-24 10:55:06] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-24 10:55:06] [INFO ] Invariant cache hit.
[2026-05-24 10:55:07] [INFO ] Implicit Places using invariants and state equation in 955 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/450 places, 369/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 444 /444 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1219 ms. Remains : 444/450 places, 369/374 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)))'
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 961 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 11 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLCardinality-01 finished in 2050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 446 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 446 transition count 370
Applied a total of 8 rules in 31 ms. Remains 446 /450 variables (removed 4) and now considering 370/374 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12431296619732686123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8416086214284787747.kers'
[2026-05-24 10:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12431296619732686123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8416086214284787747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 446 cols 1143 entries
Finished phase 1 with 285 SingleSign rule and 68 generalized
[2026-05-24 10:55:08] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8416086214284787747.kers
Total runtime 3 ms.
[2026-05-24 10:55:08] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 10:55:08] [INFO ] Invariant cache hit.
[2026-05-24 10:55:09] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/450 places, 370/374 transitions.
Applied a total of 0 rules in 11 ms. Remains 445 /445 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1296 ms. Remains : 445/450 places, 370/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-02
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-02 finished in 1490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U !p1)&&X(X(!(p0 U p1)))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 448 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 448 transition count 372
Applied a total of 4 rules in 20 ms. Remains 448 /450 variables (removed 2) and now considering 372/374 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1411281838922232326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7221565056364168669.kers'
[2026-05-24 10:55:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1411281838922232326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7221565056364168669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 448 cols 1147 entries
Finished phase 1 with 287 SingleSign rule and 68 generalized
[2026-05-24 10:55:09] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7221565056364168669.kers
Total runtime 3 ms.
[2026-05-24 10:55:10] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 10:55:10] [INFO ] Invariant cache hit.
[2026-05-24 10:55:11] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1341 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 447/450 places, 372/374 transitions.
Applied a total of 0 rules in 20 ms. Remains 447 /447 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1381 ms. Remains : 447/450 places, 372/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U !p1)&&X(X(!(p0 U p1)))))'
Stuttering acceptance computed with spot in 230 ms :[p1, (NOT p0), p1, p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 95 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-03 finished in 1645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Graph (trivial) has 208 edges and 450 vertex of which 6 / 450 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 972 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 443 transition count 322
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 399 transition count 322
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 90 place count 399 transition count 226
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 298 place count 287 transition count 226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 302 place count 283 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 306 place count 283 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 306 place count 283 transition count 221
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 308 place count 282 transition count 221
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 553 place count 156 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 555 place count 155 transition count 106
Applied a total of 555 rules in 48 ms. Remains 155 /450 variables (removed 295) and now considering 106/374 (removed 268) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1281488238029200229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2639784242371963710.kers'
[2026-05-24 10:55:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1281488238029200229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2639784242371963710.kers]
Normalized transition count is 105 out of 106 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 105 rows 154 cols 612 entries
Finished phase 1 with 50 SingleSign rule and 35 generalized
[2026-05-24 10:55:11] [INFO ] Computed 70 invariants in 0 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2639784242371963710.kers
Total runtime 1 ms.
[2026-05-24 10:55:11] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 3, 4, 5, 6, 15, 16, 20, 21, 22, 23, 24, 25, 44, 45, 46, 47, 48, 117]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 135 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/450 places, 106/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 135/450 places, 106/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-04 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 446 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 446 transition count 370
Applied a total of 8 rules in 31 ms. Remains 446 /450 variables (removed 4) and now considering 370/374 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14387010173677046893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14876985626171179092.kers'
[2026-05-24 10:55:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14387010173677046893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14876985626171179092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 446 cols 1143 entries
Finished phase 1 with 285 SingleSign rule and 68 generalized
[2026-05-24 10:55:11] [INFO ] Computed 93 invariants in 6 ms
Computed 93 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14876985626171179092.kers
Total runtime 7 ms.
[2026-05-24 10:55:12] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 10:55:12] [INFO ] Invariant cache hit.
[2026-05-24 10:55:13] [INFO ] Implicit Places using invariants and state equation in 998 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/450 places, 370/374 transitions.
Applied a total of 0 rules in 16 ms. Remains 445 /445 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1272 ms. Remains : 445/450 places, 370/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-06
Product exploration explored 100000 steps with 714 reset in 211 ms.
Product exploration explored 100000 steps with 719 reset in 255 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 964 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (285 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (51 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22437 steps, run visited all 1 properties in 106 ms. (steps per millisecond=211 )
Probabilistic random walk after 22437 steps, saw 9586 distinct states, run finished after 109 ms. (steps per millisecond=205 ) properties seen :1
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 491 ms.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 370/370 transitions.
Applied a total of 0 rules in 18 ms. Remains 445 /445 variables (removed 0) and now considering 370/370 (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-12537246315648250059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5070913978710801866.kers'
[2026-05-24 10:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12537246315648250059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5070913978710801866.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 445 cols 1141 entries
Finished phase 1 with 286 SingleSign rule and 67 generalized
[2026-05-24 10:55:14] [INFO ] Computed 92 invariants in 3 ms
Computed 92 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5070913978710801866.kers
Total runtime 4 ms.
[2026-05-24 10:55:14] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 10:55:14] [INFO ] Invariant cache hit.
[2026-05-24 10:55:15] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-24 10:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 70/87 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 369 unsolved
SMT process timed out in 30053ms, After SMT, problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 30055ms
Finished structural reductions in LTL mode , in 1 iterations and 31257 ms. Remains : 445/445 places, 370/370 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 964 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (286 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22437 steps, run visited all 1 properties in 81 ms. (steps per millisecond=277 )
Probabilistic random walk after 22437 steps, saw 9586 distinct states, run finished after 81 ms. (steps per millisecond=277 ) properties seen :1
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 473 ms.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 719 reset in 169 ms.
Product exploration explored 100000 steps with 714 reset in 301 ms.
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6586841567329064371
[2026-05-24 10:55:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6586841567329064371
Running compilation step : cd /tmp/ltsmin6586841567329064371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 714 ms.
Running link step : cd /tmp/ltsmin6586841567329064371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6586841567329064371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7577475253592084144.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLCardinality-06 finished in 36227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 374/374 transitions.
Graph (trivial) has 207 edges and 450 vertex of which 6 / 450 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 972 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 444 transition count 325
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 402 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 401 transition count 324
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 88 place count 401 transition count 226
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 301 place count 286 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 305 place count 282 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 309 place count 282 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 309 place count 282 transition count 221
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 311 place count 281 transition count 221
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 552 place count 157 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 554 place count 156 transition count 108
Applied a total of 554 rules in 41 ms. Remains 156 /450 variables (removed 294) and now considering 108/374 (removed 266) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7279760869167978165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5945536105730319956.kers'
[2026-05-24 10:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7279760869167978165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5945536105730319956.kers]
Normalized transition count is 107 out of 108 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 107 rows 155 cols 610 entries
Finished phase 1 with 56 SingleSign rule and 31 generalized
[2026-05-24 10:55:48] [INFO ] Computed 69 invariants in 0 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5945536105730319956.kers
Total runtime 1 ms.
[2026-05-24 10:55:48] [INFO ] Implicit Places using invariants in 170 ms returned [15, 16, 22, 23, 24, 25, 26, 45, 46, 47, 48, 49]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 171 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/450 places, 108/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 144/450 places, 108/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-07 finished in 321 ms.
All properties solved by simple procedures.
Total runtime 116163 ms.

BK_STOP 1779620148499

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

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