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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.1K Mar 7 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K 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 HealthRecord-PT-17-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779738013133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 19:40:14] [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-25 19:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:40:14] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 19:40:14] [INFO ] Transformed 624 places.
[2026-05-25 19:40:14] [INFO ] Transformed 828 transitions.
[2026-05-25 19:40:14] [INFO ] Found NUPN structural information;
[2026-05-25 19:40:14] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 186 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.
FORMULA HealthRecord-PT-17-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 499 transition count 678
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 499 transition count 678
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 301 place count 448 transition count 616
Iterating global reduction 0 with 51 rules applied. Total rules applied 352 place count 448 transition count 616
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 357 place count 448 transition count 611
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 382 place count 423 transition count 567
Iterating global reduction 1 with 25 rules applied. Total rules applied 407 place count 423 transition count 567
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 419 place count 411 transition count 548
Iterating global reduction 1 with 12 rules applied. Total rules applied 431 place count 411 transition count 548
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 437 place count 405 transition count 536
Iterating global reduction 1 with 6 rules applied. Total rules applied 443 place count 405 transition count 536
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 445 place count 403 transition count 532
Iterating global reduction 1 with 2 rules applied. Total rules applied 447 place count 403 transition count 532
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 449 place count 401 transition count 530
Iterating global reduction 1 with 2 rules applied. Total rules applied 451 place count 401 transition count 530
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 453 place count 399 transition count 528
Iterating global reduction 1 with 2 rules applied. Total rules applied 455 place count 399 transition count 528
Applied a total of 455 rules in 183 ms. Remains 399 /624 variables (removed 225) and now considering 528/828 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3246174583165254210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4978605218326503321.kers'
[2026-05-25 19:40:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3246174583165254210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4978605218326503321.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 528 rows 399 cols 1259 entries
Finished phase 1 with 379 SingleSign rule and 2 generalized
[2026-05-25 19:40:14] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4978605218326503321.kers
Total runtime 3 ms.
[2026-05-25 19:40:15] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-25 19:40:15] [INFO ] Invariant cache hit.
[2026-05-25 19:40:15] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 527 sub problems to find dead transitions.
[2026-05-25 19:40:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/927 variables, and 72 constraints, problems are : Problem set: 0 solved, 527 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 527/527 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 527 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 8 (OVERLAPS) 528/927 variables, 399/474 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 527/1001 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 927/927 variables, and 1003 constraints, problems are : Problem set: 0 solved, 527 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 527/527 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 527 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 399/624 places, 528/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61024 ms. Remains : 399/624 places, 528/828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-25 19:41:15] [INFO ] Invariant cache hit.
[2026-05-25 19:41:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 19:41:15] [INFO ] Invariant cache hit.
[2026-05-25 19:41:16] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 399/399 places, 528/528 transitions.
Support contains 21 out of 399 places after structural reductions.
[2026-05-25 19:41:16] [INFO ] Flatten gal took : 54 ms
[2026-05-25 19:41:16] [INFO ] Flatten gal took : 23 ms
[2026-05-25 19:41:16] [INFO ] Input system was already deterministic with 528 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (348 resets) in 1461 ms. (27 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40002 steps (56 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (58 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (56 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (56 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (57 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (56 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (61 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (54 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
[2026-05-25 19:41:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 226/238 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 97/335 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 64/399 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 528/927 variables, 399/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/927 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 422 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 226/238 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 97/335 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 64/399 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 528/927 variables, 399/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 451 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5931ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 4 properties in 1998 ms.
Support contains 5 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 528/528 transitions.
Graph (trivial) has 451 edges and 399 vertex of which 71 / 399 are part of one of the 20 SCC in 29 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 780 edges and 348 vertex of which 339 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 339 transition count 297
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 168 rules applied. Total rules applied 320 place count 189 transition count 279
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 330 place count 180 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 179 transition count 278
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 331 place count 179 transition count 273
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 341 place count 174 transition count 273
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 356 place count 159 transition count 244
Iterating global reduction 4 with 15 rules applied. Total rules applied 371 place count 159 transition count 244
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 4 with 5 rules applied. Total rules applied 376 place count 159 transition count 239
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 381 place count 154 transition count 239
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 392 place count 143 transition count 221
Iterating global reduction 6 with 11 rules applied. Total rules applied 403 place count 143 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 406 place count 143 transition count 218
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 410 place count 139 transition count 214
Iterating global reduction 7 with 4 rules applied. Total rules applied 414 place count 139 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 417 place count 139 transition count 211
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 523 place count 86 transition count 154
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 533 place count 86 transition count 144
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 540 place count 79 transition count 130
Iterating global reduction 9 with 7 rules applied. Total rules applied 547 place count 79 transition count 130
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 549 place count 77 transition count 127
Iterating global reduction 9 with 2 rules applied. Total rules applied 551 place count 77 transition count 127
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 552 place count 76 transition count 123
Iterating global reduction 9 with 1 rules applied. Total rules applied 553 place count 76 transition count 123
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 563 place count 71 transition count 181
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 564 place count 70 transition count 179
Iterating global reduction 9 with 1 rules applied. Total rules applied 565 place count 70 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 575 place count 70 transition count 169
Free-agglomeration rule applied 25 times with reduction of 5 identical transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 600 place count 70 transition count 139
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 625 place count 45 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 633 place count 45 transition count 131
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 643 place count 45 transition count 131
Applied a total of 643 rules in 184 ms. Remains 45 /399 variables (removed 354) and now considering 131/528 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 45/399 places, 131/528 transitions.
RANDOM walk for 40000 steps (191 resets) in 330 ms. (120 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (60 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (73 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
[2026-05-25 19:41:25] [INFO ] Flow matrix only has 116 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12730649749870300909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3090167942668252022.kers'
[2026-05-25 19:41:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12730649749870300909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3090167942668252022.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 43 cols 610 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 19:41:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3090167942668252022.kers
Total runtime 1 ms.
[2026-05-25 19:41:25] [INFO ] State equation strengthened by 34 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/43 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 116/161 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 34/34 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/43 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 116/161 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/161 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 131/131 transitions.
Graph (trivial) has 10 edges and 45 vertex of which 2 / 45 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 205 edges and 44 vertex of which 35 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 35 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 34 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 34 transition count 107
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 26 place count 33 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 31 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 31 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 29 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 28 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 28 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 28 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 28 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 28 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 27 transition count 92
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 53 place count 27 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 61 place count 27 transition count 84
Applied a total of 61 rules in 20 ms. Remains 27 /45 variables (removed 18) and now considering 84/131 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 27/45 places, 84/131 transitions.
RANDOM walk for 40000 steps (7119 resets) in 1123 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (949 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (940 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1013 steps, run visited all 2 properties in 12 ms. (steps per millisecond=84 )
Probabilistic random walk after 1013 steps, saw 423 distinct states, run finished after 16 ms. (steps per millisecond=63 ) properties seen :2
Computed a total of 113 stabilizing places and 122 stable 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' '!((((p0&&F(p1)) U (p2&&X(F(p2)))) U X(p1)))'
Support contains 5 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 389 transition count 515
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 389 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 389 transition count 514
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 382 transition count 502
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 382 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 382 transition count 501
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 375 transition count 492
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 375 transition count 492
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 370 transition count 484
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 370 transition count 484
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 366 transition count 479
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 366 transition count 479
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 362 transition count 474
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 362 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 362 transition count 472
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 361 transition count 470
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 361 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 361 transition count 467
Applied a total of 83 rules in 71 ms. Remains 361 /399 variables (removed 38) and now considering 467/528 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8554133808674409825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4897615819482214785.kers'
[2026-05-25 19:41:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8554133808674409825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4897615819482214785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 361 cols 1105 entries
Finished phase 1 with 341 SingleSign rule and 2 generalized
[2026-05-25 19:41:26] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4897615819482214785.kers
Total runtime 2 ms.
[2026-05-25 19:41:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 19:41:26] [INFO ] Invariant cache hit.
[2026-05-25 19:41:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2026-05-25 19:41:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/828 variables, and 51 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 467/828 variables, 361/432 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 466/898 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 900 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 361/399 places, 467/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60404 ms. Remains : 361/399 places, 467/528 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&p1) U (p2&&X(F(p2)))) U X(p0)))'
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 19 factoid took 12 ms. Proved property starting from automaton with 9 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-01 finished in 61488 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&&(p0 U X(G(p1))))) U X(!p2))))'
Support contains 6 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 391 transition count 518
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 391 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 391 transition count 517
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 386 transition count 507
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 386 transition count 507
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 382 transition count 502
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 382 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 379 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 379 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 378 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 377 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 377 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 376 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 376 transition count 493
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 376 transition count 490
Applied a total of 50 rules in 46 ms. Remains 376 /399 variables (removed 23) and now considering 490/528 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17846391785065657705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15091059467149106622.kers'
[2026-05-25 19:42:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17846391785065657705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15091059467149106622.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 376 cols 1159 entries
Finished phase 1 with 356 SingleSign rule and 2 generalized
[2026-05-25 19:42:28] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15091059467149106622.kers
Total runtime 9 ms.
[2026-05-25 19:42:28] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-25 19:42:28] [INFO ] Invariant cache hit.
[2026-05-25 19:42:28] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2026-05-25 19:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/866 variables, and 63 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (OVERLAPS) 490/866 variables, 376/443 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 489/932 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/866 variables, and 933 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 376/399 places, 490/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 376/399 places, 490/528 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 U X(G(p1)))&&p0)) U X(!p2))))'
Stuttering acceptance computed with spot in 324 ms :[p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-04
Product exploration explored 100000 steps with 873 reset in 170 ms.
Stack based approach found an accepted trace after 61254 steps with 531 reset with depth 113 and stack size 110 in 129 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-04 finished in 61241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 390 transition count 516
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 390 transition count 516
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 383 transition count 503
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 383 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 383 transition count 502
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 376 transition count 493
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 376 transition count 493
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 371 transition count 485
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 371 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 367 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 367 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 363 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 363 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 363 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 362 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 362 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 362 transition count 467
Applied a total of 81 rules in 40 ms. Remains 362 /399 variables (removed 37) and now considering 467/528 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18443485458485734359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8778327427505728279.kers'
[2026-05-25 19:43:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18443485458485734359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8778327427505728279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 362 cols 1105 entries
Finished phase 1 with 342 SingleSign rule and 2 generalized
[2026-05-25 19:43:29] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8778327427505728279.kers
Total runtime 5 ms.
[2026-05-25 19:43:29] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 19:43:29] [INFO ] Invariant cache hit.
[2026-05-25 19:43:29] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2026-05-25 19:43:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (OVERLAPS) 467/829 variables, 362/411 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 829/829 variables, and 414 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 10 (OVERLAPS) 467/829 variables, 362/438 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/829 variables, 466/904 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 829/829 variables, and 904 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 362/399 places, 467/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60389 ms. Remains : 362/399 places, 467/528 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-06
Product exploration explored 100000 steps with 24968 reset in 103 ms.
Product exploration explored 100000 steps with 24958 reset in 103 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Knowledge based reduction with 6 factoid took 48 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (352 resets) in 287 ms. (138 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (61 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2026-05-25 19:44:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/305 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/362 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 467/829 variables, 362/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/829 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 380 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/305 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/362 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 467/829 variables, 362/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/829 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 829/829 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 838ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 467/467 transitions.
Graph (trivial) has 406 edges and 362 vertex of which 60 / 362 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 695 edges and 323 vertex of which 313 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 313 transition count 253
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 161 rules applied. Total rules applied 311 place count 165 transition count 240
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 319 place count 158 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 157 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 320 place count 157 transition count 234
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 330 place count 152 transition count 234
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 339 place count 143 transition count 216
Iterating global reduction 4 with 9 rules applied. Total rules applied 348 place count 143 transition count 216
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 4 with 5 rules applied. Total rules applied 353 place count 143 transition count 211
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 358 place count 138 transition count 211
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 366 place count 130 transition count 198
Iterating global reduction 6 with 8 rules applied. Total rules applied 374 place count 130 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 377 place count 130 transition count 195
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 475 place count 81 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 485 place count 81 transition count 133
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 492 place count 74 transition count 119
Iterating global reduction 8 with 7 rules applied. Total rules applied 499 place count 74 transition count 119
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 501 place count 72 transition count 116
Iterating global reduction 8 with 2 rules applied. Total rules applied 503 place count 72 transition count 116
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 504 place count 71 transition count 112
Iterating global reduction 8 with 1 rules applied. Total rules applied 505 place count 71 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 508 place count 71 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 520 place count 65 transition count 161
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 521 place count 64 transition count 159
Iterating global reduction 9 with 1 rules applied. Total rules applied 522 place count 64 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 531 place count 64 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 533 place count 63 transition count 161
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 534 place count 62 transition count 158
Iterating global reduction 9 with 1 rules applied. Total rules applied 535 place count 62 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 543 place count 62 transition count 150
Free-agglomeration rule applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 567 place count 62 transition count 126
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 594 place count 38 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 601 place count 38 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 603 place count 38 transition count 116
Applied a total of 603 rules in 45 ms. Remains 38 /362 variables (removed 324) and now considering 116/467 (removed 351) transitions.
Running 108 sub problems to find dead transitions.
[2026-05-25 19:44:31] [INFO ] Flow matrix only has 100 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17872385278148335592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11909362514342383406.kers'
[2026-05-25 19:44:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17872385278148335592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11909362514342383406.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 100 rows 36 cols 471 entries
Finished phase 1 with 28 SingleSign rule and 2 generalized
[2026-05-25 19:44:31] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11909362514342383406.kers
Total runtime 1 ms.
[2026-05-25 19:44:31] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 5 (OVERLAPS) 100/138 variables, 38/47 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 33/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 80 constraints, problems are : Problem set: 2 solved, 106 unsolved in 2503 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 100/138 variables, 38/47 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 33/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 106/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 186 constraints, problems are : Problem set: 2 solved, 106 unsolved in 5190 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7734ms problems are : Problem set: 2 solved, 106 unsolved
Search for dead transitions found 2 dead transitions in 7734ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/362 places, 114/467 transitions.
Graph (complete) has 161 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 37 transition count 114
Applied a total of 5 rules in 12 ms. Remains 37 /38 variables (removed 1) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7791 ms. Remains : 37/362 places, 114/467 transitions.
RANDOM walk for 40000 steps (5602 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (650 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (891 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4127 steps, run visited all 2 properties in 20 ms. (steps per millisecond=206 )
Probabilistic random walk after 4127 steps, saw 1313 distinct states, run finished after 20 ms. (steps per millisecond=206 ) properties seen :2
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 9350 ms.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 467/467 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 467/467 (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-68040338100028322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15933737684633305695.kers'
[2026-05-25 19:44:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-68040338100028322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15933737684633305695.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 362 cols 1105 entries
Finished phase 1 with 342 SingleSign rule and 2 generalized
[2026-05-25 19:44:39] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15933737684633305695.kers
Total runtime 6 ms.
[2026-05-25 19:44:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 19:44:39] [INFO ] Invariant cache hit.
[2026-05-25 19:44:39] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 362/362 places, 467/467 transitions.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Knowledge based reduction with 6 factoid took 42 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (348 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (58 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
[2026-05-25 19:44:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/305 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/362 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 467/829 variables, 362/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/829 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 380 constraints, problems are : Problem set: 0 solved, 2 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/305 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/362 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 467/829 variables, 362/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/829 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 829/829 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 467/467 transitions.
Graph (trivial) has 406 edges and 362 vertex of which 60 / 362 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 695 edges and 323 vertex of which 313 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 313 transition count 253
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 161 rules applied. Total rules applied 311 place count 165 transition count 240
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 319 place count 158 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 157 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 320 place count 157 transition count 234
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 330 place count 152 transition count 234
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 339 place count 143 transition count 216
Iterating global reduction 4 with 9 rules applied. Total rules applied 348 place count 143 transition count 216
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 4 with 5 rules applied. Total rules applied 353 place count 143 transition count 211
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 358 place count 138 transition count 211
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 366 place count 130 transition count 198
Iterating global reduction 6 with 8 rules applied. Total rules applied 374 place count 130 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 377 place count 130 transition count 195
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 475 place count 81 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 485 place count 81 transition count 133
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 492 place count 74 transition count 119
Iterating global reduction 8 with 7 rules applied. Total rules applied 499 place count 74 transition count 119
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 501 place count 72 transition count 116
Iterating global reduction 8 with 2 rules applied. Total rules applied 503 place count 72 transition count 116
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 504 place count 71 transition count 112
Iterating global reduction 8 with 1 rules applied. Total rules applied 505 place count 71 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 508 place count 71 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 520 place count 65 transition count 161
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 521 place count 64 transition count 159
Iterating global reduction 9 with 1 rules applied. Total rules applied 522 place count 64 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 531 place count 64 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 533 place count 63 transition count 161
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 534 place count 62 transition count 158
Iterating global reduction 9 with 1 rules applied. Total rules applied 535 place count 62 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 543 place count 62 transition count 150
Free-agglomeration rule applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 567 place count 62 transition count 126
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 594 place count 38 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 601 place count 38 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 603 place count 38 transition count 116
Applied a total of 603 rules in 37 ms. Remains 38 /362 variables (removed 324) and now considering 116/467 (removed 351) transitions.
Running 108 sub problems to find dead transitions.
[2026-05-25 19:44:40] [INFO ] Flow matrix only has 100 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8336053664233599461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6941695413884190141.kers'
[2026-05-25 19:44:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8336053664233599461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6941695413884190141.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 100 rows 36 cols 471 entries
Finished phase 1 with 28 SingleSign rule and 2 generalized
[2026-05-25 19:44:40] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6941695413884190141.kers
Total runtime 1 ms.
[2026-05-25 19:44:40] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 5 (OVERLAPS) 100/138 variables, 38/47 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 33/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 80 constraints, problems are : Problem set: 2 solved, 106 unsolved in 2408 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 100/138 variables, 38/47 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 33/80 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 106/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 186 constraints, problems are : Problem set: 2 solved, 106 unsolved in 5126 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7566ms problems are : Problem set: 2 solved, 106 unsolved
Search for dead transitions found 2 dead transitions in 7566ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/362 places, 114/467 transitions.
Graph (complete) has 161 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 37 transition count 114
Applied a total of 5 rules in 14 ms. Remains 37 /38 variables (removed 1) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7618 ms. Remains : 37/362 places, 114/467 transitions.
RANDOM walk for 40000 steps (5567 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (663 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2026-05-25 19:44:48] [INFO ] Flow matrix only has 98 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7565644635924449334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1332623521130875511.kers'
[2026-05-25 19:44:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7565644635924449334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1332623521130875511.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 98 rows 35 cols 471 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 19:44:48] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1332623521130875511.kers
Total runtime 0 ms.
[2026-05-25 19:44:48] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/113 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 22/135 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 57 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 32/32 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/113 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/135 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 469 steps, including 51 resets, run visited all 1 properties in 3 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 8 ms.
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 9146 ms.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25028 reset in 103 ms.
Product exploration explored 100000 steps with 24965 reset in 103 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15044655612790490790
[2026-05-25 19:44:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15044655612790490790
Running compilation step : cd /tmp/ltsmin15044655612790490790;'/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 887 ms.
Running link step : cd /tmp/ltsmin15044655612790490790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15044655612790490790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8902641237863380666.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 467/467 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 467/467 (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-8916689657032821788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17624856422209972556.kers'
[2026-05-25 19:45:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8916689657032821788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17624856422209972556.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 362 cols 1105 entries
Finished phase 1 with 342 SingleSign rule and 2 generalized
[2026-05-25 19:45:04] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17624856422209972556.kers
Total runtime 4 ms.
[2026-05-25 19:45:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 19:45:04] [INFO ] Invariant cache hit.
[2026-05-25 19:45:04] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 362/362 places, 467/467 transitions.
Built C files in :
/tmp/ltsmin14612420138925956938
[2026-05-25 19:45:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14612420138925956938
Running compilation step : cd /tmp/ltsmin14612420138925956938;'/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 610 ms.
Running link step : cd /tmp/ltsmin14612420138925956938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14612420138925956938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9421298697024422746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 19:45:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:45:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:45:20] [INFO ] Time to serialize gal into /tmp/LTL9294782950208649606.gal : 4 ms
[2026-05-25 19:45:20] [INFO ] Time to serialize properties into /tmp/LTL17107455756438177167.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9294782950208649606.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16703419446539692756.hoa' '-atoms' '/tmp/LTL17107455756438177167.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17107455756438177167.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16703419446539692756.hoa
Detected timeout of ITS tools.
[2026-05-25 19:45:35] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:45:35] [INFO ] Flatten gal took : 15 ms
[2026-05-25 19:45:35] [INFO ] Time to serialize gal into /tmp/LTL16031157662174565824.gal : 4 ms
[2026-05-25 19:45:35] [INFO ] Time to serialize properties into /tmp/LTL12508287250033651007.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16031157662174565824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12508287250033651007.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(p510==1)"))U(X(X(G("((p136==0)||(p384==1))"))))))
Formula 0 simplified : G!"(p510==1)" R XXF!"((p136==0)||(p384==1))"
Detected timeout of ITS tools.
[2026-05-25 19:45:50] [INFO ] Flatten gal took : 15 ms
[2026-05-25 19:45:50] [INFO ] Applying decomposition
[2026-05-25 19:45:50] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3111368884577032402.txt' '-o' '/tmp/graph3111368884577032402.bin' '-w' '/tmp/graph3111368884577032402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3111368884577032402.bin' '-l' '-1' '-v' '-w' '/tmp/graph3111368884577032402.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:45:50] [INFO ] Decomposing Gal with order
[2026-05-25 19:45:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:45:50] [INFO ] Removed a total of 164 redundant transitions.
[2026-05-25 19:45:50] [INFO ] Flatten gal took : 89 ms
[2026-05-25 19:45:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 28 ms.
[2026-05-25 19:45:50] [INFO ] Time to serialize gal into /tmp/LTL10190034971339740439.gal : 17 ms
[2026-05-25 19:45:50] [INFO ] Time to serialize properties into /tmp/LTL15465076646138060946.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10190034971339740439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15465076646138060946.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("(i20.i0.u111.p510==1)"))U(X(X(G("((i5.i0.u23.p136==0)||(i16.i0.u83.p384==1))"))))))
Formula 0 simplified : G!"(i20.i0.u111.p510==1)" R XXF!"((i5.i0.u23.p136==0)||(i16.i0.u83.p384==1))"
Reverse transition relation is NOT exact ! Due to transitions t254, t467, t472, i1.i0.t447, i3.i0.t437, i3.i0.u6.t403, i3.i0.u6.t405, i3.i0.u6.t406, i3.i0....1822
Computing Next relation with stutter on 3.70995e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
852 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.56914,248172,1,0,422305,5435,6618,793672,738,22546,1324408
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-17-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HealthRecord-PT-17-LTLCardinality-06 finished in 151039 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(X(X(X(F(p0))))))||F(p1))))'
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Graph (trivial) has 454 edges and 399 vertex of which 73 / 399 are part of one of the 21 SCC in 4 ms
Free SCC test removed 52 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 346 transition count 319
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 163 rules applied. Total rules applied 310 place count 200 transition count 302
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 319 place count 192 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 191 transition count 301
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 320 place count 191 transition count 296
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 330 place count 186 transition count 296
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 353 place count 163 transition count 258
Iterating global reduction 4 with 23 rules applied. Total rules applied 376 place count 163 transition count 258
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 380 place count 163 transition count 254
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 384 place count 159 transition count 254
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 393 place count 150 transition count 240
Iterating global reduction 6 with 9 rules applied. Total rules applied 402 place count 150 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 405 place count 150 transition count 237
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 408 place count 147 transition count 234
Iterating global reduction 7 with 3 rules applied. Total rules applied 411 place count 147 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 414 place count 147 transition count 231
Performed 53 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 520 place count 94 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 527 place count 94 transition count 169
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 536 place count 85 transition count 151
Iterating global reduction 9 with 9 rules applied. Total rules applied 545 place count 85 transition count 151
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 548 place count 82 transition count 147
Iterating global reduction 9 with 3 rules applied. Total rules applied 551 place count 82 transition count 147
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 552 place count 81 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 553 place count 81 transition count 146
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 554 place count 80 transition count 142
Iterating global reduction 9 with 1 rules applied. Total rules applied 555 place count 80 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 558 place count 80 transition count 139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 566 place count 76 transition count 178
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 567 place count 75 transition count 176
Iterating global reduction 10 with 1 rules applied. Total rules applied 568 place count 75 transition count 176
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 569 place count 74 transition count 172
Iterating global reduction 10 with 1 rules applied. Total rules applied 570 place count 74 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 587 place count 74 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 589 place count 73 transition count 164
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 590 place count 72 transition count 161
Iterating global reduction 10 with 1 rules applied. Total rules applied 591 place count 72 transition count 161
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 594 place count 69 transition count 157
Iterating global reduction 10 with 3 rules applied. Total rules applied 597 place count 69 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 608 place count 69 transition count 146
Applied a total of 608 rules in 71 ms. Remains 69 /399 variables (removed 330) and now considering 146/528 (removed 382) transitions.
[2026-05-25 19:46:00] [INFO ] Flow matrix only has 135 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10454340056458713253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14560962889303032107.kers'
[2026-05-25 19:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10454340056458713253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14560962889303032107.kers]
Normalized transition count is 134 out of 135 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 69 cols 542 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-25 19:46:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14560962889303032107.kers
Total runtime 3 ms.
[2026-05-25 19:46:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 19:46:00] [INFO ] Flow matrix only has 135 transitions (discarded 11 similar events)
[2026-05-25 19:46:00] [INFO ] Invariant cache hit.
[2026-05-25 19:46:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 19:46:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2026-05-25 19:46:00] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-25 19:46:00] [INFO ] Flow matrix only has 135 transitions (discarded 11 similar events)
[2026-05-25 19:46:00] [INFO ] Invariant cache hit.
[2026-05-25 19:46:00] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 134/203 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 92 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5389 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 134/203 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 138/231 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 234 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21423ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 21424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/399 places, 146/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21718 ms. Remains : 69/399 places, 146/528 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(X(X(X(F(p0))))))||F(p1))))'
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-11
Stuttering criterion allowed to conclude after 5553 steps with 420 reset in 23 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-11 finished in 22035 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))'
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Graph (trivial) has 458 edges and 399 vertex of which 73 / 399 are part of one of the 21 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 346 transition count 318
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 165 rules applied. Total rules applied 313 place count 199 transition count 300
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 322 place count 190 transition count 300
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 322 place count 190 transition count 295
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 332 place count 185 transition count 295
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 357 place count 160 transition count 254
Iterating global reduction 3 with 25 rules applied. Total rules applied 382 place count 160 transition count 254
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 3 with 5 rules applied. Total rules applied 387 place count 160 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 392 place count 155 transition count 249
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 403 place count 144 transition count 231
Iterating global reduction 5 with 11 rules applied. Total rules applied 414 place count 144 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 417 place count 144 transition count 228
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 421 place count 140 transition count 224
Iterating global reduction 6 with 4 rules applied. Total rules applied 425 place count 140 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 428 place count 140 transition count 221
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 534 place count 87 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 539 place count 87 transition count 159
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 546 place count 80 transition count 145
Iterating global reduction 8 with 7 rules applied. Total rules applied 553 place count 80 transition count 145
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 556 place count 77 transition count 140
Iterating global reduction 8 with 3 rules applied. Total rules applied 559 place count 77 transition count 140
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 560 place count 76 transition count 136
Iterating global reduction 8 with 1 rules applied. Total rules applied 561 place count 76 transition count 136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 569 place count 72 transition count 186
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 571 place count 70 transition count 180
Iterating global reduction 8 with 2 rules applied. Total rules applied 573 place count 70 transition count 180
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 574 place count 69 transition count 176
Iterating global reduction 8 with 1 rules applied. Total rules applied 575 place count 69 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 580 place count 69 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 596 place count 69 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 598 place count 68 transition count 166
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 599 place count 67 transition count 163
Iterating global reduction 9 with 1 rules applied. Total rules applied 600 place count 67 transition count 163
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 603 place count 64 transition count 158
Iterating global reduction 9 with 3 rules applied. Total rules applied 606 place count 64 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 617 place count 64 transition count 147
Applied a total of 617 rules in 34 ms. Remains 64 /399 variables (removed 335) and now considering 147/528 (removed 381) transitions.
[2026-05-25 19:46:22] [INFO ] Flow matrix only has 137 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10870343521641998929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1899248765984730485.kers'
[2026-05-25 19:46:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10870343521641998929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1899248765984730485.kers]
Normalized transition count is 136 out of 137 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 64 cols 578 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-25 19:46:22] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1899248765984730485.kers
Total runtime 0 ms.
[2026-05-25 19:46:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 19:46:22] [INFO ] Flow matrix only has 137 transitions (discarded 10 similar events)
[2026-05-25 19:46:22] [INFO ] Invariant cache hit.
[2026-05-25 19:46:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 19:46:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-25 19:46:22] [INFO ] Redundant transitions in 23 ms returned []
Running 139 sub problems to find dead transitions.
[2026-05-25 19:46:22] [INFO ] Flow matrix only has 137 transitions (discarded 10 similar events)
[2026-05-25 19:46:22] [INFO ] Invariant cache hit.
[2026-05-25 19:46:22] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 136/200 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 136/200 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 139/240 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 241 constraints, problems are : Problem set: 0 solved, 139 unsolved in 14045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20233ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 20235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/399 places, 147/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20419 ms. Remains : 64/399 places, 147/528 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-13 finished in 20495 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((p0||X((X(X(p2))&&p1)))))'
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 390 transition count 516
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 390 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 390 transition count 515
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 383 transition count 503
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 383 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 383 transition count 502
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 376 transition count 494
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 376 transition count 494
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 371 transition count 486
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 371 transition count 486
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 368 transition count 483
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 368 transition count 483
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 365 transition count 480
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 365 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 365 transition count 477
Applied a total of 73 rules in 33 ms. Remains 365 /399 variables (removed 34) and now considering 477/528 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7066976725739358574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17983937885461431218.kers'
[2026-05-25 19:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7066976725739358574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17983937885461431218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 477 rows 365 cols 1141 entries
Finished phase 1 with 345 SingleSign rule and 2 generalized
[2026-05-25 19:46:42] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17983937885461431218.kers
Total runtime 2 ms.
[2026-05-25 19:46:42] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 19:46:42] [INFO ] Invariant cache hit.
[2026-05-25 19:46:43] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2026-05-25 19:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/365 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 476 unsolved
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Starting structural reductions in LTL mode, iteration 1 : 365/399 places, 477/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30446 ms. Remains : 365/399 places, 477/528 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(X(p1))&&p0))||p2)))'
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-15 finished in 30642 ms.
All properties solved by simple procedures.
Total runtime 419181 ms.

BK_STOP 1779738433491

--------------------
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="HealthRecord-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 HealthRecord-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 r146-tall-177961074300667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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