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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 161K 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-17-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779625131165

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 12:18:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:18:52] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2026-05-24 12:18:52] [INFO ] Transformed 650 places.
[2026-05-24 12:18:52] [INFO ] Transformed 580 transitions.
[2026-05-24 12:18:52] [INFO ] Found NUPN structural information;
[2026-05-24 12:18:52] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 576
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 87 place count 559 transition count 491
Iterating global reduction 1 with 85 rules applied. Total rules applied 172 place count 559 transition count 491
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 213 place count 518 transition count 450
Iterating global reduction 1 with 41 rules applied. Total rules applied 254 place count 518 transition count 450
Applied a total of 254 rules in 133 ms. Remains 518 /646 variables (removed 128) and now considering 450/576 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8979844309002132269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3763097827936975275.kers'
[2026-05-24 12:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8979844309002132269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3763097827936975275.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 450 rows 518 cols 1447 entries
Finished phase 1 with 332 SingleSign rule and 80 generalized
[2026-05-24 12:18:52] [INFO ] Computed 106 invariants in 3 ms
Computed 106 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3763097827936975275.kers
Total runtime 4 ms.
[2026-05-24 12:18:53] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-05-24 12:18:53] [INFO ] Invariant cache hit.
[2026-05-24 12:18:55] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2026-05-24 12:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 2/518 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 449 unsolved
SMT process timed out in 30253ms, After SMT, problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 30269ms
Starting structural reductions in LTL mode, iteration 1 : 518/646 places, 450/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32732 ms. Remains : 518/646 places, 450/576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Applied a total of 0 rules in 23 ms. Remains 518 /518 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2026-05-24 12:19:25] [INFO ] Invariant cache hit.
[2026-05-24 12:19:25] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-24 12:19:25] [INFO ] Invariant cache hit.
[2026-05-24 12:19:27] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1974 ms. Remains : 518/518 places, 450/450 transitions.
Support contains 35 out of 518 places after structural reductions.
[2026-05-24 12:19:27] [INFO ] Flatten gal took : 61 ms
[2026-05-24 12:19:27] [INFO ] Flatten gal took : 30 ms
[2026-05-24 12:19:27] [INFO ] Input system was already deterministic with 450 transitions.
RANDOM walk for 40000 steps (263 resets) in 1328 ms. (30 steps per ms) remains 12/17 properties
BEST_FIRST walk for 40004 steps (44 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (44 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (51 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (49 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (49 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 136 ms. (292 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (43 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 118 ms. (336 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (47 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (45 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (41 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
[2026-05-24 12:19:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 256/283 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 157/440 variables, 39/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 69/509 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 6/515 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 448/963 variables, 515/621 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 4/967 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/968 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/968 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 624 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2154 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 256/283 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 157/440 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 69/509 variables, 19/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 7227ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 450/450 transitions.
Graph (trivial) has 217 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 513 transition count 393
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 463 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 462 transition count 392
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 103 place count 462 transition count 293
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 318 place count 346 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 345 transition count 292
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 345 transition count 292
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 572 place count 217 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 574 place count 216 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 576 place count 216 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 214 transition count 170
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 582 place count 214 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 583 place count 213 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 584 place count 212 transition count 169
Applied a total of 584 rules in 119 ms. Remains 212 /518 variables (removed 306) and now considering 169/450 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 212/518 places, 169/450 transitions.
RANDOM walk for 40000 steps (734 resets) in 853 ms. (46 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (244 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (277 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (193 resets) in 156 ms. (254 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (257 resets) in 175 ms. (227 steps per ms) remains 2/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7914316447419391661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12488585387549275425.kers'
[2026-05-24 12:19:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7914316447419391661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12488585387549275425.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 169 rows 185 cols 746 entries
Finished phase 1 with 102 SingleSign rule and 26 generalized
[2026-05-24 12:19:36] [INFO ] Computed 84 invariants in 1 ms
Computed 84 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12488585387549275425.kers
Total runtime 1 ms.
[2026-05-24 12:19:36] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/36 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/104 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/158 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/170 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/172 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 165/337 variables, 172/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 5/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 40/377 variables, 37/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 17/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/380 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/381 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/381 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 212/212 constraints, ReadFeed: 5/5 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/36 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/104 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/158 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/170 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/172 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 165/337 variables, 172/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 18 (OVERLAPS) 40/377 variables, 37/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/377 variables, 17/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/377 variables, 1/318 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/377 variables, 4/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/377 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 380/381 variables, and 324 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 66/67 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 211/212 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2010ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA BusinessProcesses-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 210 stabilizing places and 181 stable transitions
Graph (complete) has 1156 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 450
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 508 transition count 441
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 508 transition count 441
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 502 transition count 435
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 502 transition count 435
Applied a total of 31 rules in 69 ms. Remains 502 /518 variables (removed 16) and now considering 435/450 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12917692553570186766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15295774515849297073.kers'
[2026-05-24 12:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12917692553570186766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15295774515849297073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 502 cols 1416 entries
Finished phase 1 with 318 SingleSign rule and 79 generalized
[2026-05-24 12:19:38] [INFO ] Computed 105 invariants in 3 ms
Computed 105 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15295774515849297073.kers
Total runtime 4 ms.
[2026-05-24 12:19:39] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-24 12:19:39] [INFO ] Invariant cache hit.
[2026-05-24 12:19:40] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-24 12:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 9 solved, 425 unsolved
Problem TDEAD357 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 19 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/185 constraints. Problems are: Problem set: 19 solved, 415 unsolved
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 19 solved, 415 unsolved
Search for dead transitions found 19 dead transitions in 30151ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/518 places, 416/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32205 ms. Remains : 502/518 places, 416/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1098 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 10 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-01 finished in 32934 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 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Graph (trivial) has 244 edges and 518 vertex of which 6 / 518 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 1150 edges and 513 vertex of which 511 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 383
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 451 transition count 383
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 120 place count 451 transition count 277
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 352 place count 325 transition count 277
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 361 place count 316 transition count 268
Iterating global reduction 2 with 9 rules applied. Total rules applied 370 place count 316 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 370 place count 316 transition count 267
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 372 place count 315 transition count 267
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 643 place count 177 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 645 place count 176 transition count 138
Applied a total of 645 rules in 48 ms. Remains 176 /518 variables (removed 342) and now considering 138/450 (removed 312) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15974820508249787301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5490937245748826178.kers'
[2026-05-24 12:20:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15974820508249787301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5490937245748826178.kers]
Normalized transition count is 137 out of 138 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 137 rows 175 cols 821 entries
Finished phase 1 with 55 SingleSign rule and 41 generalized
[2026-05-24 12:20:11] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5490937245748826178.kers
Total runtime 2 ms.
[2026-05-24 12:20:11] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 145 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/518 places, 138/450 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 154/518 places, 138/450 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 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-02 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Graph (trivial) has 242 edges and 518 vertex of which 6 / 518 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 1150 edges and 513 vertex of which 511 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 510 transition count 385
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 453 transition count 384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 452 transition count 384
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 118 place count 452 transition count 277
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 352 place count 325 transition count 277
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 360 place count 317 transition count 269
Iterating global reduction 3 with 8 rules applied. Total rules applied 368 place count 317 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 368 place count 317 transition count 268
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 370 place count 316 transition count 268
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 633 place count 182 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 635 place count 181 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 636 place count 180 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 637 place count 179 transition count 142
Applied a total of 637 rules in 57 ms. Remains 179 /518 variables (removed 339) and now considering 142/450 (removed 308) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10633462867019420153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15810983483042947642.kers'
[2026-05-24 12:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10633462867019420153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15810983483042947642.kers]
Normalized transition count is 141 out of 142 initially.
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 0 ms.
// Phase 1: matrix 141 rows 139 cols 608 entries
Finished phase 1 with 86 SingleSign rule and 14 generalized
[2026-05-24 12:20:12] [INFO ] Computed 79 invariants in 0 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15810983483042947642.kers
Total runtime 4 ms.
[2026-05-24 12:20:12] [INFO ] Implicit Places using invariants in 167 ms returned [45, 50, 51, 52, 53, 54, 55, 56]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 168 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/518 places, 142/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 171/518 places, 142/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-03 finished in 424 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 3 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Graph (trivial) has 241 edges and 518 vertex of which 6 / 518 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 1150 edges and 513 vertex of which 511 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 510 transition count 384
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 452 transition count 384
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 118 place count 452 transition count 279
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 348 place count 327 transition count 279
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 357 place count 318 transition count 270
Iterating global reduction 2 with 9 rules applied. Total rules applied 366 place count 318 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 366 place count 318 transition count 269
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 368 place count 317 transition count 269
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 635 place count 181 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 637 place count 180 transition count 142
Applied a total of 637 rules in 43 ms. Remains 180 /518 variables (removed 338) and now considering 142/450 (removed 308) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1442721919112743867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5724903860675418661.kers'
[2026-05-24 12:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1442721919112743867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5724903860675418661.kers]
Normalized transition count is 141 out of 142 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 141 rows 179 cols 798 entries
Finished phase 1 with 59 SingleSign rule and 41 generalized
[2026-05-24 12:20:12] [INFO ] Computed 80 invariants in 0 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5724903860675418661.kers
Total runtime 1 ms.
[2026-05-24 12:20:12] [INFO ] Implicit Places using invariants in 199 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 211 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/518 places, 142/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 158/518 places, 142/450 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 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-05 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U X(p0))||G(p1))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 450
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 507 transition count 440
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 507 transition count 440
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 501 transition count 434
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 501 transition count 434
Applied a total of 33 rules in 36 ms. Remains 501 /518 variables (removed 17) and now considering 434/450 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8072894014175541614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15738605180417332229.kers'
[2026-05-24 12:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8072894014175541614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15738605180417332229.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 434 rows 501 cols 1414 entries
Finished phase 1 with 317 SingleSign rule and 79 generalized
[2026-05-24 12:20:12] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15738605180417332229.kers
Total runtime 4 ms.
[2026-05-24 12:20:13] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-24 12:20:13] [INFO ] Invariant cache hit.
[2026-05-24 12:20:14] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2026-05-24 12:20:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 3 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 3 solved, 430 unsolved
SMT process timed out in 30107ms, After SMT, problems are : Problem set: 3 solved, 430 unsolved
Search for dead transitions found 3 dead transitions in 30110ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/518 places, 431/450 transitions.
Applied a total of 0 rules in 12 ms. Remains 501 /501 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32250 ms. Remains : 501/518 places, 431/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U X(p0))||G(p1))))'
Stuttering acceptance computed with spot in 298 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1129 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 19 ms. Proved property starting from automaton with 8 states, 14 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-10 finished in 32916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(p0))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 509 transition count 441
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 509 transition count 441
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 503 transition count 435
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 503 transition count 435
Applied a total of 30 rules in 35 ms. Remains 503 /518 variables (removed 15) and now considering 435/450 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7683662362090851676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3108807786857954047.kers'
[2026-05-24 12:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7683662362090851676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3108807786857954047.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 435 rows 503 cols 1417 entries
Finished phase 1 with 317 SingleSign rule and 80 generalized
[2026-05-24 12:20:45] [INFO ] Computed 106 invariants in 8 ms
Computed 106 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3108807786857954047.kers
Total runtime 9 ms.
[2026-05-24 12:20:46] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-24 12:20:46] [INFO ] Invariant cache hit.
[2026-05-24 12:20:47] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-24 12:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 2/503 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/166 constraints. Problems are: Problem set: 5 solved, 429 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/938 variables, and 182 constraints, problems are : Problem set: 5 solved, 429 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 5 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 5 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 2/503 variables, 84/101 constraints. Problems are: Problem set: 5 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/106 constraints. Problems are: Problem set: 5 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 76/182 constraints. Problems are: Problem set: 5 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/202 constraints. Problems are: Problem set: 5 solved, 429 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/222 constraints. Problems are: Problem set: 18 solved, 416 unsolved
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/242 constraints. Problems are: Problem set: 29 solved, 405 unsolved
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/262 constraints. Problems are: Problem set: 32 solved, 402 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 20/282 constraints. Problems are: Problem set: 32 solved, 402 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 20/302 constraints. Problems are: Problem set: 32 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/938 variables, and 306 constraints, problems are : Problem set: 32 solved, 402 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 200/200 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 32 solved, 402 unsolved
Search for dead transitions found 32 dead transitions in 60090ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/518 places, 403/450 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 403
Applied a total of 2 rules in 10 ms. Remains 501 /503 variables (removed 2) and now considering 403/403 (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-10176519230786158199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8753880478053762054.kers'
[2026-05-24 12:21:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10176519230786158199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8753880478053762054.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 501 cols 1221 entries
Finished phase 1 with 319 SingleSign rule and 72 generalized
[2026-05-24 12:21:47] [INFO ] Computed 110 invariants in 2 ms
Computed 110 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8753880478053762054.kers
Total runtime 3 ms.
[2026-05-24 12:21:48] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-05-24 12:21:48] [INFO ] Invariant cache hit.
[2026-05-24 12:21:49] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1551 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 500/518 places, 403/450 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63750 ms. Remains : 500/518 places, 403/450 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((F(p0)&&X(p1)&&p1)))'
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 207 stabilizing places and 178 stable transitions
Graph (complete) has 1059 edges and 500 vertex of which 498 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 207 stabilizing places and 178 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 13 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-12 finished in 64220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&(p0 U G(!p2)))))'
Support contains 5 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Graph (trivial) has 239 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1150 edges and 513 vertex of which 511 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 510 transition count 384
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 452 transition count 384
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 118 place count 452 transition count 278
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 350 place count 326 transition count 278
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 358 place count 318 transition count 270
Iterating global reduction 2 with 8 rules applied. Total rules applied 366 place count 318 transition count 270
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 630 place count 184 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 632 place count 183 transition count 144
Applied a total of 632 rules in 32 ms. Remains 183 /518 variables (removed 335) and now considering 144/450 (removed 306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14955965886715400206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6377567969576888337.kers'
[2026-05-24 12:21:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14955965886715400206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6377567969576888337.kers]
Normalized transition count is 143 out of 144 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 143 rows 182 cols 834 entries
Finished phase 1 with 59 SingleSign rule and 43 generalized
[2026-05-24 12:21:49] [INFO ] Computed 81 invariants in 0 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6377567969576888337.kers
Total runtime 1 ms.
[2026-05-24 12:21:50] [INFO ] Implicit Places using invariants in 190 ms returned [1, 4, 5, 6, 7, 10, 11, 36, 37, 38, 39, 46, 47, 48, 53, 54, 55, 56, 57, 58, 59, 60, 135]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 193 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/518 places, 144/450 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 160/518 places, 144/450 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((F(p0)&&(p1 U G(!p2))&&p1)))'
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-13 finished in 422 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((X(X(p0)) U p0))&&F((F(p2)&&p1))))'
Support contains 8 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 450
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 508 transition count 441
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 508 transition count 441
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 503 transition count 436
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 503 transition count 436
Applied a total of 29 rules in 38 ms. Remains 503 /518 variables (removed 15) and now considering 436/450 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12076172122747337982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12203215283895232199.kers'
[2026-05-24 12:21:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12076172122747337982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12203215283895232199.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 503 cols 1418 entries
Finished phase 1 with 319 SingleSign rule and 79 generalized
[2026-05-24 12:21:50] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12203215283895232199.kers
Total runtime 4 ms.
[2026-05-24 12:21:50] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 12:21:50] [INFO ] Invariant cache hit.
[2026-05-24 12:21:52] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-05-24 12:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30064ms
Starting structural reductions in LTL mode, iteration 1 : 503/518 places, 436/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31946 ms. Remains : 503/518 places, 436/450 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((X(X(p0)) U p0))&&F((F(p2)&&p1))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-14
Stuttering criterion allowed to conclude after 299 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-14 finished in 32241 ms.
All properties solved by simple procedures.
Total runtime 210259 ms.

BK_STOP 1779625342569

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

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