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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.4K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 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 85K 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-06-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779612038935

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 08:40:40] [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 08:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:40:40] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-24 08:40:40] [INFO ] Transformed 376 places.
[2026-05-24 08:40:40] [INFO ] Transformed 297 transitions.
[2026-05-24 08:40:40] [INFO ] Found NUPN structural information;
[2026-05-24 08:40:40] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 335 transition count 258
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 335 transition count 258
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 93 place count 320 transition count 243
Iterating global reduction 1 with 15 rules applied. Total rules applied 108 place count 320 transition count 243
Applied a total of 108 rules in 109 ms. Remains 320 /375 variables (removed 55) and now considering 243/296 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10598719172242136201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12997119566140633681.kers'
[2026-05-24 08:40:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10598719172242136201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12997119566140633681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 320 cols 720 entries
Finished phase 1 with 204 SingleSign rule and 37 generalized
[2026-05-24 08:40:40] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12997119566140633681.kers
Total runtime 3 ms.
[2026-05-24 08:40:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-24 08:40:40] [INFO ] Invariant cache hit.
[2026-05-24 08:40:41] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 15/153 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 243/563 variables, 320/475 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 10/485 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 485 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/563 variables, 320/486 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 242/728 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 10/738 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 745 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 320/375 places, 243/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61213 ms. Remains : 320/375 places, 243/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2026-05-24 08:41:41] [INFO ] Invariant cache hit.
[2026-05-24 08:41:41] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-24 08:41:41] [INFO ] Invariant cache hit.
[2026-05-24 08:41:42] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 320/320 places, 243/243 transitions.
Support contains 30 out of 320 places after structural reductions.
[2026-05-24 08:41:42] [INFO ] Flatten gal took : 48 ms
[2026-05-24 08:41:42] [INFO ] Flatten gal took : 27 ms
[2026-05-24 08:41:42] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 28 out of 320 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (416 resets) in 1733 ms. (23 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40003 steps (69 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
[2026-05-24 08:41:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/252 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/303 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 227/530 variables, 303/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 25/555 variables, 12/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/563 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/563 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/252 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/303 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 227/530 variables, 303/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 10/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 25/555 variables, 12/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/563 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/563 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/563 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/563 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1869ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 139 ms.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 138 edges and 320 vertex of which 6 / 320 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 625 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 314 transition count 205
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 285 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 284 transition count 204
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 62 place count 284 transition count 139
Deduced a syphon composed of 65 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 202 place count 209 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 208 place count 203 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 214 place count 203 transition count 133
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 390 place count 111 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 111 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 110 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 110 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 109 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 395 place count 108 transition count 47
Applied a total of 395 rules in 88 ms. Remains 108 /320 variables (removed 212) and now considering 47/243 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 108/320 places, 47/243 transitions.
RANDOM walk for 160 steps (0 resets) in 12 ms. (12 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-06-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 313 stabilizing places and 234 stable transitions
Graph (complete) has 632 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 142 edges and 320 vertex of which 6 / 320 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 626 edges and 315 vertex of which 314 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 313 transition count 204
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 282 transition count 204
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 64 place count 282 transition count 139
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 204 place count 207 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 211 place count 200 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 218 place count 200 transition count 132
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 394 place count 108 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 105 transition count 46
Applied a total of 398 rules in 36 ms. Remains 105 /320 variables (removed 215) and now considering 46/243 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17895627115859624156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11636896218508155429.kers'
[2026-05-24 08:41:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17895627115859624156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11636896218508155429.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 45 rows 68 cols 158 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-24 08:41:45] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11636896218508155429.kers
Total runtime 1 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 08:41:45] [INFO ] Invariant cache hit.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 50, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 208 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/320 places, 46/243 transitions.
Graph (complete) has 138 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 44 place count 33 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 32 transition count 26
Applied a total of 46 rules in 5 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5499001060705449550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5885833943619143287.kers'
[2026-05-24 08:41:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5499001060705449550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5885833943619143287.kers]
Normalized transition count is 25 out of 26 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 25 rows 32 cols 64 entries
Finished phase 1 with 23 SingleSign rule and 2 generalized
[2026-05-24 08:41:45] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5885833943619143287.kers
Total runtime 0 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 08:41:45] [INFO ] Invariant cache hit.
[2026-05-24 08:41:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/320 places, 26/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 32/320 places, 26/243 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 143 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-00
Stuttering criterion allowed to conclude after 326 steps with 105 reset in 4 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-00 finished in 539 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((X(X(X(p1)))||p0))))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 17 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17543097278264590993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5520946929948674232.kers'
[2026-05-24 08:41:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17543097278264590993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5520946929948674232.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:41:46] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5520946929948674232.kers
Total runtime 2 ms.
[2026-05-24 08:41:46] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 08:41:46] [INFO ] Invariant cache hit.
[2026-05-24 08:41:46] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 08:41:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 234/545 variables, 311/456 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 234/545 variables, 311/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 233/711 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 17/728 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 728 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 311/320 places, 234/243 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((X(X(X(p1)))||p0))))))'
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 1036 reset in 248 ms.
Product exploration explored 100000 steps with 1021 reset in 223 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 32408 steps (317 resets) in 245 ms. (131 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 525 ms.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-24 08:42:48] [INFO ] Invariant cache hit.
[2026-05-24 08:42:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 08:42:48] [INFO ] Invariant cache hit.
[2026-05-24 08:42:49] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 311/311 places, 234/234 transitions.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 31793 steps (327 resets) in 104 ms. (302 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 509 ms.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 1031 reset in 138 ms.
Product exploration explored 100000 steps with 1032 reset in 154 ms.
Spot run failed in 70 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/ltsmin3683295172661547544
[2026-05-24 08:42:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3683295172661547544
Running compilation step : cd /tmp/ltsmin3683295172661547544;'/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 470 ms.
Running link step : cd /tmp/ltsmin3683295172661547544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin3683295172661547544;'/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/stateBased17079918758132165036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-24 08:43:05] [INFO ] Invariant cache hit.
[2026-05-24 08:43:05] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 08:43:05] [INFO ] Invariant cache hit.
[2026-05-24 08:43:06] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 311/311 places, 234/234 transitions.
Built C files in :
/tmp/ltsmin12175054735293593874
[2026-05-24 08:43:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12175054735293593874
Running compilation step : cd /tmp/ltsmin12175054735293593874;'/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 356 ms.
Running link step : cd /tmp/ltsmin12175054735293593874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12175054735293593874;'/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/stateBased11864556251631114365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:43:21] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:43:21] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:43:21] [INFO ] Time to serialize gal into /tmp/LTL4059371461815931242.gal : 4 ms
[2026-05-24 08:43:21] [INFO ] Time to serialize properties into /tmp/LTL12417376551063199638.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4059371461815931242.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15428676238789594696.hoa' '-atoms' '/tmp/LTL12417376551063199638.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12417376551063199638.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15428676238789594696.hoa
Detected timeout of ITS tools.
[2026-05-24 08:43:36] [INFO ] Flatten gal took : 29 ms
[2026-05-24 08:43:36] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:43:36] [INFO ] Time to serialize gal into /tmp/LTL15219296379695638772.gal : 2 ms
[2026-05-24 08:43:36] [INFO ] Time to serialize properties into /tmp/LTL5883377310292575749.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15219296379695638772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5883377310292575749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((p318==0)||(p79==1))")||(X(X(X("(p334==0)"))))))))))
Formula 0 simplified : XXXF(!"((p318==0)||(p79==1))" & XXX!"(p334==0)")
Detected timeout of ITS tools.
[2026-05-24 08:43:51] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:43:51] [INFO ] Applying decomposition
[2026-05-24 08:43:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9858096459862423489.txt' '-o' '/tmp/graph9858096459862423489.bin' '-w' '/tmp/graph9858096459862423489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9858096459862423489.bin' '-l' '-1' '-v' '-w' '/tmp/graph9858096459862423489.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:43:51] [INFO ] Decomposing Gal with order
[2026-05-24 08:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:43:51] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-24 08:43:52] [INFO ] Flatten gal took : 89 ms
[2026-05-24 08:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-24 08:43:52] [INFO ] Time to serialize gal into /tmp/LTL8846911793049468029.gal : 5 ms
[2026-05-24 08:43:52] [INFO ] Time to serialize properties into /tmp/LTL1491526867060157113.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8846911793049468029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1491526867060157113.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((i16.u98.p318==0)||(i9.i0.i0.u25.p79==1))")||(X(X(X("(i18.u99.p334==0)"))))))))))
Formula 0 simplified : XXXF(!"((i16.u98.p318==0)||(i9.i0.i0.u25.p79==1))" & XXX!"(i18.u99.p334==0)")
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-06-LTLCardinality-02 finished in 140927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(p0)))))||(X(p1)&&F(p2))))'
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 314 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 314 transition count 237
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 311 transition count 234
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 15 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9845846560331821108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3642664756763772739.kers'
[2026-05-24 08:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9845846560331821108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3642664756763772739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:44:07] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3642664756763772739.kers
Total runtime 2 ms.
[2026-05-24 08:44:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-24 08:44:07] [INFO ] Invariant cache hit.
[2026-05-24 08:44:07] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 311/320 places, 234/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(p0)))))||(X(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 435 ms :[true, (NOT p2), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-03 finished in 1197 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||X(X(G(p1))))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 314 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 314 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 312 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 312 transition count 235
Applied a total of 16 rules in 20 ms. Remains 312 /320 variables (removed 8) and now considering 235/243 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10956412695917274429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11318632557582358997.kers'
[2026-05-24 08:44:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10956412695917274429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11318632557582358997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 312 cols 704 entries
Finished phase 1 with 196 SingleSign rule and 37 generalized
[2026-05-24 08:44:08] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11318632557582358997.kers
Total runtime 2 ms.
[2026-05-24 08:44:08] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-24 08:44:08] [INFO ] Invariant cache hit.
[2026-05-24 08:44:09] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 08:44:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 235/547 variables, 312/468 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 472 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 81/160 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 235/547 variables, 312/474 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 234/708 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 13/721 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 725 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 312/320 places, 235/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 312/320 places, 235/243 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)))||p1)))'
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-08 finished in 60924 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(F(p0)))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 235
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 309 transition count 232
Applied a total of 22 rules in 16 ms. Remains 309 /320 variables (removed 11) and now considering 232/243 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8989984566146916022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15085431954203327908.kers'
[2026-05-24 08:45:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8989984566146916022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15085431954203327908.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 309 cols 698 entries
Finished phase 1 with 193 SingleSign rule and 37 generalized
[2026-05-24 08:45:09] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15085431954203327908.kers
Total runtime 2 ms.
[2026-05-24 08:45:09] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 08:45:09] [INFO ] Invariant cache hit.
[2026-05-24 08:45:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/541 variables, and 156 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 231/702 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 707 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 309/320 places, 232/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60671 ms. Remains : 309/320 places, 232/243 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(F(p0)))))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-10
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-10 finished in 60876 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))||G(p1)))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 141 edges and 320 vertex of which 6 / 320 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 626 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 313 transition count 205
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 283 transition count 205
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 62 place count 283 transition count 140
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 202 place count 208 transition count 140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 201 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 201 transition count 133
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 384 place count 114 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 386 place count 113 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 112 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 111 transition count 50
Applied a total of 388 rules in 32 ms. Remains 111 /320 variables (removed 209) and now considering 50/243 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5416159716590597935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5944683809608424691.kers'
[2026-05-24 08:46:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5416159716590597935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5944683809608424691.kers]
Normalized transition count is 49 out of 50 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 49 rows 87 cols 208 entries
Finished phase 1 with 46 SingleSign rule and 3 generalized
[2026-05-24 08:46:10] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5944683809608424691.kers
Total runtime 2 ms.
[2026-05-24 08:46:10] [INFO ] Implicit Places using invariants in 83 ms returned [95, 97]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/320 places, 50/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 109/320 places, 50/243 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))||G(p1)))'
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-11
Stuttering criterion allowed to conclude after 108 steps with 12 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-11 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(p0 U p1)))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 16 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4932972670424856806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14038872959352133261.kers'
[2026-05-24 08:46:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4932972670424856806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14038872959352133261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:46:10] [INFO ] Computed 79 invariants in 4 ms
Computed 79 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14038872959352133261.kers
Total runtime 5 ms.
[2026-05-24 08:46:10] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-24 08:46:10] [INFO ] Invariant cache hit.
[2026-05-24 08:46:11] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 08:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 234/545 variables, 311/456 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 234/545 variables, 311/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 233/711 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 20/731 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 731 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 311/320 places, 234/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(p0 U p1)))'
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 11 factoid took 70 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 28379 steps (290 resets) in 88 ms. (318 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 67 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 374 ms.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-24 08:47:12] [INFO ] Invariant cache hit.
[2026-05-24 08:47:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 08:47:12] [INFO ] Invariant cache hit.
[2026-05-24 08:47:12] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 311/311 places, 234/234 transitions.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 25415 steps (262 resets) in 65 ms. (385 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 316 ms.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Spot run failed in 48 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/ltsmin4470912122551765292
[2026-05-24 08:47:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4470912122551765292
Running compilation step : cd /tmp/ltsmin4470912122551765292;'/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 365 ms.
Running link step : cd /tmp/ltsmin4470912122551765292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4470912122551765292;'/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/stateBased9493185044508967434.hoa' '--buchi-type=spotba'
LTSmin run took 33 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLCardinality-12 finished in 63793 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((X(X(X(p1)))||p0))))))'
Spot run failed in 43 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 08:47:14] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15594227538245162916
[2026-05-24 08:47:14] [INFO ] Applying decomposition
[2026-05-24 08:47:14] [INFO ] Computing symmetric may disable matrix : 243 transitions.
[2026-05-24 08:47:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:47:14] [INFO ] Computing symmetric may enable matrix : 243 transitions.
[2026-05-24 08:47:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:47:14] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:47:14] [INFO ] Computing Do-Not-Accords matrix : 243 transitions.
[2026-05-24 08:47:14] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:47:14] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15594227538245162916
Running compilation step : cd /tmp/ltsmin15594227538245162916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12987954616204161973.txt' '-o' '/tmp/graph12987954616204161973.bin' '-w' '/tmp/graph12987954616204161973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12987954616204161973.bin' '-l' '-1' '-v' '-w' '/tmp/graph12987954616204161973.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:47:14] [INFO ] Decomposing Gal with order
[2026-05-24 08:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:47:14] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-24 08:47:14] [INFO ] Flatten gal took : 17 ms
[2026-05-24 08:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 08:47:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality18328994610124932206.gal : 5 ms
[2026-05-24 08:47:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality6531115679269158874.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18328994610124932206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6531115679269158874.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((i17.u105.p318==0)||(i5.i2.u30.p79==1))")||(X(X(X("(i18.i0.u106.p334==0)"))))))))))
Formula 0 simplified : XXXF(!"((i17.u105.p318==0)||(i5.i2.u30.p79==1))" & XXX!"(i18.i0.u106.p334==0)")
Compilation finished in 501 ms.
Running link step : cd /tmp/ltsmin15594227538245162916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15594227538245162916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X([]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2, t116, t124, t160, t168, t176, t184, i0.u38.t141, i0.u54.t123, i1.t164, i1.i0.u19.t167, i1...818
Computing Next relation with stutter on 13133 deadlock states
87 unique states visited
0 strongly connected components in search stack
167 transitions explored
87 items max in DFS search stack
1237 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.4168,364292,1,0,670548,1067,4154,1.88102e+06,243,4103,1459619
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-06-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 408956 ms.

BK_STOP 1779612449117

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06"
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-06, 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-177946842000491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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