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-177961074300612.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 7 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:43 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 69K 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-10-LTLFireability-00
FORMULA_NAME HealthRecord-PT-10-LTLFireability-01
FORMULA_NAME HealthRecord-PT-10-LTLFireability-02
FORMULA_NAME HealthRecord-PT-10-LTLFireability-03
FORMULA_NAME HealthRecord-PT-10-LTLFireability-04
FORMULA_NAME HealthRecord-PT-10-LTLFireability-05
FORMULA_NAME HealthRecord-PT-10-LTLFireability-06
FORMULA_NAME HealthRecord-PT-10-LTLFireability-07
FORMULA_NAME HealthRecord-PT-10-LTLFireability-08
FORMULA_NAME HealthRecord-PT-10-LTLFireability-09
FORMULA_NAME HealthRecord-PT-10-LTLFireability-10
FORMULA_NAME HealthRecord-PT-10-LTLFireability-11
FORMULA_NAME HealthRecord-PT-10-LTLFireability-12
FORMULA_NAME HealthRecord-PT-10-LTLFireability-13
FORMULA_NAME HealthRecord-PT-10-LTLFireability-14
FORMULA_NAME HealthRecord-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779736554092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 19:15:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:15:55] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 19:15:55] [INFO ] Transformed 158 places.
[2026-05-25 19:15:55] [INFO ] Transformed 333 transitions.
[2026-05-25 19:15:55] [INFO ] Found NUPN structural information;
[2026-05-25 19:15:55] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 82 transition count 163
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 82 transition count 163
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 158 place count 76 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 164 place count 76 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 168 place count 76 transition count 147
Applied a total of 168 rules in 37 ms. Remains 76 /158 variables (removed 82) and now considering 147/306 (removed 159) transitions.
[2026-05-25 19:15:55] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8293131211354089221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12571416926788148504.kers'
[2026-05-25 19:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8293131211354089221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12571416926788148504.kers]
Normalized transition count is 143 out of 144 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 76 cols 451 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 19:15:55] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12571416926788148504.kers
Total runtime 1 ms.
[2026-05-25 19:15:55] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 19:15:55] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
[2026-05-25 19:15:55] [INFO ] Invariant cache hit.
[2026-05-25 19:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:15:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 19:15:55] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
[2026-05-25 19:15:55] [INFO ] Invariant cache hit.
[2026-05-25 19:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 143/219 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 1/220 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/220 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 96 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 143/219 variables, 76/102 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 146/248 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 1/220 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 249 constraints, problems are : Problem set: 0 solved, 146 unsolved in 19034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26638ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 26654ms
Starting structural reductions in LTL mode, iteration 1 : 76/158 places, 147/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27023 ms. Remains : 76/158 places, 147/306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 19:16:22] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
[2026-05-25 19:16:22] [INFO ] Invariant cache hit.
[2026-05-25 19:16:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:16:22] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
[2026-05-25 19:16:22] [INFO ] Invariant cache hit.
[2026-05-25 19:16:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:16:22] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 76/76 places, 147/147 transitions.
Support contains 40 out of 76 places after structural reductions.
[2026-05-25 19:16:22] [INFO ] Flatten gal took : 36 ms
[2026-05-25 19:16:22] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:16:22] [INFO ] Input system was already deterministic with 147 transitions.
Support contains 39 out of 76 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (2529 resets) in 2128 ms. (18 steps per ms) remains 15/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
[2026-05-25 19:16:23] [INFO ] Flow matrix only has 144 transitions (discarded 3 similar events)
[2026-05-25 19:16:23] [INFO ] Invariant cache hit.
[2026-05-25 19:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 12/76 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 143/219 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 90 constraints, problems are : Problem set: 0 solved, 15 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 12/76 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 143/219 variables, 76/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1/220 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 114 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2587ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 13 properties in 909 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 147/147 transitions.
Graph (trivial) has 90 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 26 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 291 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 133
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 4 rules applied. Total rules applied 8 place count 69 transition count 131
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 68 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 68 transition count 128
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 15 place count 65 transition count 128
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 32 place count 48 transition count 94
Iterating global reduction 3 with 17 rules applied. Total rules applied 49 place count 48 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 48 transition count 92
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 56 place count 43 transition count 80
Iterating global reduction 4 with 5 rules applied. Total rules applied 61 place count 43 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 40 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 40 transition count 70
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 76 place count 40 transition count 64
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 77 place count 39 transition count 62
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 39 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 81 place count 39 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 91 place count 34 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 92 place count 34 transition count 89
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 95 place count 34 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 98 place count 31 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 100 place count 31 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 103 place count 31 transition count 144
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 107 place count 28 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 110 place count 28 transition count 140
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 111 place count 27 transition count 107
Iterating global reduction 9 with 1 rules applied. Total rules applied 112 place count 27 transition count 107
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 113 place count 26 transition count 105
Iterating global reduction 9 with 1 rules applied. Total rules applied 114 place count 26 transition count 105
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 124 place count 26 transition count 95
Applied a total of 124 rules in 76 ms. Remains 26 /76 variables (removed 50) and now considering 95/147 (removed 52) transitions.
Running 79 sub problems to find dead transitions.
[2026-05-25 19:16:27] [INFO ] Flow matrix only has 77 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4842213651049768925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15540448088119142529.kers'
[2026-05-25 19:16:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4842213651049768925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15540448088119142529.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 26 cols 394 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-25 19:16:27] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15540448088119142529.kers
Total runtime 3 ms.
[2026-05-25 19:16:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 5 (OVERLAPS) 77/103 variables, 26/34 constraints. Problems are: Problem set: 2 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 20/54 constraints. Problems are: Problem set: 2 solved, 77 unsolved
Problem TDEAD41 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/55 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 55 constraints, problems are : Problem set: 3 solved, 76 unsolved in 1686 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/103 variables, 26/35 constraints. Problems are: Problem set: 3 solved, 76 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 20/55 constraints. Problems are: Problem set: 5 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 74/129 constraints. Problems are: Problem set: 5 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 5 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/129 constraints. Problems are: Problem set: 5 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 129 constraints, problems are : Problem set: 5 solved, 74 unsolved in 2746 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 74/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4469ms problems are : Problem set: 5 solved, 74 unsolved
Search for dead transitions found 5 dead transitions in 4471ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/76 places, 90/147 transitions.
Graph (complete) has 102 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 25 transition count 82
Applied a total of 9 rules in 9 ms. Remains 25 /26 variables (removed 1) and now considering 82/90 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4556 ms. Remains : 25/76 places, 82/147 transitions.
RANDOM walk for 40000 steps (28 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (20 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (18 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 391 steps, run visited all 2 properties in 8 ms. (steps per millisecond=48 )
Probabilistic random walk after 391 steps, saw 170 distinct states, run finished after 11 ms. (steps per millisecond=35 ) properties seen :2
Computed a total of 6 stabilizing places and 9 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' '!(X((X(F((X(p2)&&p1)))||p0)))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 59 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 59 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 59 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 55 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 53 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 53 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 53 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 52 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 52 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 52 transition count 86
Applied a total of 59 rules in 6 ms. Remains 52 /76 variables (removed 24) and now considering 86/147 (removed 61) transitions.
[2026-05-25 19:16:32] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8641397743283320808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16230112556190931234.kers'
[2026-05-25 19:16:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8641397743283320808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16230112556190931234.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 52 cols 283 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:16:32] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16230112556190931234.kers
Total runtime 0 ms.
[2026-05-25 19:16:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 19:16:32] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:16:32] [INFO ] Invariant cache hit.
[2026-05-25 19:16:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:16:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 19:16:32] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:16:32] [INFO ] Invariant cache hit.
[2026-05-25 19:16:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 64 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/134 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 155 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6792 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8983ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8983ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 86/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9075 ms. Remains : 52/76 places, 86/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((X(p2)&&p1)))||p0)))'
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 3 factoid took 57 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 65 ms.
FORMULA HealthRecord-PT-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-01 finished in 9910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))||(F(p1)&&F((!p2&&X((!p2 U (!p3||G(!p2))))))))&&p0)))'
Support contains 14 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 58 transition count 111
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 58 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 58 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 54 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 54 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 52 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 52 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 52 transition count 86
Applied a total of 59 rules in 6 ms. Remains 52 /76 variables (removed 24) and now considering 86/147 (removed 61) transitions.
[2026-05-25 19:16:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5782738682594807523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18344597971002279355.kers'
[2026-05-25 19:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5782738682594807523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18344597971002279355.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 52 cols 285 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:16:42] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18344597971002279355.kers
Total runtime 0 ms.
[2026-05-25 19:16:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 19:16:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:16:42] [INFO ] Invariant cache hit.
[2026-05-25 19:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:16:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 19:16:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:16:42] [INFO ] Invariant cache hit.
[2026-05-25 19:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 64 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/134 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 151 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7386ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 7387ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 86/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7462 ms. Remains : 52/76 places, 86/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))||(F(p1)&&F((p2&&X((p2 U (!p3||G(p2))))))))&&p0)))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 26 factoid took 241 ms. Proved property starting from automaton with 6 states, 16 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 243 ms.
FORMULA HealthRecord-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-02 finished in 8289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&F((p2 U (p3||G(p2))))))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 59 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 59 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 59 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 55 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 53 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 53 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 53 transition count 88
Applied a total of 57 rules in 8 ms. Remains 53 /76 variables (removed 23) and now considering 88/147 (removed 59) transitions.
[2026-05-25 19:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3660764302210610961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14579417786079099597.kers'
[2026-05-25 19:16:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3660764302210610961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14579417786079099597.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 53 cols 289 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 19:16:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14579417786079099597.kers
Total runtime 0 ms.
[2026-05-25 19:16:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:16:50] [INFO ] Invariant cache hit.
[2026-05-25 19:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:16:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 19:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:16:50] [INFO ] Invariant cache hit.
[2026-05-25 19:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/137 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 87/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 157 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5810 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8045ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8045ms
Starting structural reductions in LTL mode, iteration 1 : 53/76 places, 88/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8148 ms. Remains : 53/76 places, 88/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&F((p2 U (p3||G(p2))))))))'
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 1 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 18 factoid took 77 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 40000 steps (2518 resets) in 235 ms. (169 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (333 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (319 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2026-05-25 19:16:59] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:16:59] [INFO ] Invariant cache hit.
[2026-05-25 19:16:59] [INFO ] State equation strengthened by 1 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 49 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 181 edges and 48 vertex of which 32 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 32 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 24 place count 32 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 27 transition count 42
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 24 transition count 35
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 23 transition count 34
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 23 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 22 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 22 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 22 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 18 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 16 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 15 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 14 transition count 17
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 14 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 14 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 12 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 12 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 12 transition count 13
Applied a total of 74 rules in 11 ms. Remains 12 /53 variables (removed 41) and now considering 13/88 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 12/53 places, 13/88 transitions.
RANDOM walk for 194 steps (22 resets) in 5 ms. (32 steps per ms) remains 0/2 properties
Knowledge based reduction with 18 factoid took 230 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 873 ms.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-25 19:17:00] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:17:00] [INFO ] Invariant cache hit.
[2026-05-25 19:17:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:17:00] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:17:00] [INFO ] Invariant cache hit.
[2026-05-25 19:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:00] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 53/53 places, 88/88 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 18 factoid took 64 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 40000 steps (2527 resets) in 101 ms. (392 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (325 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (330 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2026-05-25 19:17:00] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:17:00] [INFO ] Invariant cache hit.
[2026-05-25 19:17:00] [INFO ] State equation strengthened by 1 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 49 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 181 edges and 48 vertex of which 32 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 32 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 24 place count 32 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 27 transition count 42
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 24 transition count 35
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 23 transition count 34
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 23 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 22 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 22 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 22 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 18 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 16 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 15 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 14 transition count 17
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 14 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 14 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 12 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 12 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 12 transition count 13
Applied a total of 74 rules in 14 ms. Remains 12 /53 variables (removed 41) and now considering 13/88 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 12/53 places, 13/88 transitions.
RANDOM walk for 278 steps (39 resets) in 5 ms. (46 steps per ms) remains 0/2 properties
Knowledge based reduction with 18 factoid took 262 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 808 ms.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 2 reset in 176 ms.
Spot run failed in 984 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/ltsmin4942072827150480858
[2026-05-25 19:17:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4942072827150480858
Running compilation step : cd /tmp/ltsmin4942072827150480858;'/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 507 ms.
Running link step : cd /tmp/ltsmin4942072827150480858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4942072827150480858;'/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/stateBased17734491041671327422.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA HealthRecord-PT-10-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-03 finished in 12750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(p1)))||(p2 U (p3||G(p2)))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 60 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 57 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 57 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 55 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 55 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 54 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 54 transition count 93
Applied a total of 52 rules in 10 ms. Remains 54 /76 variables (removed 22) and now considering 93/147 (removed 54) transitions.
[2026-05-25 19:17:03] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4616354268670757877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18343648456631922712.kers'
[2026-05-25 19:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4616354268670757877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18343648456631922712.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 54 cols 305 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:17:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18343648456631922712.kers
Total runtime 0 ms.
[2026-05-25 19:17:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:17:03] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:17:03] [INFO ] Invariant cache hit.
[2026-05-25 19:17:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 19:17:03] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:17:03] [INFO ] Invariant cache hit.
[2026-05-25 19:17:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 89/143 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/144 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 66 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2577 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 92/160 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 161 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6480 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9070ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 9071ms
Starting structural reductions in LTL mode, iteration 1 : 54/76 places, 93/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9167 ms. Remains : 54/76 places, 93/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(p1)))||(p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 2 reset in 62 ms.
Product exploration explored 100000 steps with 1 reset in 52 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (2510 resets) in 150 ms. (264 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (326 resets) in 59 ms. (666 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (331 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (321 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2026-05-25 19:17:13] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:17:13] [INFO ] Invariant cache hit.
[2026-05-25 19:17:13] [INFO ] State equation strengthened by 1 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/54 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 64 constraints, problems are : Problem set: 1 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/54 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/143 variables, 54/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 66 constraints, problems are : Problem set: 1 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 93/93 transitions.
Graph (trivial) has 49 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 185 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 77
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 46 transition count 76
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 45 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 45 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 42 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 41 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 41 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 40 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 40 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
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 31 place count 35 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 35 transition count 99
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 35 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 39 place count 32 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 41 place count 32 transition count 94
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 53 place count 32 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 32 transition count 94
Applied a total of 54 rules in 23 ms. Remains 32 /54 variables (removed 22) and now considering 94/93 (removed -1) transitions.
Running 78 sub problems to find dead transitions.
[2026-05-25 19:17:13] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2490749726112297761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8102467031059638125.kers'
[2026-05-25 19:17:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2490749726112297761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8102467031059638125.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 32 cols 469 entries
Finished phase 1 with 23 SingleSign rule and 2 generalized
[2026-05-25 19:17:13] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8102467031059638125.kers
Total runtime 1 ms.
[2026-05-25 19:17:13] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 5 (OVERLAPS) 82/114 variables, 32/40 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 27/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 67 constraints, problems are : Problem set: 2 solved, 76 unsolved in 1514 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 82/114 variables, 32/40 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 27/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 76/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 143 constraints, problems are : Problem set: 2 solved, 76 unsolved in 3186 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4741ms problems are : Problem set: 2 solved, 76 unsolved
Search for dead transitions found 2 dead transitions in 4741ms
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 : 32/54 places, 92/93 transitions.
Graph (complete) has 114 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 28 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 28 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 13 place count 28 transition count 77
Applied a total of 13 rules in 4 ms. Remains 28 /32 variables (removed 4) and now considering 77/92 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4768 ms. Remains : 28/54 places, 77/93 transitions.
RANDOM walk for 40000 steps (3338 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1409 steps (15 resets) in 7 ms. (176 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 253 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Knowledge-based reduction took 5901 ms.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2026-05-25 19:17:19] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8709311845100136090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5066691829038616161.kers'
[2026-05-25 19:17:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8709311845100136090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5066691829038616161.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 54 cols 305 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:17:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5066691829038616161.kers
Total runtime 1 ms.
[2026-05-25 19:17:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:17:19] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:17:19] [INFO ] Invariant cache hit.
[2026-05-25 19:17:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 54/54 places, 93/93 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (2510 resets) in 114 ms. (347 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (332 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (321 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (328 resets) in 23 ms. (1666 steps per ms) remains 3/3 properties
[2026-05-25 19:17:19] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:17:19] [INFO ] Invariant cache hit.
[2026-05-25 19:17:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/54 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 64 constraints, problems are : Problem set: 0 solved, 3 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/54 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/143 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 69 constraints, problems are : Problem set: 0 solved, 3 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 10 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 93/93 transitions.
Graph (trivial) has 49 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 185 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 77
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 46 transition count 76
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 45 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 45 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 42 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 41 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 41 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 40 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 40 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
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 31 place count 35 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 35 transition count 99
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 35 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 39 place count 32 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 41 place count 32 transition count 94
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 53 place count 32 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 32 transition count 94
Applied a total of 54 rules in 14 ms. Remains 32 /54 variables (removed 22) and now considering 94/93 (removed -1) transitions.
Running 78 sub problems to find dead transitions.
[2026-05-25 19:17:19] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11007367395743818477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16316013583939752417.kers'
[2026-05-25 19:17:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11007367395743818477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16316013583939752417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 32 cols 469 entries
Finished phase 1 with 23 SingleSign rule and 2 generalized
[2026-05-25 19:17:19] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16316013583939752417.kers
Total runtime 1 ms.
[2026-05-25 19:17:19] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 5 (OVERLAPS) 82/114 variables, 32/40 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 27/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 67 constraints, problems are : Problem set: 2 solved, 76 unsolved in 1550 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 82/114 variables, 32/40 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 27/67 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 76/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 143 constraints, problems are : Problem set: 2 solved, 76 unsolved in 3262 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4837ms problems are : Problem set: 2 solved, 76 unsolved
Search for dead transitions found 2 dead transitions in 4837ms
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 : 32/54 places, 92/93 transitions.
Graph (complete) has 114 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 28 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 28 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 13 place count 28 transition count 77
Applied a total of 13 rules in 5 ms. Remains 28 /32 variables (removed 4) and now considering 77/92 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4857 ms. Remains : 28/54 places, 77/93 transitions.
RANDOM walk for 35919 steps (2956 resets) in 97 ms. (366 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Knowledge-based reduction took 6028 ms.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Spot run failed in 44 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/ltsmin8157338131206015906
[2026-05-25 19:17:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8157338131206015906
Running compilation step : cd /tmp/ltsmin8157338131206015906;'/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 176 ms.
Running link step : cd /tmp/ltsmin8157338131206015906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8157338131206015906;'/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/stateBased14785614178140120853.hoa' '--buchi-type=spotba'
LTSmin run took 12461 ms.
FORMULA HealthRecord-PT-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-05 finished in 35571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p1))&&p0)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 57 transition count 109
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 57 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 57 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 52 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 52 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 52 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 50 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 50 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 63 place count 50 transition count 82
Applied a total of 63 rules in 5 ms. Remains 50 /76 variables (removed 26) and now considering 82/147 (removed 65) transitions.
[2026-05-25 19:17:38] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16420995127465268469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6144650146697637542.kers'
[2026-05-25 19:17:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16420995127465268469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6144650146697637542.kers]
Normalized transition count is 78 out of 79 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 50 cols 275 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:17:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6144650146697637542.kers
Total runtime 1 ms.
[2026-05-25 19:17:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 19:17:38] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:17:38] [INFO ] Invariant cache hit.
[2026-05-25 19:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-25 19:17:38] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:17:38] [INFO ] Invariant cache hit.
[2026-05-25 19:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/128 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 62 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/128 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4508 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6658ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6659ms
Starting structural reductions in LTL mode, iteration 1 : 50/76 places, 82/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6785 ms. Remains : 50/76 places, 82/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p1))&&p0)))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-06 finished in 7077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X((p0||F(p1))))&&(p2 U (p3||G(p2))))))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 115
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 60 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 56 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 56 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 54 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 54 transition count 97
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 54 transition count 92
Applied a total of 53 rules in 2 ms. Remains 54 /76 variables (removed 22) and now considering 92/147 (removed 55) transitions.
[2026-05-25 19:17:45] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3490941388770885355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17871152946330257742.kers'
[2026-05-25 19:17:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3490941388770885355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17871152946330257742.kers]
Normalized transition count is 88 out of 89 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 54 cols 301 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:17:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17871152946330257742.kers
Total runtime 0 ms.
[2026-05-25 19:17:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:17:45] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2026-05-25 19:17:45] [INFO ] Invariant cache hit.
[2026-05-25 19:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 19:17:45] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2026-05-25 19:17:45] [INFO ] Invariant cache hit.
[2026-05-25 19:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 66 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 88/142 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 91/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 162 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9935ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 9935ms
Starting structural reductions in LTL mode, iteration 1 : 54/76 places, 92/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10025 ms. Remains : 54/76 places, 92/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X((p0||F(p1))))&&(p2 U (p3||G(p2))))))))'
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-07
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-07 finished in 10402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Graph (trivial) has 92 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 53 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 48 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 48 transition count 93
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 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 45 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 45 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 45 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 44 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 44 transition count 72
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 4 with 4 rules applied. Total rules applied 71 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 40 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 40 transition count 79
Applied a total of 78 rules in 17 ms. Remains 40 /76 variables (removed 36) and now considering 79/147 (removed 68) transitions.
[2026-05-25 19:17:56] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17204322637988725297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2210279600231925933.kers'
[2026-05-25 19:17:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17204322637988725297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2210279600231925933.kers]
Normalized transition count is 69 out of 70 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 40 cols 262 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-25 19:17:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2210279600231925933.kers
Total runtime 0 ms.
[2026-05-25 19:17:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 19:17:56] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2026-05-25 19:17:56] [INFO ] Invariant cache hit.
[2026-05-25 19:17:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 19:17:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-25 19:17:56] [INFO ] Redundant transitions in 18 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-25 19:17:56] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2026-05-25 19:17:56] [INFO ] Invariant cache hit.
[2026-05-25 19:17:56] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 65 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 63/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 129 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3325ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3325ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/76 places, 79/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3464 ms. Remains : 40/76 places, 79/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-08 finished in 3559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Graph (trivial) has 90 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 54 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 54 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 54 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 51 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 51 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 51 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 49 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 49 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 48 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 48 transition count 84
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 4 with 4 rules applied. Total rules applied 60 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 46 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 65 place count 44 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 68 place count 44 transition count 95
Applied a total of 68 rules in 16 ms. Remains 44 /76 variables (removed 32) and now considering 95/147 (removed 52) transitions.
[2026-05-25 19:17:59] [INFO ] Flow matrix only has 85 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-18219070893649083316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7270547462569405960.kers'
[2026-05-25 19:17:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18219070893649083316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7270547462569405960.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 44 cols 316 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:17:59] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7270547462569405960.kers
Total runtime 0 ms.
[2026-05-25 19:17:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:17:59] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2026-05-25 19:17:59] [INFO ] Invariant cache hit.
[2026-05-25 19:17:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 19:17:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-25 19:17:59] [INFO ] Redundant transitions in 17 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-25 19:17:59] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2026-05-25 19:17:59] [INFO ] Invariant cache hit.
[2026-05-25 19:17:59] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 84/128 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/129 variables, and 72 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 84/128 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 79/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/129 variables, and 152 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3272 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5145ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/76 places, 95/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5287 ms. Remains : 44/76 places, 95/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-09 finished in 5451 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' '!(((!p0 U X(p1))||F(G(p1))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 58 transition count 111
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 58 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 58 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 54 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 54 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 52 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 51 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 51 transition count 84
Applied a total of 61 rules in 5 ms. Remains 51 /76 variables (removed 25) and now considering 84/147 (removed 63) transitions.
[2026-05-25 19:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17619184444509718251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12066292103243493617.kers'
[2026-05-25 19:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17619184444509718251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12066292103243493617.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 51 cols 281 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:18:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12066292103243493617.kers
Total runtime 1 ms.
[2026-05-25 19:18:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2026-05-25 19:18:05] [INFO ] Invariant cache hit.
[2026-05-25 19:18:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:18:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-25 19:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2026-05-25 19:18:05] [INFO ] Invariant cache hit.
[2026-05-25 19:18:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/131 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 63 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 80/131 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 83/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 148 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4438 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6636ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6636ms
Starting structural reductions in LTL mode, iteration 1 : 51/76 places, 84/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6726 ms. Remains : 51/76 places, 84/147 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 U X(p1))||F(G(p1))))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-10 finished in 6917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 59 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 59 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 59 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 55 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 53 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 53 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 53 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 52 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 52 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 52 transition count 86
Applied a total of 59 rules in 5 ms. Remains 52 /76 variables (removed 24) and now considering 86/147 (removed 61) transitions.
[2026-05-25 19:18:12] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3903552086065419447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2556907212036316248.kers'
[2026-05-25 19:18:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3903552086065419447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2556907212036316248.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 52 cols 283 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:18:12] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2556907212036316248.kers
Total runtime 0 ms.
[2026-05-25 19:18:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:18:12] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:18:12] [INFO ] Invariant cache hit.
[2026-05-25 19:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:18:12] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 19:18:12] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:18:12] [INFO ] Invariant cache hit.
[2026-05-25 19:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 65 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2800 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/134 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 152 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6247 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9058ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 9058ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 86/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9151 ms. Remains : 52/76 places, 86/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0)) U (X(X(G(p0)))||(p1&&X(X(p0))))))))'
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 16670 reset in 119 ms.
Product exploration explored 100000 steps with 16700 reset in 163 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2547 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (323 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (332 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (330 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (323 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 222902 steps, run visited all 4 properties in 613 ms. (steps per millisecond=363 )
Probabilistic random walk after 222902 steps, saw 31951 distinct states, run finished after 613 ms. (steps per millisecond=363 ) properties seen :4
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 1136 ms.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-25 19:18:23] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:18:23] [INFO ] Invariant cache hit.
[2026-05-25 19:18:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:18:23] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2026-05-25 19:18:23] [INFO ] Invariant cache hit.
[2026-05-25 19:18:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:18:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 52/52 places, 86/86 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2550 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (328 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (332 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (323 resets) in 21 ms. (1818 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (341 resets) in 22 ms. (1739 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 222902 steps, run visited all 4 properties in 610 ms. (steps per millisecond=365 )
Probabilistic random walk after 222902 steps, saw 31951 distinct states, run finished after 610 ms. (steps per millisecond=365 ) properties seen :4
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 1051 ms.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16669 reset in 112 ms.
Product exploration explored 100000 steps with 16634 reset in 120 ms.
Spot run failed in 41 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/ltsmin2214650637346832103
[2026-05-25 19:18:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2214650637346832103
Running compilation step : cd /tmp/ltsmin2214650637346832103;'/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 167 ms.
Running link step : cd /tmp/ltsmin2214650637346832103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2214650637346832103;'/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/stateBased17675156661192997418.hoa' '--buchi-type=spotba'
LTSmin run took 792 ms.
FORMULA HealthRecord-PT-10-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-11 finished in 13932 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 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Graph (trivial) has 92 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 53 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 48 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 48 transition count 93
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 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 45 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 45 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 45 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 44 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 44 transition count 73
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 4 with 4 rules applied. Total rules applied 70 place count 42 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 42 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 40 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 40 transition count 81
Applied a total of 78 rules in 13 ms. Remains 40 /76 variables (removed 36) and now considering 81/147 (removed 66) transitions.
[2026-05-25 19:18:26] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3393811094350543617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7738558192557115611.kers'
[2026-05-25 19:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3393811094350543617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7738558192557115611.kers]
Normalized transition count is 71 out of 72 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 40 cols 272 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-25 19:18:26] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7738558192557115611.kers
Total runtime 0 ms.
[2026-05-25 19:18:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:18:26] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2026-05-25 19:18:26] [INFO ] Invariant cache hit.
[2026-05-25 19:18:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:18:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2026-05-25 19:18:26] [INFO ] Redundant transitions in 18 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-25 19:18:26] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2026-05-25 19:18:26] [INFO ] Invariant cache hit.
[2026-05-25 19:18:26] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 64 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 65/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 129 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3471ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3473ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/76 places, 81/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3588 ms. Remains : 40/76 places, 81/147 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 44 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-14 finished in 3669 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(p1))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 147/147 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 57 transition count 109
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 57 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 57 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 53 transition count 97
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 53 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 52 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 52 transition count 89
Applied a total of 56 rules in 4 ms. Remains 52 /76 variables (removed 24) and now considering 89/147 (removed 58) transitions.
[2026-05-25 19:18:29] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-576052576288602318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15853472100274347057.kers'
[2026-05-25 19:18:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-576052576288602318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15853472100274347057.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 52 cols 299 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:18:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15853472100274347057.kers
Total runtime 1 ms.
[2026-05-25 19:18:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:18:29] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2026-05-25 19:18:29] [INFO ] Invariant cache hit.
[2026-05-25 19:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:18:29] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-25 19:18:29] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2026-05-25 19:18:29] [INFO ] Invariant cache hit.
[2026-05-25 19:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/137 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 64 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/137 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 88/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 155 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5528 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7911ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 7911ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 89/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8002 ms. Remains : 52/76 places, 89/147 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(p1))))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-15 finished in 8305 ms.
All properties solved by simple procedures.
Total runtime 162943 ms.

BK_STOP 1779736718169

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-10"
export BK_EXAMINATION="LTLFireability"
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-10, examination is LTLFireability"
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-177961074300612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;