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-177961074300668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is HealthRecord-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.1K Mar 7 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HealthRecord-PT-17-LTLFireability-00
FORMULA_NAME HealthRecord-PT-17-LTLFireability-01
FORMULA_NAME HealthRecord-PT-17-LTLFireability-02
FORMULA_NAME HealthRecord-PT-17-LTLFireability-03
FORMULA_NAME HealthRecord-PT-17-LTLFireability-04
FORMULA_NAME HealthRecord-PT-17-LTLFireability-05
FORMULA_NAME HealthRecord-PT-17-LTLFireability-06
FORMULA_NAME HealthRecord-PT-17-LTLFireability-07
FORMULA_NAME HealthRecord-PT-17-LTLFireability-08
FORMULA_NAME HealthRecord-PT-17-LTLFireability-09
FORMULA_NAME HealthRecord-PT-17-LTLFireability-10
FORMULA_NAME HealthRecord-PT-17-LTLFireability-11
FORMULA_NAME HealthRecord-PT-17-LTLFireability-12
FORMULA_NAME HealthRecord-PT-17-LTLFireability-13
FORMULA_NAME HealthRecord-PT-17-LTLFireability-14
FORMULA_NAME HealthRecord-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779738152925

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 19:42:34] [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:42:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:42:34] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 19:42:34] [INFO ] Transformed 624 places.
[2026-05-25 19:42:34] [INFO ] Transformed 828 transitions.
[2026-05-25 19:42:34] [INFO ] Found NUPN structural information;
[2026-05-25 19:42:34] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 127 place count 497 transition count 675
Iterating global reduction 0 with 127 rules applied. Total rules applied 254 place count 497 transition count 675
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 304 place count 447 transition count 612
Iterating global reduction 0 with 50 rules applied. Total rules applied 354 place count 447 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 359 place count 447 transition count 607
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 381 place count 425 transition count 568
Iterating global reduction 1 with 22 rules applied. Total rules applied 403 place count 425 transition count 568
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 413 place count 415 transition count 552
Iterating global reduction 1 with 10 rules applied. Total rules applied 423 place count 415 transition count 552
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 429 place count 409 transition count 546
Iterating global reduction 1 with 6 rules applied. Total rules applied 435 place count 409 transition count 546
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 441 place count 403 transition count 534
Iterating global reduction 1 with 6 rules applied. Total rules applied 447 place count 403 transition count 534
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 453 place count 397 transition count 528
Iterating global reduction 1 with 6 rules applied. Total rules applied 459 place count 397 transition count 528
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 465 place count 391 transition count 522
Iterating global reduction 1 with 6 rules applied. Total rules applied 471 place count 391 transition count 522
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 474 place count 391 transition count 519
Applied a total of 474 rules in 176 ms. Remains 391 /624 variables (removed 233) and now considering 519/828 (removed 309) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13213966364975954947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15960497800584423703.kers'
[2026-05-25 19:42:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13213966364975954947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15960497800584423703.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 519 rows 391 cols 1237 entries
Finished phase 1 with 371 SingleSign rule and 2 generalized
[2026-05-25 19:42:34] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15960497800584423703.kers
Total runtime 2 ms.
[2026-05-25 19:42:34] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-25 19:42:34] [INFO ] Invariant cache hit.
[2026-05-25 19:42:35] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2026-05-25 19:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/391 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/910 variables, and 78 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/391 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 519/910 variables, 391/489 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 518/1007 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 910/910 variables, and 1013 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 391/624 places, 519/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 391/624 places, 519/828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Applied a total of 0 rules in 5 ms. Remains 391 /391 variables (removed 0) and now considering 519/519 (removed 0) transitions.
[2026-05-25 19:43:35] [INFO ] Invariant cache hit.
[2026-05-25 19:43:35] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 19:43:35] [INFO ] Invariant cache hit.
[2026-05-25 19:43:35] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 391/391 places, 519/519 transitions.
Support contains 36 out of 391 places after structural reductions.
[2026-05-25 19:43:36] [INFO ] Flatten gal took : 51 ms
[2026-05-25 19:43:36] [INFO ] Flatten gal took : 22 ms
[2026-05-25 19:43:36] [INFO ] Input system was already deterministic with 519 transitions.
Support contains 35 out of 391 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (344 resets) in 1981 ms. (20 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
[2026-05-25 19:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 199/216 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 111/327 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 64/391 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 5090ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 416 edges and 391 vertex of which 56 / 391 are part of one of the 19 SCC in 7 ms
Free SCC test removed 37 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (complete) has 796 edges and 354 vertex of which 345 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 345 transition count 311
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 161 rules applied. Total rules applied 309 place count 199 transition count 296
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 318 place count 191 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 190 transition count 295
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 319 place count 190 transition count 290
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 329 place count 185 transition count 290
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 337 place count 177 transition count 274
Iterating global reduction 4 with 8 rules applied. Total rules applied 345 place count 177 transition count 274
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 349 place count 177 transition count 270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 353 place count 173 transition count 270
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 358 place count 168 transition count 260
Iterating global reduction 6 with 5 rules applied. Total rules applied 363 place count 168 transition count 260
Performed 57 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 477 place count 111 transition count 201
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 490 place count 111 transition count 188
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 497 place count 104 transition count 174
Iterating global reduction 7 with 7 rules applied. Total rules applied 504 place count 104 transition count 174
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 512 place count 100 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 527 place count 100 transition count 197
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 555 place count 100 transition count 169
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 583 place count 72 transition count 169
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 588 place count 72 transition count 169
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 589 place count 72 transition count 169
Applied a total of 589 rules in 88 ms. Remains 72 /391 variables (removed 319) and now considering 169/519 (removed 350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 72/391 places, 169/519 transitions.
RANDOM walk for 40000 steps (6054 resets) in 694 ms. (57 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40003 steps (1069 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1046 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1032 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1019 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1012 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1020 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1033 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1044 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1014 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
[2026-05-25 19:43:42] [INFO ] Flow matrix only has 158 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5714561374567797185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4788881506183894538.kers'
[2026-05-25 19:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5714561374567797185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4788881506183894538.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 158 rows 70 cols 676 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-25 19:43:42] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4788881506183894538.kers
Total runtime 1 ms.
[2026-05-25 19:43:42] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/72 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 158/230 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 111 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/72 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 158/230 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 122 constraints, problems are : Problem set: 0 solved, 10 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1651ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 8 properties in 306 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 72 transition count 163
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 66 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 66 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 65 transition count 162
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 22 place count 57 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 57 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 56 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 56 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 55 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 55 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 55 transition count 136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 51 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 51 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 50 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 50 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 49 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 49 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 55 place count 49 transition count 121
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 61 place count 46 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 67 place count 46 transition count 124
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 46 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 45 transition count 123
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 45 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 72 place count 44 transition count 119
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 44 transition count 119
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 74 place count 43 transition count 117
Iterating global reduction 6 with 1 rules applied. Total rules applied 75 place count 43 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 79 place count 43 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 81 place count 42 transition count 126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 82 place count 41 transition count 123
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 41 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 40 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 40 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 86 place count 39 transition count 117
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 39 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 91 place count 39 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 103 place count 39 transition count 101
Applied a total of 103 rules in 38 ms. Remains 39 /72 variables (removed 33) and now considering 101/169 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 39/72 places, 101/169 transitions.
RANDOM walk for 24757 steps (3551 resets) in 617 ms. (40 steps per ms) remains 0/2 properties
Computed a total of 115 stabilizing places and 125 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' '!(G((F(p0)||X(F(((p1&&X(F(p2)))||G(F(p2))))))))'
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 447 edges and 391 vertex of which 60 / 391 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 351 transition count 324
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 164 rules applied. Total rules applied 314 place count 202 transition count 309
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 324 place count 194 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 326 place count 192 transition count 307
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 326 place count 192 transition count 301
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 338 place count 186 transition count 301
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 366 place count 158 transition count 249
Iterating global reduction 4 with 28 rules applied. Total rules applied 394 place count 158 transition count 249
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 399 place count 158 transition count 244
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 404 place count 153 transition count 244
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 412 place count 145 transition count 229
Iterating global reduction 6 with 8 rules applied. Total rules applied 420 place count 145 transition count 229
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 423 place count 142 transition count 226
Iterating global reduction 6 with 3 rules applied. Total rules applied 426 place count 142 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 429 place count 142 transition count 223
Performed 51 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 531 place count 91 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 537 place count 91 transition count 162
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 544 place count 84 transition count 148
Iterating global reduction 8 with 7 rules applied. Total rules applied 551 place count 84 transition count 148
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 553 place count 82 transition count 145
Iterating global reduction 8 with 2 rules applied. Total rules applied 555 place count 82 transition count 145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 81 transition count 144
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 81 transition count 144
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 558 place count 80 transition count 140
Iterating global reduction 8 with 1 rules applied. Total rules applied 559 place count 80 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 562 place count 80 transition count 137
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 572 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 573 place count 74 transition count 188
Iterating global reduction 9 with 1 rules applied. Total rules applied 574 place count 74 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 593 place count 74 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 595 place count 73 transition count 178
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 596 place count 72 transition count 175
Iterating global reduction 9 with 1 rules applied. Total rules applied 597 place count 72 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 605 place count 72 transition count 167
Applied a total of 605 rules in 57 ms. Remains 72 /391 variables (removed 319) and now considering 167/519 (removed 352) transitions.
[2026-05-25 19:43:45] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12402051266201331858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12455358510400928469.kers'
[2026-05-25 19:43:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12402051266201331858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12455358510400928469.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 72 cols 628 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-25 19:43:45] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12455358510400928469.kers
Total runtime 1 ms.
[2026-05-25 19:43:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 19:43:45] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
[2026-05-25 19:43:45] [INFO ] Invariant cache hit.
[2026-05-25 19:43:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 19:43:45] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-25 19:43:45] [INFO ] Redundant transitions in 19 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-25 19:43:45] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
[2026-05-25 19:43:45] [INFO ] Invariant cache hit.
[2026-05-25 19:43:45] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 152/224 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 100 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8105 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 152/224 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 159/260 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 1/225 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 261 constraints, problems are : Problem set: 0 solved, 159 unsolved in 21989 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30150ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/391 places, 167/519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30369 ms. Remains : 72/391 places, 167/519 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)||X(F(((p1&&X(F(p2)))||G(F(p2))))))))'
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-00
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 2 ms.
FORMULA HealthRecord-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-00 finished in 30709 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 G((p1 U p2)))&&G(F(p3))))'
Support contains 4 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 446 edges and 391 vertex of which 60 / 391 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 351 transition count 328
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 158 rules applied. Total rules applied 304 place count 206 transition count 315
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 311 place count 199 transition count 315
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 311 place count 199 transition count 309
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 323 place count 193 transition count 309
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 350 place count 166 transition count 259
Iterating global reduction 3 with 27 rules applied. Total rules applied 377 place count 166 transition count 259
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 382 place count 166 transition count 254
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 387 place count 161 transition count 254
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 395 place count 153 transition count 239
Iterating global reduction 5 with 8 rules applied. Total rules applied 403 place count 153 transition count 239
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 406 place count 150 transition count 236
Iterating global reduction 5 with 3 rules applied. Total rules applied 409 place count 150 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 412 place count 150 transition count 233
Performed 55 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 522 place count 95 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 527 place count 95 transition count 169
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 533 place count 89 transition count 157
Iterating global reduction 7 with 6 rules applied. Total rules applied 539 place count 89 transition count 157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 540 place count 88 transition count 155
Iterating global reduction 7 with 1 rules applied. Total rules applied 541 place count 88 transition count 155
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 542 place count 87 transition count 154
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 87 transition count 154
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 544 place count 86 transition count 150
Iterating global reduction 7 with 1 rules applied. Total rules applied 545 place count 86 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 548 place count 86 transition count 147
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 560 place count 80 transition count 182
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 561 place count 79 transition count 180
Iterating global reduction 8 with 1 rules applied. Total rules applied 562 place count 79 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 567 place count 79 transition count 175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 568 place count 78 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 78 transition count 172
Applied a total of 569 rules in 44 ms. Remains 78 /391 variables (removed 313) and now considering 172/519 (removed 347) transitions.
[2026-05-25 19:44:16] [INFO ] Flow matrix only has 162 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-6842313232454909885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12123972973676537449.kers'
[2026-05-25 19:44:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6842313232454909885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12123972973676537449.kers]
Normalized transition count is 161 out of 162 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 78 cols 768 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-25 19:44:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12123972973676537449.kers
Total runtime 7 ms.
[2026-05-25 19:44:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 19:44:16] [INFO ] Flow matrix only has 162 transitions (discarded 10 similar events)
[2026-05-25 19:44:16] [INFO ] Invariant cache hit.
[2026-05-25 19:44:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:44:16] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2026-05-25 19:44:16] [INFO ] Redundant transitions in 17 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 19:44:16] [INFO ] Flow matrix only has 162 transitions (discarded 10 similar events)
[2026-05-25 19:44:16] [INFO ] Invariant cache hit.
[2026-05-25 19:44:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 161/239 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/240 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 103 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8560 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 161/239 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 171/275 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 1/240 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 279 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38635ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 38635ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/391 places, 172/519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38868 ms. Remains : 78/391 places, 172/519 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 G((p1 U p2)))&&G(F(p3))))'
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p3), (NOT p3), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-01 finished in 39210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(p0&&F(p1)))) U X(X(p2)))))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 380 transition count 504
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 380 transition count 504
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 372 transition count 491
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 372 transition count 491
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 372 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 368 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 368 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 367 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 367 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 366 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 366 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 365 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 365 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 364 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 364 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 364 transition count 471
Applied a total of 59 rules in 40 ms. Remains 364 /391 variables (removed 27) and now considering 471/519 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4119799955269161365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8520028912302207743.kers'
[2026-05-25 19:44:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4119799955269161365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8520028912302207743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 364 cols 1121 entries
Finished phase 1 with 344 SingleSign rule and 2 generalized
[2026-05-25 19:44:55] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8520028912302207743.kers
Total runtime 2 ms.
[2026-05-25 19:44:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 19:44:55] [INFO ] Invariant cache hit.
[2026-05-25 19:44:55] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-25 19:44:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/364 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/835 variables, and 67 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/364 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (OVERLAPS) 471/835 variables, 364/437 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 470/907 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/835 variables, and 909 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 364/391 places, 471/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 364/391 places, 471/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(p0&&F(p1)))) U X(X(p2)))))'
Stuttering acceptance computed with spot in 400 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 1093 reset in 268 ms.
Product exploration explored 100000 steps with 1088 reset in 169 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Detected a total of 111/364 stabilizing places and 119/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 99 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (347 resets) in 218 ms. (182 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (58 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
[2026-05-25 19:45:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/306 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/364 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/835 variables, 364/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/835 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 386 constraints, problems are : Problem set: 0 solved, 3 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/306 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/364 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/835 variables, 364/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/835 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 389 constraints, problems are : Problem set: 0 solved, 3 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1371ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 471/471 transitions.
Graph (trivial) has 404 edges and 364 vertex of which 52 / 364 are part of one of the 20 SCC in 1 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 717 edges and 332 vertex of which 296 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 296 transition count 197
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 361 place count 152 transition count 184
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 370 place count 145 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 143 transition count 182
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 372 place count 143 transition count 161
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 414 place count 122 transition count 161
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 436 place count 100 transition count 139
Iterating global reduction 4 with 22 rules applied. Total rules applied 458 place count 100 transition count 139
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 458 place count 100 transition count 132
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 472 place count 93 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 475 place count 90 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 478 place count 90 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 480 place count 90 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 481 place count 89 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 126
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 487 place count 84 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 492 place count 84 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 497 place count 84 transition count 116
Performed 33 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 563 place count 51 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 566 place count 51 transition count 73
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 568 place count 49 transition count 71
Iterating global reduction 7 with 2 rules applied. Total rules applied 570 place count 49 transition count 71
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 571 place count 48 transition count 69
Iterating global reduction 7 with 1 rules applied. Total rules applied 572 place count 48 transition count 69
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 7 with 6 rules applied. Total rules applied 578 place count 45 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 580 place count 45 transition count 64
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 581 place count 44 transition count 63
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 44 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 588 place count 41 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 589 place count 41 transition count 76
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 590 place count 40 transition count 75
Iterating global reduction 8 with 1 rules applied. Total rules applied 591 place count 40 transition count 75
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 594 place count 37 transition count 72
Iterating global reduction 8 with 3 rules applied. Total rules applied 597 place count 37 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 600 place count 37 transition count 69
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 610 place count 37 transition count 57
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 621 place count 27 transition count 56
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 622 place count 26 transition count 54
Iterating global reduction 9 with 1 rules applied. Total rules applied 623 place count 26 transition count 54
Applied a total of 623 rules in 35 ms. Remains 26 /364 variables (removed 338) and now considering 54/471 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 26/364 places, 54/471 transitions.
RANDOM walk for 30587 steps (4555 resets) in 331 ms. (92 steps per ms) remains 0/3 properties
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
[2026-05-25 19:45:59] [INFO ] Invariant cache hit.
[2026-05-25 19:45:59] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:45:59] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:45:59] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2026-05-25 19:45:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:45:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:45:59] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:45:59] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2026-05-25 19:46:00] [INFO ] Computed and/alt/rep : 465/787/465 causal constraints (skipped 5 transitions) in 26 ms.
[2026-05-25 19:46:02] [INFO ] Added : 377 causal constraints over 76 iterations in 2991 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 6293 ms.
Stuttering acceptance computed with spot in 441 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 471/471 transitions.
Applied a total of 0 rules in 10 ms. Remains 364 /364 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-05-25 19:46:03] [INFO ] Invariant cache hit.
[2026-05-25 19:46:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 19:46:03] [INFO ] Invariant cache hit.
[2026-05-25 19:46:03] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 364/364 places, 471/471 transitions.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Detected a total of 111/364 stabilizing places and 119/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 86 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (348 resets) in 96 ms. (412 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
[2026-05-25 19:46:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/306 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/364 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/835 variables, 364/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/835 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 386 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/306 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/364 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/835 variables, 364/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/835 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 389 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1518ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 471/471 transitions.
Graph (trivial) has 404 edges and 364 vertex of which 52 / 364 are part of one of the 20 SCC in 0 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 717 edges and 332 vertex of which 296 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 296 transition count 197
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 361 place count 152 transition count 184
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 370 place count 145 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 143 transition count 182
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 372 place count 143 transition count 161
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 414 place count 122 transition count 161
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 436 place count 100 transition count 139
Iterating global reduction 4 with 22 rules applied. Total rules applied 458 place count 100 transition count 139
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 458 place count 100 transition count 132
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 472 place count 93 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 475 place count 90 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 478 place count 90 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 480 place count 90 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 481 place count 89 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 126
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 487 place count 84 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 492 place count 84 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 497 place count 84 transition count 116
Performed 33 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 563 place count 51 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 566 place count 51 transition count 73
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 568 place count 49 transition count 71
Iterating global reduction 7 with 2 rules applied. Total rules applied 570 place count 49 transition count 71
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 571 place count 48 transition count 69
Iterating global reduction 7 with 1 rules applied. Total rules applied 572 place count 48 transition count 69
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 7 with 6 rules applied. Total rules applied 578 place count 45 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 580 place count 45 transition count 64
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 581 place count 44 transition count 63
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 44 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 588 place count 41 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 589 place count 41 transition count 76
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 590 place count 40 transition count 75
Iterating global reduction 8 with 1 rules applied. Total rules applied 591 place count 40 transition count 75
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 594 place count 37 transition count 72
Iterating global reduction 8 with 3 rules applied. Total rules applied 597 place count 37 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 600 place count 37 transition count 69
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 610 place count 37 transition count 57
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 621 place count 27 transition count 56
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 622 place count 26 transition count 54
Iterating global reduction 9 with 1 rules applied. Total rules applied 623 place count 26 transition count 54
Applied a total of 623 rules in 23 ms. Remains 26 /364 variables (removed 338) and now considering 54/471 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 26/364 places, 54/471 transitions.
RANDOM walk for 21334 steps (3099 resets) in 104 ms. (203 steps per ms) remains 0/3 properties
Knowledge based reduction with 11 factoid took 261 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 456 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
[2026-05-25 19:46:06] [INFO ] Invariant cache hit.
[2026-05-25 19:46:06] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:46:06] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:46:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2026-05-25 19:46:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:46:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:46:06] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:46:07] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2026-05-25 19:46:07] [INFO ] Computed and/alt/rep : 465/787/465 causal constraints (skipped 5 transitions) in 20 ms.
[2026-05-25 19:46:09] [INFO ] Added : 377 causal constraints over 76 iterations in 2881 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 6183 ms.
Stuttering acceptance computed with spot in 428 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1104 reset in 122 ms.
Product exploration explored 100000 steps with 1094 reset in 243 ms.
Spot run failed in 76 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/ltsmin14759562558331829056
[2026-05-25 19:46:11] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14759562558331829056
Running compilation step : cd /tmp/ltsmin14759562558331829056;'/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 732 ms.
Running link step : cd /tmp/ltsmin14759562558331829056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14759562558331829056;'/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/stateBased9621337570133286642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 471/471 transitions.
Applied a total of 0 rules in 4 ms. Remains 364 /364 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-05-25 19:46:26] [INFO ] Invariant cache hit.
[2026-05-25 19:46:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 19:46:26] [INFO ] Invariant cache hit.
[2026-05-25 19:46:26] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 364/364 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin14172829309109412057
[2026-05-25 19:46:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14172829309109412057
Running compilation step : cd /tmp/ltsmin14172829309109412057;'/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 628 ms.
Running link step : cd /tmp/ltsmin14172829309109412057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14172829309109412057;'/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/stateBased11114417087714697118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 19:46:41] [INFO ] Flatten gal took : 19 ms
[2026-05-25 19:46:41] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:46:41] [INFO ] Time to serialize gal into /tmp/LTL382626257999862296.gal : 5 ms
[2026-05-25 19:46:41] [INFO ] Time to serialize properties into /tmp/LTL18221153529400658922.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL382626257999862296.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9656761292633413282.hoa' '-atoms' '/tmp/LTL18221153529400658922.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F((G("(i1.i0.u10.p64!=1)"))||(("(i1.i0.u10.p64!=1)")&&(F("(i22.i0.u135.p591==1)")))))U(X(X("(i4.i0.u26.p170==1)"))))))
Formula 0 simplified : F(G(F!"(i1.i0.u10.p64!=1)" & (!"(i1.i0.u10.p64!=1)" | G!"(i22.i0.u135.p591==1)")) R XX!"(i4.i0.u26.p170==1)")
Reverse transition relation is NOT exact ! Due to transitions t107, t460, t465, i1.t406, i1.i2.t430, i1.i2.u6.t388, i1.i2.u6.t393, i1.i2.u6.t394, i1.i2.u6....1917
Computing Next relation with stutter on 4.21785e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property HealthRecord-PT-17-LTLFireability-02 finished in 152109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((p0&&G(p1)) U X((X(p2) U ((p2&&X(p2))||X(G(p2))))))))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 379 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 379 transition count 502
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 371 transition count 491
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 371 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 371 transition count 489
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 366 transition count 480
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 366 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 364 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 364 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 362 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 362 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 361 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 361 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 360 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 360 transition count 466
Applied a total of 67 rules in 36 ms. Remains 360 /391 variables (removed 31) and now considering 466/519 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9495524541900758164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11199668040862739660.kers'
[2026-05-25 19:47:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9495524541900758164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11199668040862739660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 466 rows 360 cols 1109 entries
Finished phase 1 with 340 SingleSign rule and 2 generalized
[2026-05-25 19:47:27] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11199668040862739660.kers
Total runtime 4 ms.
[2026-05-25 19:47:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 19:47:27] [INFO ] Invariant cache hit.
[2026-05-25 19:47:27] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-25 19:47:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 62 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 7 (OVERLAPS) 466/826 variables, 360/425 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 465/890 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 893 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 360/391 places, 466/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 360/391 places, 466/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((p0&&G(p1)) U X((X(p2) U (X(G(p2))||(p2&&X(p2))))))))'
Stuttering acceptance computed with spot in 974 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 33 factoid took 20 ms. Proved property starting from automaton with 23 states, 79 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA HealthRecord-PT-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-03 finished in 61779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 378 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 378 transition count 501
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 369 transition count 487
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 369 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 369 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 364 transition count 476
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 364 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 362 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 362 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 360 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 360 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 358 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 358 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 357 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 357 transition count 464
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 357 transition count 461
Applied a total of 73 rules in 40 ms. Remains 357 /391 variables (removed 34) and now considering 461/519 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18342041414366311083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17182647181003330359.kers'
[2026-05-25 19:48:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18342041414366311083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17182647181003330359.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 461 rows 357 cols 1093 entries
Finished phase 1 with 337 SingleSign rule and 2 generalized
[2026-05-25 19:48:29] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17182647181003330359.kers
Total runtime 7 ms.
[2026-05-25 19:48:29] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 19:48:29] [INFO ] Invariant cache hit.
[2026-05-25 19:48:29] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 19:48:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/357 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 52 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/357 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/431 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/891 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 895 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 357/391 places, 461/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 357/391 places, 461/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-05 finished in 60584 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(G(p0))))'
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 379 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 379 transition count 502
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 371 transition count 490
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 371 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 371 transition count 488
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 367 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 367 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 366 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 366 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 365 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 365 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 364 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 364 transition count 476
Applied a total of 56 rules in 37 ms. Remains 364 /391 variables (removed 27) and now considering 476/519 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1779301071683624576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-848341186766298729.kers'
[2026-05-25 19:49:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1779301071683624576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-848341186766298729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 476 rows 364 cols 1139 entries
Finished phase 1 with 344 SingleSign rule and 2 generalized
[2026-05-25 19:49:29] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-848341186766298729.kers
Total runtime 3 ms.
[2026-05-25 19:49:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 19:49:29] [INFO ] Invariant cache hit.
[2026-05-25 19:49:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2026-05-25 19:49:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/364 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/840 variables, and 78 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/364 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 8 (OVERLAPS) 476/840 variables, 364/447 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 475/922 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 926 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 364/391 places, 476/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 364/391 places, 476/519 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(G(p0))))'
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-06 finished in 60574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))||(p2 U (p3||G(p2)))))))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 380 transition count 503
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 380 transition count 503
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 372 transition count 491
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 372 transition count 491
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 372 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 368 transition count 482
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 368 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 367 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 367 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 366 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 366 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 365 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 365 transition count 477
Applied a total of 54 rules in 32 ms. Remains 365 /391 variables (removed 26) and now considering 477/519 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5512904371693645111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12047885177715724977.kers'
[2026-05-25 19:50:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5512904371693645111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12047885177715724977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 477 rows 365 cols 1141 entries
Finished phase 1 with 345 SingleSign rule and 2 generalized
[2026-05-25 19:50:30] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12047885177715724977.kers
Total runtime 2 ms.
[2026-05-25 19:50:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 19:50:30] [INFO ] Invariant cache hit.
[2026-05-25 19:50:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2026-05-25 19:50:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/365 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/842 variables, and 64 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/365 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 8 (OVERLAPS) 477/842 variables, 365/450 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 476/926 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 842/842 variables, and 928 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 365/391 places, 477/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60385 ms. Remains : 365/391 places, 477/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))||(p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1), true, (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-07
Product exploration explored 100000 steps with 878 reset in 139 ms.
Product exploration explored 100000 steps with 878 reset in 165 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge based reduction with 13 factoid took 79 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (350 resets) in 403 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (57 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (57 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (58 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 222 ms. (179 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 545815 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 9
Probabilistic random walk after 545815 steps, saw 113921 distinct states, run finished after 3006 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-25 19:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 256/302 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 63/365 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf7 is UNSAT
At refinement iteration 7 (OVERLAPS) 477/842 variables, 365/383 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 4/387 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/842 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 387 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1418 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 256/302 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 63/365 variables, 9/18 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem apf8 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 477/842 variables, 365/389 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 7/396 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/396 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/842 variables, 0/396 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 396 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2618ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1024 ms.
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 477/477 transitions.
Graph (trivial) has 409 edges and 365 vertex of which 56 / 365 are part of one of the 19 SCC in 1 ms
Free SCC test removed 37 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (complete) has 728 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 319 transition count 271
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 303 place count 175 transition count 258
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 310 place count 168 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 310 place count 168 transition count 253
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 163 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 329 place count 154 transition count 235
Iterating global reduction 3 with 9 rules applied. Total rules applied 338 place count 154 transition count 235
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 343 place count 154 transition count 230
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 348 place count 149 transition count 230
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 356 place count 141 transition count 217
Iterating global reduction 5 with 8 rules applied. Total rules applied 364 place count 141 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 367 place count 141 transition count 214
Performed 55 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 477 place count 86 transition count 157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 489 place count 86 transition count 145
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 498 place count 77 transition count 127
Iterating global reduction 7 with 9 rules applied. Total rules applied 507 place count 77 transition count 127
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 509 place count 75 transition count 124
Iterating global reduction 7 with 2 rules applied. Total rules applied 511 place count 75 transition count 124
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 512 place count 74 transition count 120
Iterating global reduction 7 with 1 rules applied. Total rules applied 513 place count 74 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 521 place count 70 transition count 163
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 522 place count 69 transition count 161
Iterating global reduction 7 with 1 rules applied. Total rules applied 523 place count 69 transition count 161
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 524 place count 68 transition count 157
Iterating global reduction 7 with 1 rules applied. Total rules applied 525 place count 68 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 529 place count 68 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 546 place count 68 transition count 136
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 547 place count 67 transition count 133
Iterating global reduction 8 with 1 rules applied. Total rules applied 548 place count 67 transition count 133
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 551 place count 64 transition count 129
Iterating global reduction 8 with 3 rules applied. Total rules applied 554 place count 64 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 557 place count 64 transition count 126
Free-agglomeration rule applied 26 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 583 place count 64 transition count 96
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 609 place count 38 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 617 place count 38 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 38 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 619 place count 37 transition count 87
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 624 place count 37 transition count 87
Applied a total of 624 rules in 34 ms. Remains 37 /365 variables (removed 328) and now considering 87/477 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 37/365 places, 87/477 transitions.
RANDOM walk for 40000 steps (113 resets) in 46 ms. (851 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (61 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2026-05-25 19:51:38] [INFO ] Flow matrix only has 74 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4471878834984541418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13126413534745356779.kers'
[2026-05-25 19:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4471878834984541418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13126413534745356779.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 74 rows 34 cols 366 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 19:51:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13126413534745356779.kers
Total runtime 1 ms.
[2026-05-25 19:51:38] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/111 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 19/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 66 constraints, problems are : Problem set: 0 solved, 2 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/34 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/37 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/111 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/111 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 87/87 transitions.
Graph (trivial) has 8 edges and 37 vertex of which 4 / 37 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 164 edges and 35 vertex of which 27 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 27 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 23 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 23 transition count 57
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 1 with 4 rules applied. Total rules applied 27 place count 21 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 21 transition count 53
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 21 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 21 transition count 49
Applied a total of 38 rules in 4 ms. Remains 21 /37 variables (removed 16) and now considering 49/87 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 21/37 places, 49/87 transitions.
RANDOM walk for 11857 steps (1993 resets) in 128 ms. (91 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 10 ms. Proved property starting from automaton with 8 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 7658 ms.
FORMULA HealthRecord-PT-17-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-07 finished in 68706 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)||G(p1)||G(p2))))'
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 448 edges and 391 vertex of which 60 / 391 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 351 transition count 322
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 166 rules applied. Total rules applied 318 place count 200 transition count 307
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 326 place count 192 transition count 307
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 326 place count 192 transition count 302
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 336 place count 187 transition count 302
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 362 place count 161 transition count 256
Iterating global reduction 3 with 26 rules applied. Total rules applied 388 place count 161 transition count 256
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 394 place count 161 transition count 250
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 400 place count 155 transition count 250
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 409 place count 146 transition count 233
Iterating global reduction 5 with 9 rules applied. Total rules applied 418 place count 146 transition count 233
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 421 place count 143 transition count 230
Iterating global reduction 5 with 3 rules applied. Total rules applied 424 place count 143 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 427 place count 143 transition count 227
Performed 53 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 533 place count 90 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 541 place count 90 transition count 163
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 549 place count 82 transition count 147
Iterating global reduction 7 with 8 rules applied. Total rules applied 557 place count 82 transition count 147
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 559 place count 80 transition count 144
Iterating global reduction 7 with 2 rules applied. Total rules applied 561 place count 80 transition count 144
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 562 place count 79 transition count 143
Iterating global reduction 7 with 1 rules applied. Total rules applied 563 place count 79 transition count 143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 564 place count 78 transition count 139
Iterating global reduction 7 with 1 rules applied. Total rules applied 565 place count 78 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 568 place count 78 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 574 place count 75 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 589 place count 75 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 591 place count 74 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 599 place count 74 transition count 158
Applied a total of 599 rules in 34 ms. Remains 74 /391 variables (removed 317) and now considering 158/519 (removed 361) transitions.
[2026-05-25 19:51:39] [INFO ] Flow matrix only has 148 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-12930266559263487656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2464223695960124098.kers'
[2026-05-25 19:51:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12930266559263487656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2464223695960124098.kers]
Normalized transition count is 147 out of 148 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 74 cols 614 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-25 19:51:39] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2464223695960124098.kers
Total runtime 3 ms.
[2026-05-25 19:51:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 19:51:39] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:51:39] [INFO ] Invariant cache hit.
[2026-05-25 19:51:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:51:39] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-05-25 19:51:39] [INFO ] Redundant transitions in 16 ms returned []
Running 150 sub problems to find dead transitions.
[2026-05-25 19:51:39] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:51:39] [INFO ] Invariant cache hit.
[2026-05-25 19:51:39] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 147/221 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/222 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 101 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6559 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 147/221 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 15/103 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 150/253 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 254 constraints, problems are : Problem set: 0 solved, 150 unsolved in 18407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24999ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 24999ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/391 places, 158/519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25200 ms. Remains : 74/391 places, 158/519 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)||G(p1)||G(p2))))'
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 7760 reset in 322 ms.
Product exploration explored 100000 steps with 7801 reset in 267 ms.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge based reduction with 23 factoid took 70 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (3453 resets) in 539 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (269 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (268 resets) in 25 ms. (1538 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (269 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (265 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (266 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (270 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (268 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (270 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (268 resets) in 25 ms. (1538 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (271 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (265 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 1163725 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 11
Probabilistic random walk after 1163725 steps, saw 177827 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
[2026-05-25 19:52:08] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:08] [INFO ] Invariant cache hit.
[2026-05-25 19:52:08] [INFO ] State equation strengthened by 16 read => feed constraints.
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 7/10 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 147/221 variables, 74/85 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 15/100 constraints. Problems are: Problem set: 4 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/101 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 101 constraints, problems are : Problem set: 4 solved, 7 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 7/10 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 147/221 variables, 74/85 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 15/100 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 6/106 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/107 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/107 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/222 variables, 1/108 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 108 constraints, problems are : Problem set: 5 solved, 6 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 724ms problems are : Problem set: 5 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 52 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 158/158 transitions.
Graph (complete) has 271 edges and 74 vertex of which 54 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 54 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 54 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 53 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 52 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 52 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 51 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 51 transition count 115
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 1 with 4 rules applied. Total rules applied 30 place count 49 transition count 113
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 52 place count 49 transition count 91
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 78 place count 27 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 24 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 24 transition count 78
Applied a total of 84 rules in 10 ms. Remains 24 /74 variables (removed 50) and now considering 78/158 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 24/74 places, 78/158 transitions.
RANDOM walk for 40000 steps (8567 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 34188 steps (1015 resets) in 29 ms. (1139 steps per ms) remains 0/2 properties
Found 5 invariant AP formulas.
Knowledge based reduction with 28 factoid took 102 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND p0 p2)]
Knowledge-based reduction took 4413 ms.
Stuttering acceptance computed with spot in 32 ms :[(AND p0 p2)]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2026-05-25 19:52:09] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:09] [INFO ] Invariant cache hit.
[2026-05-25 19:52:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 19:52:09] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:09] [INFO ] Invariant cache hit.
[2026-05-25 19:52:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:52:09] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-25 19:52:09] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 74/74 places, 158/158 transitions.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge based reduction with 9 factoid took 63 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3455 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (268 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (266 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (258 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (271 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1074796 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 4
Probabilistic random walk after 1074796 steps, saw 164802 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
[2026-05-25 19:52:12] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:12] [INFO ] Invariant cache hit.
[2026-05-25 19:52:12] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 147/221 variables, 74/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 15/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 104 constraints, problems are : Problem set: 1 solved, 3 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 147/221 variables, 74/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 15/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/106 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/222 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 107 constraints, problems are : Problem set: 1 solved, 3 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 1 properties in 56 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 158/158 transitions.
Graph (complete) has 271 edges and 74 vertex of which 54 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 54 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 54 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 53 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 52 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 52 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 51 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 51 transition count 115
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 1 with 4 rules applied. Total rules applied 30 place count 49 transition count 113
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 52 place count 49 transition count 91
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 78 place count 27 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 24 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 24 transition count 78
Applied a total of 84 rules in 7 ms. Remains 24 /74 variables (removed 50) and now considering 78/158 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 24/74 places, 78/158 transitions.
RANDOM walk for 40000 steps (8499 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1178 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1197 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 350 steps, run visited all 2 properties in 3 ms. (steps per millisecond=116 )
Probabilistic random walk after 350 steps, saw 155 distinct states, run finished after 6 ms. (steps per millisecond=58 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 79 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[false]
Knowledge-based reduction took 4063 ms.
Stuttering acceptance computed with spot in 41 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Product exploration explored 100000 steps with 7749 reset in 161 ms.
Product exploration explored 100000 steps with 7767 reset in 161 ms.
Built C files in :
/tmp/ltsmin15100681241991550057
[2026-05-25 19:52:14] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2026-05-25 19:52:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:14] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2026-05-25 19:52:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:14] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2026-05-25 19:52:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:14] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15100681241991550057
Running compilation step : cd /tmp/ltsmin15100681241991550057;'/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 299 ms.
Running link step : cd /tmp/ltsmin15100681241991550057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15100681241991550057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15613686519218389996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 158/158 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 72 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 72 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 72 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 71 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 71 transition count 150
Applied a total of 7 rules in 21 ms. Remains 71 /74 variables (removed 3) and now considering 150/158 (removed 8) transitions.
[2026-05-25 19:52:29] [INFO ] Flow matrix only has 140 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-8651236251236448635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13125622839358798970.kers'
[2026-05-25 19:52:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8651236251236448635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13125622839358798970.kers]
Normalized transition count is 139 out of 140 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 71 cols 582 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 19:52:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13125622839358798970.kers
Total runtime 1 ms.
[2026-05-25 19:52:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 19:52:29] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
[2026-05-25 19:52:29] [INFO ] Invariant cache hit.
[2026-05-25 19:52:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 19:52:29] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2026-05-25 19:52:29] [INFO ] Redundant transitions in 12 ms returned []
Running 142 sub problems to find dead transitions.
[2026-05-25 19:52:29] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
[2026-05-25 19:52:29] [INFO ] Invariant cache hit.
[2026-05-25 19:52:29] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 139/210 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 1/211 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/211 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 97 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6485 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 139/210 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 142/241 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 1/211 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/211 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 242 constraints, problems are : Problem set: 0 solved, 142 unsolved in 16138 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22657ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 22657ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/74 places, 150/158 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22810 ms. Remains : 71/74 places, 150/158 transitions.
Built C files in :
/tmp/ltsmin15260731092582897661
[2026-05-25 19:52:51] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2026-05-25 19:52:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:51] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2026-05-25 19:52:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:51] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2026-05-25 19:52:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:52:51] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15260731092582897661
Running compilation step : cd /tmp/ltsmin15260731092582897661;'/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 290 ms.
Running link step : cd /tmp/ltsmin15260731092582897661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15260731092582897661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17355990500295409832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 19:53:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:53:06] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:53:06] [INFO ] Time to serialize gal into /tmp/LTL13509308904703726742.gal : 1 ms
[2026-05-25 19:53:06] [INFO ] Time to serialize properties into /tmp/LTL16492686716661008424.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13509308904703726742.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1552550917107531550.hoa' '-atoms' '/tmp/LTL16492686716661008424.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16492686716661008424.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1552550917107531550.hoa
Reverse transition relation is NOT exact ! Due to transitions t14, t23, t32, t37, t61, t93, t66.t67.t68.t69.t70.t71.t72.t73.t74.t75.t76.t77.t78.t79.t80.t81...468
Computing Next relation with stutter on 1.06598e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
653 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.55326,234644,1,0,447,1.12154e+06,319,294,3641,1.38288e+06,770
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-17-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-17-LTLFireability-08 finished in 95743 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 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 450 edges and 391 vertex of which 60 / 391 are part of one of the 21 SCC in 2 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 351 transition count 320
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 168 rules applied. Total rules applied 322 place count 198 transition count 305
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 330 place count 190 transition count 305
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 330 place count 190 transition count 300
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 185 transition count 300
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 368 place count 157 transition count 248
Iterating global reduction 3 with 28 rules applied. Total rules applied 396 place count 157 transition count 248
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 402 place count 157 transition count 242
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 408 place count 151 transition count 242
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 417 place count 142 transition count 225
Iterating global reduction 5 with 9 rules applied. Total rules applied 426 place count 142 transition count 225
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 429 place count 139 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 432 place count 139 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 435 place count 139 transition count 219
Performed 52 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 539 place count 87 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 546 place count 87 transition count 157
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 553 place count 80 transition count 143
Iterating global reduction 7 with 7 rules applied. Total rules applied 560 place count 80 transition count 143
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 562 place count 78 transition count 140
Iterating global reduction 7 with 2 rules applied. Total rules applied 564 place count 78 transition count 140
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 565 place count 77 transition count 139
Iterating global reduction 7 with 1 rules applied. Total rules applied 566 place count 77 transition count 139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 567 place count 76 transition count 135
Iterating global reduction 7 with 1 rules applied. Total rules applied 568 place count 76 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 571 place count 76 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 577 place count 73 transition count 169
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 578 place count 72 transition count 167
Iterating global reduction 8 with 1 rules applied. Total rules applied 579 place count 72 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 595 place count 72 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 597 place count 71 transition count 160
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 598 place count 70 transition count 157
Iterating global reduction 8 with 1 rules applied. Total rules applied 599 place count 70 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 607 place count 70 transition count 149
Applied a total of 607 rules in 32 ms. Remains 70 /391 variables (removed 321) and now considering 149/519 (removed 370) transitions.
[2026-05-25 19:53:14] [INFO ] Flow matrix only has 139 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-5014573129105447238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6685754891857585576.kers'
[2026-05-25 19:53:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5014573129105447238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6685754891857585576.kers]
Normalized transition count is 138 out of 139 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 70 cols 574 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-25 19:53:14] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6685754891857585576.kers
Total runtime 1 ms.
[2026-05-25 19:53:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 19:53:14] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2026-05-25 19:53:14] [INFO ] Invariant cache hit.
[2026-05-25 19:53:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 19:53:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-25 19:53:15] [INFO ] Redundant transitions in 10 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-25 19:53:15] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2026-05-25 19:53:15] [INFO ] Invariant cache hit.
[2026-05-25 19:53:15] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 138/208 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 96 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 138/208 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 141/238 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 239 constraints, problems are : Problem set: 0 solved, 141 unsolved in 14717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20750ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 20751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/391 places, 149/519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20940 ms. Remains : 70/391 places, 149/519 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 38 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-09 finished in 21012 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(X(p1)))))'
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 379 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 379 transition count 502
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 371 transition count 489
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 371 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 371 transition count 487
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 367 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 367 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 365 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 365 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 363 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 363 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 361 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 361 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 360 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 360 transition count 468
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 360 transition count 465
Applied a total of 67 rules in 49 ms. Remains 360 /391 variables (removed 31) and now considering 465/519 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4292890373658008435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16579525039138932929.kers'
[2026-05-25 19:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4292890373658008435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16579525039138932929.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 465 rows 360 cols 1101 entries
Finished phase 1 with 340 SingleSign rule and 2 generalized
[2026-05-25 19:53:35] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16579525039138932929.kers
Total runtime 8 ms.
[2026-05-25 19:53:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 19:53:36] [INFO ] Invariant cache hit.
[2026-05-25 19:53:36] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-25 19:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/825 variables, and 66 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 465/825 variables, 360/440 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/825 variables, 464/904 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/825 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 909 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 360/391 places, 465/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60415 ms. Remains : 360/391 places, 465/519 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(X(p1)))))'
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (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-17-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (350 resets) in 89 ms. (444 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (59 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2026-05-25 19:54:37] [INFO ] Invariant cache hit.
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) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/303 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 465/825 variables, 360/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/825 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/303 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 465/825 variables, 360/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/825 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/825 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/825 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1240ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 127 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=127 )
Parikh walk visited 2 properties in 5 ms.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 1769 ms.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 465/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2026-05-25 19:54:38] [INFO ] Invariant cache hit.
[2026-05-25 19:54:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 19:54:39] [INFO ] Invariant cache hit.
[2026-05-25 19:54:39] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 360/360 places, 465/465 transitions.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (351 resets) in 119 ms. (333 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (61 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
[2026-05-25 19:54:39] [INFO ] Invariant cache hit.
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) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/303 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 465/825 variables, 360/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/825 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/303 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 465/825 variables, 360/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/825 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/825 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/825 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1263ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 131 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 4 ms.
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 1753 ms.
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Product exploration explored 100000 steps with 25000 reset in 100 ms.
Spot run failed in 47 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/ltsmin13206485631201365301
[2026-05-25 19:54:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13206485631201365301
Running compilation step : cd /tmp/ltsmin13206485631201365301;'/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 618 ms.
Running link step : cd /tmp/ltsmin13206485631201365301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13206485631201365301;'/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/stateBased1143452226244110761.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA HealthRecord-PT-17-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-17-LTLFireability-10 finished in 66776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Graph (trivial) has 447 edges and 391 vertex of which 60 / 391 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 351 transition count 327
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 161 rules applied. Total rules applied 308 place count 205 transition count 312
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 318 place count 197 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 320 place count 195 transition count 310
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 320 place count 195 transition count 305
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 330 place count 190 transition count 305
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 358 place count 162 transition count 253
Iterating global reduction 4 with 28 rules applied. Total rules applied 386 place count 162 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 392 place count 162 transition count 247
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 398 place count 156 transition count 247
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 407 place count 147 transition count 230
Iterating global reduction 6 with 9 rules applied. Total rules applied 416 place count 147 transition count 230
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 419 place count 144 transition count 227
Iterating global reduction 6 with 3 rules applied. Total rules applied 422 place count 144 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 425 place count 144 transition count 224
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 529 place count 92 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 535 place count 92 transition count 162
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 542 place count 85 transition count 148
Iterating global reduction 8 with 7 rules applied. Total rules applied 549 place count 85 transition count 148
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 551 place count 83 transition count 145
Iterating global reduction 8 with 2 rules applied. Total rules applied 553 place count 83 transition count 145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 554 place count 82 transition count 144
Iterating global reduction 8 with 1 rules applied. Total rules applied 555 place count 82 transition count 144
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 81 transition count 140
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 81 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 560 place count 81 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 566 place count 78 transition count 175
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 567 place count 77 transition count 173
Iterating global reduction 9 with 1 rules applied. Total rules applied 568 place count 77 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 584 place count 77 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 586 place count 76 transition count 167
Applied a total of 586 rules in 23 ms. Remains 76 /391 variables (removed 315) and now considering 167/519 (removed 352) transitions.
[2026-05-25 19:54:42] [INFO ] Flow matrix only has 157 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-15465294266378676398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15087640878529439036.kers'
[2026-05-25 19:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15465294266378676398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15087640878529439036.kers]
Normalized transition count is 156 out of 157 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 76 cols 690 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 19:54:42] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15087640878529439036.kers
Total runtime 2 ms.
[2026-05-25 19:54:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 19:54:42] [INFO ] Flow matrix only has 157 transitions (discarded 10 similar events)
[2026-05-25 19:54:42] [INFO ] Invariant cache hit.
[2026-05-25 19:54:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 19:54:42] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-05-25 19:54:42] [INFO ] Redundant transitions in 12 ms returned []
Running 151 sub problems to find dead transitions.
[2026-05-25 19:54:42] [INFO ] Flow matrix only has 157 transitions (discarded 10 similar events)
[2026-05-25 19:54:42] [INFO ] Invariant cache hit.
[2026-05-25 19:54:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 156/232 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 1/233 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/233 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 102 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8234 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 156/232 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 151/254 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 1/233 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 255 constraints, problems are : Problem set: 0 solved, 151 unsolved in 20740 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29001ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 29002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/391 places, 167/519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29185 ms. Remains : 76/391 places, 167/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-11 finished in 29263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X((G(p0)&&X(X(G(p2)))))))))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 380 transition count 505
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 380 transition count 505
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 372 transition count 493
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 372 transition count 493
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 372 transition count 491
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 368 transition count 484
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 368 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 367 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 367 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 366 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 366 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 365 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 365 transition count 479
Applied a total of 54 rules in 31 ms. Remains 365 /391 variables (removed 26) and now considering 479/519 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14795064354018709607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6282134263755471937.kers'
[2026-05-25 19:55:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14795064354018709607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6282134263755471937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 479 rows 365 cols 1145 entries
Finished phase 1 with 345 SingleSign rule and 2 generalized
[2026-05-25 19:55:11] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6282134263755471937.kers
Total runtime 3 ms.
[2026-05-25 19:55:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 19:55:12] [INFO ] Invariant cache hit.
[2026-05-25 19:55:12] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2026-05-25 19:55:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/365 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 478 unsolved
SMT process timed out in 30037ms, After SMT, problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 30038ms
Starting structural reductions in LTL mode, iteration 1 : 365/391 places, 479/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30347 ms. Remains : 365/391 places, 479/519 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X((G(p0)&&X(X(G(p2)))))))))'
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), true, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-12 finished in 30798 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)&&X(F(p1))))'
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 379 transition count 503
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 379 transition count 503
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 370 transition count 489
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 370 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 370 transition count 487
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 365 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 365 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 363 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 363 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 361 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 361 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 359 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 359 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 358 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 358 transition count 466
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 358 transition count 463
Applied a total of 71 rules in 39 ms. Remains 358 /391 variables (removed 33) and now considering 463/519 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-649416188771458228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2602046015693967621.kers'
[2026-05-25 19:55:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-649416188771458228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2602046015693967621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 358 cols 1099 entries
Finished phase 1 with 338 SingleSign rule and 2 generalized
[2026-05-25 19:55:42] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2602046015693967621.kers
Total runtime 2 ms.
[2026-05-25 19:55:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 19:55:42] [INFO ] Invariant cache hit.
[2026-05-25 19:55:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-25 19:55:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/821 variables, and 68 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 463/821 variables, 358/429 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 462/891 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 11/902 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 902 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 358/391 places, 463/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 358/391 places, 463/519 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)&&X(F(p1))))'
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-13
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-13 finished in 60532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0||X(p1)) U p2) U X((F(p3) U p2)))))'
Support contains 5 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 378 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 378 transition count 501
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 369 transition count 487
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 369 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 369 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 364 transition count 476
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 364 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 362 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 362 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 360 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 360 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 358 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 358 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 357 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 357 transition count 464
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 357 transition count 461
Applied a total of 73 rules in 44 ms. Remains 357 /391 variables (removed 34) and now considering 461/519 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10940667839331424005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11683360096848945912.kers'
[2026-05-25 19:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10940667839331424005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11683360096848945912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 357 cols 1093 entries
Finished phase 1 with 337 SingleSign rule and 2 generalized
[2026-05-25 19:56:43] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11683360096848945912.kers
Total runtime 7 ms.
[2026-05-25 19:56:43] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 19:56:43] [INFO ] Invariant cache hit.
[2026-05-25 19:56:43] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 19:56:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/357 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 52 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/357 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/431 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/891 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 895 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 357/391 places, 461/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60397 ms. Remains : 357/391 places, 461/519 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((((p0||X(p1)) U p2) U X((F(p3) U p2)))))'
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (AND (NOT p3) p2 (NOT p1))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-15
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-15 finished in 60700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(p0&&F(p1)))) U X(X(p2)))))'
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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 19:57:44] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin586391536571048545
[2026-05-25 19:57:44] [INFO ] Applying decomposition
[2026-05-25 19:57:44] [INFO ] Computing symmetric may disable matrix : 519 transitions.
[2026-05-25 19:57:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:57:44] [INFO ] Computing symmetric may enable matrix : 519 transitions.
[2026-05-25 19:57:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:57:44] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12639108587693213151.txt' '-o' '/tmp/graph12639108587693213151.bin' '-w' '/tmp/graph12639108587693213151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12639108587693213151.bin' '-l' '-1' '-v' '-w' '/tmp/graph12639108587693213151.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:57:44] [INFO ] Decomposing Gal with order
[2026-05-25 19:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:57:44] [INFO ] Computing Do-Not-Accords matrix : 519 transitions.
[2026-05-25 19:57:44] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:57:44] [INFO ] Removed a total of 172 redundant transitions.
[2026-05-25 19:57:44] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin586391536571048545
Running compilation step : cd /tmp/ltsmin586391536571048545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 19:57:44] [INFO ] Flatten gal took : 54 ms
[2026-05-25 19:57:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 16 ms.
[2026-05-25 19:57:44] [INFO ] Time to serialize gal into /tmp/LTLFireability3594297546685103713.gal : 4 ms
[2026-05-25 19:57:44] [INFO ] Time to serialize properties into /tmp/LTLFireability15900684341893016374.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3594297546685103713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15900684341893016374.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F((G("(i1.i1.u10.p64!=1)"))||(("(i1.i1.u10.p64!=1)")&&(F("(i18.u137.p591==1)")))))U(X(X("(i3.i0.u22.p170==1)"))))))
Formula 0 simplified : F(G(F!"(i1.i1.u10.p64!=1)" & (!"(i1.i1.u10.p64!=1)" | G!"(i18.u137.p591==1)")) R XX!"(i3.i0.u22.p170==1)")
Compilation finished in 1080 ms.
Running link step : cd /tmp/ltsmin586391536571048545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin586391536571048545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))) U X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t13, t107, t444, t445, t446, t447, t448, t460, t465, u56.t248, i1.i1.t388, i1.i1.t391, i1.i1....2315
Computing Next relation with stutter on 4.72576e+06 deadlock states
223 unique states visited
223 strongly connected components in search stack
224 transitions explored
223 items max in DFS search stack
26701 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,267.09,5721464,1,0,8.42976e+06,27599,7019,1.27783e+07,1047,181865,20117465
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-17-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1210551 ms.

BK_STOP 1779739364682

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-17"
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-17, 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-177961074300668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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