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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779612562883

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 08:49:24] [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:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:49:24] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-24 08:49:24] [INFO ] Transformed 386 places.
[2026-05-24 08:49:24] [INFO ] Transformed 360 transitions.
[2026-05-24 08:49:24] [INFO ] Found NUPN structural information;
[2026-05-24 08:49:24] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 181 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 2 formulas.
FORMULA BusinessProcesses-PT-07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 334 transition count 308
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 334 transition count 308
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 123 place count 315 transition count 289
Iterating global reduction 0 with 19 rules applied. Total rules applied 142 place count 315 transition count 289
Applied a total of 142 rules in 97 ms. Remains 315 /386 variables (removed 71) and now considering 289/360 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9413877000315040072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11838246649885141932.kers'
[2026-05-24 08:49:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9413877000315040072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11838246649885141932.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 315 cols 968 entries
Finished phase 1 with 204 SingleSign rule and 49 generalized
[2026-05-24 08:49:24] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11838246649885141932.kers
Total runtime 2 ms.
[2026-05-24 08:49:24] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-24 08:49:24] [INFO ] Invariant cache hit.
[2026-05-24 08:49:25] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-24 08:49:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 2/315 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/102 constraints. Problems are: Problem set: 7 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/122 constraints. Problems are: Problem set: 7 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/142 constraints. Problems are: Problem set: 7 solved, 281 unsolved
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/162 constraints. Problems are: Problem set: 11 solved, 277 unsolved
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/182 constraints. Problems are: Problem set: 16 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/202 constraints. Problems are: Problem set: 16 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/604 variables, and 202 constraints, problems are : Problem set: 16 solved, 272 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 16 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 16 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 2/315 variables, 44/59 constraints. Problems are: Problem set: 16 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/62 constraints. Problems are: Problem set: 16 solved, 272 unsolved
Problem TDEAD223 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 140/202 constraints. Problems are: Problem set: 22 solved, 266 unsolved
Problem TDEAD268 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/222 constraints. Problems are: Problem set: 23 solved, 265 unsolved
Problem TDEAD225 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/242 constraints. Problems are: Problem set: 26 solved, 262 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/262 constraints. Problems are: Problem set: 28 solved, 260 unsolved
Problem TDEAD234 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/282 constraints. Problems are: Problem set: 32 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/302 constraints. Problems are: Problem set: 32 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/322 constraints. Problems are: Problem set: 32 solved, 256 unsolved
Problem TDEAD228 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 20/342 constraints. Problems are: Problem set: 35 solved, 253 unsolved
SMT process timed out in 60240ms, After SMT, problems are : Problem set: 35 solved, 253 unsolved
Search for dead transitions found 35 dead transitions in 60257ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 315/386 places, 254/360 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 254
Applied a total of 2 rules in 10 ms. Remains 313 /315 variables (removed 2) and now considering 254/254 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3941611114593844314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1592296392916431395.kers'
[2026-05-24 08:50:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3941611114593844314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1592296392916431395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 313 cols 754 entries
Finished phase 1 with 204 SingleSign rule and 41 generalized
[2026-05-24 08:50:25] [INFO ] Computed 68 invariants in 2 ms
Computed 68 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1592296392916431395.kers
Total runtime 3 ms.
[2026-05-24 08:50:25] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-24 08:50:25] [INFO ] Invariant cache hit.
[2026-05-24 08:50:26] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [262]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 469 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 312/386 places, 254/360 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61808 ms. Remains : 312/386 places, 254/360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14594705923482372804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2729949768541367793.kers'
[2026-05-24 08:50:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14594705923482372804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2729949768541367793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 312 cols 752 entries
Finished phase 1 with 205 SingleSign rule and 40 generalized
[2026-05-24 08:50:26] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2729949768541367793.kers
Total runtime 2 ms.
[2026-05-24 08:50:26] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-24 08:50:26] [INFO ] Invariant cache hit.
[2026-05-24 08:50:26] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-24 08:50:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 2/312 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 253 unsolved
SMT process timed out in 30054ms, After SMT, problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 30057ms
Finished structural reductions in LTL mode , in 1 iterations and 30505 ms. Remains : 312/312 places, 254/254 transitions.
Support contains 31 out of 312 places after structural reductions.
[2026-05-24 08:50:56] [INFO ] Flatten gal took : 42 ms
[2026-05-24 08:50:56] [INFO ] Flatten gal took : 18 ms
[2026-05-24 08:50:56] [INFO ] Input system was already deterministic with 254 transitions.
RANDOM walk for 40000 steps (431 resets) in 1297 ms. (30 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40002 steps (78 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2026-05-24 08:50:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/237 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/312 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/566 variables, 312/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/237 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/312 variables, 24/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 254/566 variables, 312/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Graph (trivial) has 143 edges and 312 vertex of which 6 / 312 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 645 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 305 transition count 216
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 275 transition count 216
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 62 place count 275 transition count 152
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 199 place count 202 transition count 152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 197 transition count 147
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 197 transition count 147
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 375 place count 109 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 377 place count 108 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 108 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 381 place count 106 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 106 transition count 70
Applied a total of 382 rules in 58 ms. Remains 106 /312 variables (removed 206) and now considering 70/254 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 106/312 places, 70/254 transitions.
RANDOM walk for 557 steps (35 resets) in 18 ms. (29 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 191 stabilizing places and 160 stable transitions
Graph (complete) has 652 edges and 312 vertex of which 310 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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(F((p0&&F(p1)))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 305 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 305 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 302 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 302 transition count 245
Applied a total of 19 rules in 23 ms. Remains 302 /312 variables (removed 10) and now considering 245/254 (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-7099286777556232500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15762231314944543188.kers'
[2026-05-24 08:51:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7099286777556232500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15762231314944543188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 302 cols 733 entries
Finished phase 1 with 197 SingleSign rule and 39 generalized
[2026-05-24 08:51:01] [INFO ] Computed 66 invariants in 1 ms
Computed 66 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15762231314944543188.kers
Total runtime 1 ms.
[2026-05-24 08:51:01] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-24 08:51:01] [INFO ] Invariant cache hit.
[2026-05-24 08:51:01] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2026-05-24 08:51:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 244 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 302/312 places, 245/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30683 ms. Remains : 302/312 places, 245/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-00
Product exploration explored 100000 steps with 4017 reset in 211 ms.
Stack based approach found an accepted trace after 45 steps with 2 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-00 finished in 31301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 304 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 304 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 300 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 300 transition count 243
Applied a total of 23 rules in 36 ms. Remains 300 /312 variables (removed 12) and now considering 243/254 (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-11185662334984458013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9546702382107641154.kers'
[2026-05-24 08:51:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11185662334984458013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9546702382107641154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 300 cols 729 entries
Finished phase 1 with 195 SingleSign rule and 39 generalized
[2026-05-24 08:51:32] [INFO ] Computed 66 invariants in 3 ms
Computed 66 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9546702382107641154.kers
Total runtime 4 ms.
[2026-05-24 08:51:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-24 08:51:32] [INFO ] Invariant cache hit.
[2026-05-24 08:51:33] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:51:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/543 variables, and 190 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 124/124 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/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 124/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 17/247 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD213 is UNSAT
At refinement iteration 15 (OVERLAPS) 243/543 variables, 300/557 constraints. Problems are: Problem set: 1 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 241/798 constraints. Problems are: Problem set: 1 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 801 constraints, problems are : Problem set: 1 solved, 241 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 241/242 constraints, Known Traps: 194/194 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 1 solved, 241 unsolved
Search for dead transitions found 1 dead transitions in 60065ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 300/312 places, 242/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60516 ms. Remains : 300/312 places, 242/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-01 finished in 60626 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(p1))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 304 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 304 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 300 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 300 transition count 243
Applied a total of 23 rules in 19 ms. Remains 300 /312 variables (removed 12) and now considering 243/254 (removed 11) transitions.
[2026-05-24 08:52:33] [INFO ] Invariant cache hit.
[2026-05-24 08:52:33] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 08:52:33] [INFO ] Invariant cache hit.
[2026-05-24 08:52:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:52:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/543 variables, and 190 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 124/124 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/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 124/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 17/247 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD213 is UNSAT
At refinement iteration 15 (OVERLAPS) 243/543 variables, 300/557 constraints. Problems are: Problem set: 1 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 241/798 constraints. Problems are: Problem set: 1 solved, 241 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 801 constraints, problems are : Problem set: 1 solved, 241 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 241/242 constraints, Known Traps: 194/194 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 1 solved, 241 unsolved
Search for dead transitions found 1 dead transitions in 60047ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 300/312 places, 242/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60476 ms. Remains : 300/312 places, 242/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Computed a total of 183 stabilizing places and 152 stable transitions
Graph (complete) has 632 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 183 stabilizing places and 152 stable transitions
Detected a total of 183/300 stabilizing places and 152/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 20 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLCardinality-04 finished in 60948 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)) U p1))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Graph (trivial) has 144 edges and 312 vertex of which 6 / 312 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 646 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 304 transition count 216
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 216
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 274 transition count 151
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 200 place count 201 transition count 151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 207 place count 194 transition count 144
Iterating global reduction 2 with 7 rules applied. Total rules applied 214 place count 194 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 194 transition count 143
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 216 place count 193 transition count 143
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 373 place count 109 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 108 transition count 73
Applied a total of 375 rules in 31 ms. Remains 108 /312 variables (removed 204) and now considering 73/254 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14677610625818259444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3007350663532688640.kers'
[2026-05-24 08:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14677610625818259444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3007350663532688640.kers]
Normalized transition count is 72 out of 73 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 72 rows 107 cols 362 entries
Finished phase 1 with 44 SingleSign rule and 17 generalized
[2026-05-24 08:53:34] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3007350663532688640.kers
Total runtime 0 ms.
[2026-05-24 08:53:34] [INFO ] Implicit Places using invariants in 70 ms returned [1, 2, 10, 27, 28, 29, 30, 31, 32, 33, 77]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 71 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/312 places, 73/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 97/312 places, 73/254 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)) U p1))'
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-07 finished in 217 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((G(p1)||p0))))'
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Graph (trivial) has 138 edges and 312 vertex of which 6 / 312 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 306 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 278 transition count 219
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 57 place count 278 transition count 155
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 193 place count 206 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 203 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 203 transition count 152
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 363 place count 116 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 365 place count 115 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 114 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 113 transition count 76
Applied a total of 367 rules in 31 ms. Remains 113 /312 variables (removed 199) and now considering 76/254 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9020499853490540643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3060562806796543380.kers'
[2026-05-24 08:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9020499853490540643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3060562806796543380.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 75 rows 85 cols 249 entries
Finished phase 1 with 52 SingleSign rule and 13 generalized
[2026-05-24 08:53:34] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3060562806796543380.kers
Total runtime 2 ms.
[2026-05-24 08:53:34] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2, 10, 28, 29, 30, 31, 32, 33, 34]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 83 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/312 places, 76/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 102/312 places, 76/254 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-08
Product exploration explored 100000 steps with 13397 reset in 221 ms.
Product exploration explored 100000 steps with 13503 reset in 166 ms.
Computed a total of 55 stabilizing places and 43 stable transitions
Graph (complete) has 315 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 55 stabilizing places and 43 stable transitions
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5865 resets) in 429 ms. (93 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1384 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1758 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11720812525180607561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12345918292066876059.kers'
[2026-05-24 08:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11720812525180607561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12345918292066876059.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 75 rows 83 cols 244 entries
Finished phase 1 with 54 SingleSign rule and 11 generalized
[2026-05-24 08:53:35] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12345918292066876059.kers
Total runtime 0 ms.
[2026-05-24 08:53:35] [INFO ] State equation strengthened by 2 read => feed constraints.
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) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/65 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/76 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 72/148 variables, 76/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 29/177 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/177 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 102/102 constraints, ReadFeed: 2/2 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) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/65 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/76 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 72/148 variables, 76/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 29/177 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 102/102 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 76/76 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 75
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 102 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 100 transition count 73
Applied a total of 5 rules in 7 ms. Remains 100 /102 variables (removed 2) and now considering 73/76 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 100/102 places, 73/76 transitions.
RANDOM walk for 40000 steps (1997 resets) in 127 ms. (312 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (427 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17896021527421384298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16465216382404987761.kers'
[2026-05-24 08:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17896021527421384298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16465216382404987761.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 73 rows 81 cols 238 entries
Finished phase 1 with 45 SingleSign rule and 18 generalized
[2026-05-24 08:53:35] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16465216382404987761.kers
Total runtime 0 ms.
[2026-05-24 08:53:35] [INFO ] State equation strengthened by 2 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/61 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/74 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 70/144 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/173 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/173 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 100/100 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/61 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/74 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 70/144 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/173 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/173 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/173 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 100/100 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2437 steps, including 193 resets, run visited all 1 properties in 7 ms. (steps per millisecond=348 )
Parikh walk visited 1 properties in 11 ms.
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1281 ms.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 76/76 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17250571728776622530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13895628087023557340.kers'
[2026-05-24 08:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17250571728776622530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13895628087023557340.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 75 rows 83 cols 244 entries
Finished phase 1 with 54 SingleSign rule and 11 generalized
[2026-05-24 08:53:36] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13895628087023557340.kers
Total runtime 1 ms.
[2026-05-24 08:53:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 08:53:36] [INFO ] Invariant cache hit.
[2026-05-24 08:53:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-24 08:53:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [12, 21, 27, 47, 49, 51, 55, 57, 59]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 175 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 76/76 transitions.
Graph (complete) has 237 edges and 93 vertex of which 84 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 84 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 79 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 78 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 78 transition count 65
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 69 transition count 58
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 31 place count 68 transition count 57
Applied a total of 31 rules in 9 ms. Remains 68 /93 variables (removed 25) and now considering 57/76 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16937938051980322070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12451234145494848627.kers'
[2026-05-24 08:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16937938051980322070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12451234145494848627.kers]
Normalized transition count is 56 out of 57 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 56 rows 56 cols 161 entries
Finished phase 1 with 39 SingleSign rule and 8 generalized
[2026-05-24 08:53:36] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12451234145494848627.kers
Total runtime 0 ms.
[2026-05-24 08:53:36] [INFO ] Implicit Places using invariants in 48 ms returned [61, 62, 67]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/102 places, 57/76 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 62 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 62 transition count 54
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 0 with 2 rules applied. Total rules applied 8 place count 61 transition count 53
Applied a total of 8 rules in 5 ms. Remains 61 /65 variables (removed 4) and now considering 53/57 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10664801467029217842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2442009862313298506.kers'
[2026-05-24 08:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10664801467029217842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2442009862313298506.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 52 rows 49 cols 146 entries
Finished phase 1 with 38 SingleSign rule and 5 generalized
[2026-05-24 08:53:36] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2442009862313298506.kers
Total runtime 0 ms.
[2026-05-24 08:53:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 08:53:36] [INFO ] Invariant cache hit.
[2026-05-24 08:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:53:36] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 61/102 places, 53/76 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 361 ms. Remains : 61/102 places, 53/76 transitions.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 173 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 20 stable transitions
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (6283 resets) in 139 ms. (285 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1537 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2026-05-24 08:53:37] [INFO ] Invariant cache hit.
[2026-05-24 08:53:37] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 35/94 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/113 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/113 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/113 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/113 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 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) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 35/94 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/94 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 19/113 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/113 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/113 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/113 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 53/53 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 61 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 59 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 58 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 58 transition count 49
Applied a total of 8 rules in 7 ms. Remains 58 /61 variables (removed 3) and now considering 49/53 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 58/61 places, 49/53 transitions.
RANDOM walk for 40000 steps (2639 resets) in 162 ms. (245 steps per ms) remains 1/2 properties
BEST_FIRST walk for 18456 steps (297 resets) in 25 ms. (709 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 819 ms.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14327 reset in 111 ms.
Product exploration explored 100000 steps with 14356 reset in 105 ms.
Built C files in :
/tmp/ltsmin6809773210181270635
[2026-05-24 08:53:38] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2026-05-24 08:53:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:38] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2026-05-24 08:53:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:38] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2026-05-24 08:53:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6809773210181270635
Running compilation step : cd /tmp/ltsmin6809773210181270635;'/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 258 ms.
Running link step : cd /tmp/ltsmin6809773210181270635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6809773210181270635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6024688131372186149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2026-05-24 08:53:53] [INFO ] Invariant cache hit.
[2026-05-24 08:53:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 08:53:53] [INFO ] Invariant cache hit.
[2026-05-24 08:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:53:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2026-05-24 08:53:53] [INFO ] Redundant transitions in 13 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-24 08:53:53] [INFO ] Invariant cache hit.
[2026-05-24 08:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD52 is UNSAT
At refinement iteration 5 (OVERLAPS) 52/113 variables, 61/79 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/84 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/86 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 87 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 3/61 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 52/113 variables, 61/86 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 47/134 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 12/146 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 148 constraints, problems are : Problem set: 1 solved, 47 unsolved in 3023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4926ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 4927ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 52/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 51
Applied a total of 2 rules in 13 ms. Remains 60 /61 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14944552958942637761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-614905008248456605.kers'
[2026-05-24 08:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14944552958942637761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-614905008248456605.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 50 rows 48 cols 139 entries
Finished phase 1 with 37 SingleSign rule and 4 generalized
[2026-05-24 08:53:58] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-614905008248456605.kers
Total runtime 0 ms.
[2026-05-24 08:53:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 08:53:58] [INFO ] Invariant cache hit.
[2026-05-24 08:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:53:58] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/61 places, 51/53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 57 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 57 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 57 transition count 48
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 3 with 2 rules applied. Total rules applied 7 place count 56 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 56 transition count 46
Applied a total of 8 rules in 6 ms. Remains 56 /59 variables (removed 3) and now considering 46/51 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3851096849927127313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16488358185285949808.kers'
[2026-05-24 08:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3851096849927127313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16488358185285949808.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 45 rows 45 cols 120 entries
Finished phase 1 with 34 SingleSign rule and 4 generalized
[2026-05-24 08:53:58] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16488358185285949808.kers
Total runtime 13 ms.
[2026-05-24 08:53:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 08:53:58] [INFO ] Invariant cache hit.
[2026-05-24 08:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:53:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/61 places, 46/53 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5412 ms. Remains : 56/61 places, 46/53 transitions.
Built C files in :
/tmp/ltsmin7993563803578051876
[2026-05-24 08:53:58] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2026-05-24 08:53:58] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:58] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2026-05-24 08:53:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:58] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2026-05-24 08:53:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:53:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7993563803578051876
Running compilation step : cd /tmp/ltsmin7993563803578051876;'/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 170 ms.
Running link step : cd /tmp/ltsmin7993563803578051876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7993563803578051876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7808490274795566718.hoa' '--buchi-type=spotba'
LTSmin run took 11950 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLCardinality-08 finished in 36222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Graph (trivial) has 144 edges and 312 vertex of which 6 / 312 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 646 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 304 transition count 216
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 216
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 274 transition count 151
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 201 place count 200 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 194 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 194 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 194 transition count 144
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 215 place count 193 transition count 144
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 371 place count 110 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 109 transition count 74
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 379 place count 109 transition count 74
Applied a total of 379 rules in 27 ms. Remains 109 /312 variables (removed 203) and now considering 74/254 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8612786664201581999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7872936443244405785.kers'
[2026-05-24 08:54:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8612786664201581999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7872936443244405785.kers]
Normalized transition count is 73 out of 74 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 108 cols 382 entries
Finished phase 1 with 46 SingleSign rule and 16 generalized
[2026-05-24 08:54:10] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7872936443244405785.kers
Total runtime 0 ms.
[2026-05-24 08:54:10] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 10, 27, 28, 29, 30, 31, 32, 33, 107]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 142 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/312 places, 74/254 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 98/312 places, 74/254 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 72 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 20144 reset in 168 ms.
Product exploration explored 100000 steps with 20033 reset in 239 ms.
Computed a total of 56 stabilizing places and 46 stable transitions
Computed a total of 56 stabilizing places and 46 stable transitions
Knowledge based reduction with 3 factoid took 40 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4850 steps (1081 resets) in 15 ms. (303 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 152 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6997744663744712553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7636797387409210393.kers'
[2026-05-24 08:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6997744663744712553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7636797387409210393.kers]
Normalized transition count is 73 out of 74 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 98 cols 343 entries
Finished phase 1 with 46 SingleSign rule and 16 generalized
[2026-05-24 08:54:11] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7636797387409210393.kers
Total runtime 0 ms.
[2026-05-24 08:54:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-24 08:54:11] [INFO ] Invariant cache hit.
[2026-05-24 08:54:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 08:54:11] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [10, 25, 45, 47, 49, 53, 55, 57]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 383 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/98 places, 74/74 transitions.
Graph (complete) has 251 edges and 90 vertex of which 81 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 81 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 76 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 75 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 75 transition count 63
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 66 transition count 56
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 31 place count 65 transition count 55
Applied a total of 31 rules in 5 ms. Remains 65 /90 variables (removed 25) and now considering 55/74 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12552400504388039133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11749524402429350634.kers'
[2026-05-24 08:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12552400504388039133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11749524402429350634.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 65 cols 218 entries
Finished phase 1 with 32 SingleSign rule and 12 generalized
[2026-05-24 08:54:11] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11749524402429350634.kers
Total runtime 1 ms.
[2026-05-24 08:54:11] [INFO ] Implicit Places using invariants in 51 ms returned [58, 59, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/98 places, 55/74 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 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 0 with 2 rules applied. Total rules applied 8 place count 58 transition count 51
Applied a total of 8 rules in 9 ms. Remains 58 /62 variables (removed 4) and now considering 51/55 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14030042793051709787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15523657257318500523.kers'
[2026-05-24 08:54:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14030042793051709787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15523657257318500523.kers]
Normalized transition count is 50 out of 51 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 58 cols 202 entries
Finished phase 1 with 31 SingleSign rule and 9 generalized
[2026-05-24 08:54:12] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15523657257318500523.kers
Total runtime 5 ms.
[2026-05-24 08:54:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 08:54:12] [INFO ] Invariant cache hit.
[2026-05-24 08:54:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 08:54:12] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 58/98 places, 51/74 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 631 ms. Remains : 58/98 places, 51/74 transitions.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 6737 steps (1606 resets) in 11 ms. (561 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Knowledge-based reduction took 259 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21162 reset in 109 ms.
Product exploration explored 100000 steps with 21160 reset in 129 ms.
Built C files in :
/tmp/ltsmin12170553282160350321
[2026-05-24 08:54:12] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2026-05-24 08:54:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:54:12] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2026-05-24 08:54:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:54:12] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2026-05-24 08:54:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:54:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12170553282160350321
Running compilation step : cd /tmp/ltsmin12170553282160350321;'/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 220 ms.
Running link step : cd /tmp/ltsmin12170553282160350321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12170553282160350321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3102244273779114554.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLCardinality-09 finished in 2463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&G(p1)) U X(p2))))'
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 304 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 304 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 300 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 300 transition count 243
Applied a total of 23 rules in 14 ms. Remains 300 /312 variables (removed 12) and now considering 243/254 (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-12710682687437153884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2292246898571392326.kers'
[2026-05-24 08:54:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12710682687437153884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2292246898571392326.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 300 cols 729 entries
Finished phase 1 with 195 SingleSign rule and 39 generalized
[2026-05-24 08:54:13] [INFO ] Computed 66 invariants in 1 ms
Computed 66 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2292246898571392326.kers
Total runtime 2 ms.
[2026-05-24 08:54:13] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-24 08:54:13] [INFO ] Invariant cache hit.
[2026-05-24 08:54:13] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:54:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/543 variables, and 190 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 124/124 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/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 124/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 17/247 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD213 is UNSAT
At refinement iteration 15 (OVERLAPS) 243/543 variables, 300/557 constraints. Problems are: Problem set: 1 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 241/798 constraints. Problems are: Problem set: 1 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 801 constraints, problems are : Problem set: 1 solved, 241 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 241/242 constraints, Known Traps: 194/194 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 1 solved, 241 unsolved
Search for dead transitions found 1 dead transitions in 60063ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 300/312 places, 242/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60542 ms. Remains : 300/312 places, 242/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&G(p1)) U X(p2))))'
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Computed a total of 183 stabilizing places and 152 stable transitions
Graph (complete) has 632 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 183 stabilizing places and 152 stable transitions
Detected a total of 183/300 stabilizing places and 152/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 16 ms. Proved property starting from automaton with 8 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLCardinality-12 finished in 61170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X(p2))))||p0)))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 305 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 305 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 302 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 302 transition count 245
Applied a total of 19 rules in 19 ms. Remains 302 /312 variables (removed 10) and now considering 245/254 (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-177409021257559982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11915692484609326905.kers'
[2026-05-24 08:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-177409021257559982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11915692484609326905.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 302 cols 733 entries
Finished phase 1 with 197 SingleSign rule and 39 generalized
[2026-05-24 08:55:14] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11915692484609326905.kers
Total runtime 6 ms.
[2026-05-24 08:55:14] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-24 08:55:14] [INFO ] Invariant cache hit.
[2026-05-24 08:55:14] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 302/312 places, 245/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 302/312 places, 245/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X(p2))))||p0)))'
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 185 stabilizing places and 155 stable transitions
Graph (complete) has 638 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 185 stabilizing places and 155 stable transitions
Detected a total of 185/302 stabilizing places and 155/245 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 8 factoid took 59 ms. Proved property starting from automaton with 6 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 65 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLCardinality-13 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 304 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 304 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 300 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 300 transition count 243
Applied a total of 23 rules in 18 ms. Remains 300 /312 variables (removed 12) and now considering 243/254 (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-13195582248362315918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14829388058260529036.kers'
[2026-05-24 08:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13195582248362315918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14829388058260529036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 300 cols 729 entries
Finished phase 1 with 195 SingleSign rule and 39 generalized
[2026-05-24 08:55:15] [INFO ] Computed 66 invariants in 1 ms
Computed 66 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14829388058260529036.kers
Total runtime 1 ms.
[2026-05-24 08:55:15] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-24 08:55:15] [INFO ] Invariant cache hit.
[2026-05-24 08:55:15] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/543 variables, and 190 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 124/124 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/299 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/300 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 124/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 17/247 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD213 is UNSAT
At refinement iteration 15 (OVERLAPS) 243/543 variables, 300/557 constraints. Problems are: Problem set: 1 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 241/798 constraints. Problems are: Problem set: 1 solved, 241 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 801 constraints, problems are : Problem set: 1 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 241/242 constraints, Known Traps: 194/194 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60038ms problems are : Problem set: 1 solved, 241 unsolved
Search for dead transitions found 1 dead transitions in 60038ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 300/312 places, 242/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60456 ms. Remains : 300/312 places, 242/254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-14 finished in 60667 ms.
All properties solved by simple procedures.
Total runtime 411852 ms.

BK_STOP 1779612975947

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
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-07, 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-177946842000499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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