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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 6.1K Mar 7 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 7 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 7 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 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 67K 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-07-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-12
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-13
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-14
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779736014140

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 19:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:06:55] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2026-05-25 19:06:55] [INFO ] Transformed 155 places.
[2026-05-25 19:06:55] [INFO ] Transformed 320 transitions.
[2026-05-25 19:06:55] [INFO ] Found NUPN structural information;
[2026-05-25 19:06:55] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 99 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 125 transition count 240
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 125 transition count 240
Applied a total of 60 rules in 19 ms. Remains 125 /155 variables (removed 30) and now considering 240/295 (removed 55) transitions.
[2026-05-25 19:06:55] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5058891421481980254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13550445504005559995.kers'
[2026-05-25 19:06:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5058891421481980254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13550445504005559995.kers]
Normalized transition count is 232 out of 233 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 232 rows 121 cols 639 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-25 19:06:55] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13550445504005559995.kers
Total runtime 2 ms.
[2026-05-25 19:06:55] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-25 19:06:55] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2026-05-25 19:06:55] [INFO ] Invariant cache hit.
[2026-05-25 19:06:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:06:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2026-05-25 19:06:56] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2026-05-25 19:06:56] [INFO ] Invariant cache hit.
[2026-05-25 19:06:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 232/357 variables, 125/188 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 1/358 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 16 (OVERLAPS) 0/358 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 210 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 232/357 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 239/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/358 variables, and 473 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 125/155 places, 240/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60596 ms. Remains : 125/155 places, 240/295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-05-25 19:07:56] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2026-05-25 19:07:56] [INFO ] Invariant cache hit.
[2026-05-25 19:07:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:07:56] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2026-05-25 19:07:56] [INFO ] Invariant cache hit.
[2026-05-25 19:07:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:07:56] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 125/125 places, 240/240 transitions.
Support contains 99 out of 125 places after structural reductions.
[2026-05-25 19:07:56] [INFO ] Flatten gal took : 38 ms
[2026-05-25 19:07:56] [INFO ] Flatten gal took : 18 ms
[2026-05-25 19:07:56] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 98 out of 125 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (2116 resets) in 1763 ms. (22 steps per ms) remains 41/95 properties
BEST_FIRST walk for 4003 steps (21 resets) in 52 ms. (75 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (31 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (29 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (30 resets) in 43 ms. (91 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (32 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
[2026-05-25 19:07:57] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2026-05-25 19:07:57] [INFO ] Invariant cache hit.
[2026-05-25 19:07:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/113 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 33 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/27 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/47 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 11/58 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 7/65 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 10/75 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 8/83 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 3/86 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/87 constraints. Problems are: Problem set: 7 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 113/358 variables, and 87 constraints, problems are : Problem set: 7 solved, 30 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/9 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/125 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 66/105 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 79/84 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/84 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 16/121 variables, 4/88 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/89 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/92 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 7/99 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 4/103 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 3/106 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 5/111 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/112 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 3/115 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 4/125 variables, 4/119 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 1/120 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 0/120 constraints. Problems are: Problem set: 7 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 232/357 variables, 125/245 constraints. Problems are: Problem set: 7 solved, 30 unsolved
Problem AtomicPropp88 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 30/275 constraints. Problems are: Problem set: 8 solved, 29 unsolved
SMT process timed out in 10032ms, After SMT, problems are : Problem set: 8 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 84 edges and 125 vertex of which 10 / 125 are part of one of the 5 SCC in 44 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 499 edges and 120 vertex of which 115 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
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 0 with 4 rules applied. Total rules applied 6 place count 115 transition count 218
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 111 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 110 transition count 213
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 110 transition count 209
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 27 place count 103 transition count 209
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 57 place count 73 transition count 149
Iterating global reduction 3 with 30 rules applied. Total rules applied 87 place count 73 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 71 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 71 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 70 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 70 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 70 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 69 transition count 144
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 111 place count 69 transition count 144
Applied a total of 111 rules in 104 ms. Remains 69 /125 variables (removed 56) and now considering 144/240 (removed 96) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1414693134710553750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16788197645875058483.kers'
[2026-05-25 19:08:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1414693134710553750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16788197645875058483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 69 cols 529 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-25 19:08:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16788197645875058483.kers
Total runtime 4 ms.
[2026-05-25 19:08:07] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD143 is UNSAT
At refinement iteration 4 (OVERLAPS) 144/213 variables, 69/74 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 3/77 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 4/81 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 81 constraints, problems are : Problem set: 1 solved, 142 unsolved in 4807 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 144/213 variables, 69/79 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 142/224 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 10/234 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 3/237 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 142 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/213 variables, and 238 constraints, problems are : Problem set: 1 solved, 142 unsolved in 20021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 142/143 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24874ms problems are : Problem set: 1 solved, 142 unsolved
Search for dead transitions found 1 dead transitions in 24876ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/125 places, 143/240 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 143
Applied a total of 2 rules in 9 ms. Remains 69 /69 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24990 ms. Remains : 69/125 places, 143/240 transitions.
RANDOM walk for 40000 steps (35 resets) in 251 ms. (158 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4002 steps (39 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (27 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (33 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (20 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (17 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (30 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (16 resets) in 31 ms. (125 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (19 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (11 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (26 resets) in 45 ms. (86 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (27 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (46 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (20 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (28 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (27 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (22 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (21 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (31 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (33 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (26 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (45 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12085002421934233720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13384163015400273166.kers'
[2026-05-25 19:08:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12085002421934233720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13384163015400273166.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 69 cols 532 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-25 19:08:32] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13384163015400273166.kers
Total runtime 1 ms.
[2026-05-25 19:08:32] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 41/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 143/212 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 77 constraints, problems are : Problem set: 0 solved, 23 unsolved in 370 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 41/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 143/212 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 116 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3282 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3660ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 19 different solutions.
Parikh walk visited 21 properties in 1424 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 143/143 transitions.
Graph (trivial) has 66 edges and 69 vertex of which 2 / 69 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 47 transition count 100
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 47 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 46 place count 47 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 46 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 46 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 45 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 42 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 42 transition count 113
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 42 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 38 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 38 transition count 107
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 88 place count 38 transition count 107
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 38 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 37 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 37 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 37 transition count 101
Applied a total of 101 rules in 30 ms. Remains 37 /69 variables (removed 32) and now considering 101/143 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 37/69 places, 101/143 transitions.
RANDOM walk for 40000 steps (1789 resets) in 814 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (475 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (463 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1730 steps, run visited all 2 properties in 14 ms. (steps per millisecond=123 )
Probabilistic random walk after 1730 steps, saw 657 distinct states, run finished after 20 ms. (steps per millisecond=86 ) properties seen :2
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2026-05-25 19:08:38] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:08:38] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:08:38] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 85 out of 125 places (down from 86) after GAL structural reductions.
Computed a total of 15 stabilizing places and 26 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 72 transition count 138
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 72 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 65 transition count 124
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 65 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 125 place count 65 transition count 119
Applied a total of 125 rules in 6 ms. Remains 65 /125 variables (removed 60) and now considering 119/240 (removed 121) transitions.
[2026-05-25 19:08:38] [INFO ] Flow matrix only has 116 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8680455405659438319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2673715553188067278.kers'
[2026-05-25 19:08:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8680455405659438319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2673715553188067278.kers]
Normalized transition count is 115 out of 116 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 65 cols 379 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-25 19:08:38] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2673715553188067278.kers
Total runtime 0 ms.
[2026-05-25 19:08:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:08:38] [INFO ] Flow matrix only has 116 transitions (discarded 3 similar events)
[2026-05-25 19:08:38] [INFO ] Invariant cache hit.
[2026-05-25 19:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2026-05-25 19:08:38] [INFO ] Flow matrix only has 116 transitions (discarded 3 similar events)
[2026-05-25 19:08:38] [INFO ] Invariant cache hit.
[2026-05-25 19:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 115/180 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 79 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4679 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 115/180 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 118/198 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/181 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 199 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9424 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14121ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 14121ms
Starting structural reductions in LTL mode, iteration 1 : 65/125 places, 119/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14220 ms. Remains : 65/125 places, 119/240 transitions.
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:08:52] [INFO ] Input system was already deterministic with 119 transitions.
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:08:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6365994890436676495.gal : 2 ms
[2026-05-25 19:08:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1809407611918372047.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6365994890436676495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1809407611918372047.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.40644e+06,0.169892,10992,2,2179,5,26523,6,0,375,34757,0


Converting to forward existential form...Done !
original formula: AX((AX(EF((p38==1))) + (((E((p35==1) U (p13==1)) * AG((p50==1))) * ((p27==0)&&(p131==0))) * (((p12==1) * ((EG((p103==1)) + (p133==0)) + (...206
=> equivalent forward existential formula: ((([((EY(Init) * !(!(EX(!(E(TRUE U (p38==1))))))) * !(E((p35==1) U (p13==1))))] = FALSE * [(FwdU((EY(Init) * !(!...591
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...394
(forward)formula 0,0,0.676723,27084,1,0,232,125899,270,106,2729,95036,268
FORMULA HealthRecord-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 69 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 69 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 69 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 123 place count 61 transition count 113
Iterating global reduction 1 with 8 rules applied. Total rules applied 131 place count 61 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 61 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 59 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 59 transition count 101
Applied a total of 141 rules in 7 ms. Remains 59 /125 variables (removed 66) and now considering 101/240 (removed 139) transitions.
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4309031940396765545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3291181749283340349.kers'
[2026-05-25 19:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4309031940396765545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3291181749283340349.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 59 cols 319 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 19:08:53] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3291181749283340349.kers
Total runtime 0 ms.
[2026-05-25 19:08:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:08:53] [INFO ] Invariant cache hit.
[2026-05-25 19:08:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:08:53] [INFO ] Invariant cache hit.
[2026-05-25 19:08:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/156 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3580 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 97/156 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 179 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11610ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11611ms
Starting structural reductions in LTL mode, iteration 1 : 59/125 places, 101/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11710 ms. Remains : 59/125 places, 101/240 transitions.
[2026-05-25 19:09:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:04] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-25 19:09:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:09:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18345277212538784422.gal : 1 ms
[2026-05-25 19:09:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3776218036364783609.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18345277212538784422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3776218036364783609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81255e+06,0.173499,11048,2,2462,5,28553,6,0,333,32674,0


Converting to forward existential form...Done !
original formula: (!(A(EF((EF((p131==1)) * EX((p97==1)))) U (p94==1))) + (EX(EG(((((p80==1)||(p30==1))&&(p80==0)) + A((p6==1) U ((p36==1)&&(p152==1)))))) *...170
=> equivalent forward existential formula: ([((Init * !(!(!((E(!((p94==1)) U (!(E(TRUE U (E(TRUE U (p131==1)) * EX((p97==1))))) * !((p94==1)))) + EG(!((p94...493
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...378
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.98513,239004,1,0,630,1.38038e+06,247,316,2459,1.54282e+06,706
FORMULA HealthRecord-PT-07-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 65 transition count 124
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 65 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 65 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 58 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 58 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 140 place count 58 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 55 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 55 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 52 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 52 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 52 transition count 80
Applied a total of 161 rules in 12 ms. Remains 52 /125 variables (removed 73) and now considering 80/240 (removed 160) transitions.
[2026-05-25 19:09:12] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3909973607529611250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5673620422489476343.kers'
[2026-05-25 19:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3909973607529611250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5673620422489476343.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 52 cols 255 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:09:12] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5673620422489476343.kers
Total runtime 0 ms.
[2026-05-25 19:09:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:09:12] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:09:12] [INFO ] Invariant cache hit.
[2026-05-25 19:09:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-25 19:09:12] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:09:12] [INFO ] Invariant cache hit.
[2026-05-25 19:09:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/128 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 66 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/128 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 79/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 146 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4741 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7129ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7130ms
Starting structural reductions in LTL mode, iteration 1 : 52/125 places, 80/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7285 ms. Remains : 52/125 places, 80/240 transitions.
[2026-05-25 19:09:19] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:09:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:19] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-25 19:09:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:19] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8496958753450127188.gal : 1 ms
[2026-05-25 19:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9517692634837379158.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8496958753450127188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9517692634837379158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,870921,0.126615,9808,2,2217,5,26531,6,0,284,17889,0


Converting to forward existential form...Done !
original formula: (EF((p87==1)) * AX((p74==0)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p87==1))))] = FALSE * [(EY(Init) * !((p74==0)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t21, t22, t49, t50, t...267
(forward)formula 0,1,0.526067,23952,1,0,150,106985,179,72,2023,76728,176
FORMULA HealthRecord-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 71 transition count 136
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 71 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 71 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 65 transition count 121
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 65 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 65 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 64 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 64 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 63 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 63 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 132 place count 63 transition count 111
Applied a total of 132 rules in 12 ms. Remains 63 /125 variables (removed 62) and now considering 111/240 (removed 129) transitions.
[2026-05-25 19:09:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-32142403717709073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-864451770637571236.kers'
[2026-05-25 19:09:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-32142403717709073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-864451770637571236.kers]
Normalized transition count is 107 out of 108 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 63 cols 349 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-25 19:09:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-864451770637571236.kers
Total runtime 0 ms.
[2026-05-25 19:09:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 19:09:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2026-05-25 19:09:19] [INFO ] Invariant cache hit.
[2026-05-25 19:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2026-05-25 19:09:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2026-05-25 19:09:19] [INFO ] Invariant cache hit.
[2026-05-25 19:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 107/170 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/171 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 76 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 107/170 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 110/188 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/171 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 189 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9103 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12414ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12415ms
Starting structural reductions in LTL mode, iteration 1 : 63/125 places, 111/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12521 ms. Remains : 63/125 places, 111/240 transitions.
[2026-05-25 19:09:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:09:32] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:32] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-25 19:09:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16389080671703337165.gal : 1 ms
[2026-05-25 19:09:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11034552142490939073.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16389080671703337165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11034552142490939073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87856e+06,0.048096,5928,2,1042,5,7874,6,0,359,8799,0


Converting to forward existential form...Done !
original formula: E((p145==1) U ((EF(((AX((p5==1)) + E((p7==1) U (p91==1))) + A((p105==1) U (p6==1)))) + A((p144==1) U (p87==1))) + (p64==1)))
=> equivalent forward existential formula: (((([(FwdU(FwdU(Init,(p145==1)),TRUE) * !(EX(!((p5==1)))))] != FALSE + [(FwdU(FwdU(FwdU(Init,(p145==1)),TRUE),(p...462
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...374
Hit Full ! (commute/partial/dont) 108/0/3
(forward)formula 0,1,0.233626,14196,1,0,208,49133,243,91,2608,45249,230
FORMULA HealthRecord-PT-07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 164 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 125
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 113 place count 62 transition count 123
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 121 place count 54 transition count 107
Iterating global reduction 1 with 8 rules applied. Total rules applied 129 place count 54 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 135 place count 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 51 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 48 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 48 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 156 place count 48 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 163 place count 48 transition count 70
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 3 with 4 rules applied. Total rules applied 167 place count 46 transition count 68
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 42 transition count 64
Applied a total of 171 rules in 22 ms. Remains 42 /125 variables (removed 83) and now considering 64/240 (removed 176) transitions.
[2026-05-25 19:09:32] [INFO ] Flow matrix only has 54 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-15154793526186638867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4500263884162496985.kers'
[2026-05-25 19:09:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15154793526186638867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4500263884162496985.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 53 rows 41 cols 184 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-25 19:09:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4500263884162496985.kers
Total runtime 0 ms.
[2026-05-25 19:09:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 19:09:32] [INFO ] Flow matrix only has 54 transitions (discarded 10 similar events)
[2026-05-25 19:09:32] [INFO ] Invariant cache hit.
[2026-05-25 19:09:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2026-05-25 19:09:32] [INFO ] Redundant transitions in 17 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-25 19:09:32] [INFO ] Flow matrix only has 54 transitions (discarded 10 similar events)
[2026-05-25 19:09:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 7/42 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 53/95 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 56 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 7/42 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 53/95 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 107 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2283ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/125 places, 64/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2405 ms. Remains : 42/125 places, 64/240 transitions.
[2026-05-25 19:09:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:09:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:35] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-25 19:09:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12116398148308901059.gal : 1 ms
[2026-05-25 19:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16984486670419056695.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12116398148308901059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16984486670419056695.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,118516,0.028078,4924,2,439,5,4255,6,0,213,4300,0


Converting to forward existential form...Done !
original formula: (EF((p21==1)) * AF(((p17==0)||(p3==1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p21==1))))] = FALSE * [FwdG(Init,!(((p17==0)||(p3==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t30, t31, Intersection with reac...230
(forward)formula 0,1,0.140156,9736,1,0,123,30212,148,60,1546,24868,143
FORMULA HealthRecord-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 69 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 69 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 69 transition count 130
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 63 transition count 118
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 63 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 128 place count 63 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 62 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 62 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 61 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 61 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 61 transition count 108
Applied a total of 135 rules in 11 ms. Remains 61 /125 variables (removed 64) and now considering 108/240 (removed 132) transitions.
[2026-05-25 19:09:35] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13128292124923466659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3757463829460078411.kers'
[2026-05-25 19:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13128292124923466659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3757463829460078411.kers]
Normalized transition count is 104 out of 105 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 61 cols 345 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 19:09:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3757463829460078411.kers
Total runtime 0 ms.
[2026-05-25 19:09:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:09:35] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2026-05-25 19:09:35] [INFO ] Invariant cache hit.
[2026-05-25 19:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-25 19:09:35] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2026-05-25 19:09:35] [INFO ] Invariant cache hit.
[2026-05-25 19:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 104/165 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/166 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 77 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 104/165 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 107/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 186 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8714 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12111ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12111ms
Starting structural reductions in LTL mode, iteration 1 : 61/125 places, 108/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12217 ms. Remains : 61/125 places, 108/240 transitions.
[2026-05-25 19:09:47] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:09:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:47] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-25 19:09:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1030290520165259449.gal : 0 ms
[2026-05-25 19:09:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12566162020046593887.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1030290520165259449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12566162020046593887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.92238e+06,0.084779,7864,2,1445,5,16391,6,0,348,17288,0


Converting to forward existential form...Done !
original formula: AX(E((!(EX(AF((p29==1)))) + AG(E((p17==1) U (p3==1)))) U ((p4==1) * AG((((((p109==1)&&(p118==1))||(p129==1))&&(p84==1))&&(p43==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((!(EX(!(EG(!((p29==1)))))) + !(E(TRUE U !(E((p17==1) U (p3==1)))))) U ((p4==1) * !(E(TRUE U !((...229
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...363
(forward)formula 0,0,3.24169,109516,1,0,391,657805,251,186,2575,648760,447
FORMULA HealthRecord-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 69 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 69 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 69 transition count 129
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 62 transition count 115
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 62 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 135 place count 62 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 61 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 61 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 60 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 60 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 60 transition count 101
Applied a total of 142 rules in 5 ms. Remains 60 /125 variables (removed 65) and now considering 101/240 (removed 139) transitions.
[2026-05-25 19:09:50] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9339029819398339485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4084700552623472467.kers'
[2026-05-25 19:09:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9339029819398339485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4084700552623472467.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 60 cols 319 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 19:09:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4084700552623472467.kers
Total runtime 1 ms.
[2026-05-25 19:09:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:09:50] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:09:50] [INFO ] Invariant cache hit.
[2026-05-25 19:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-25 19:09:50] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:09:50] [INFO ] Invariant cache hit.
[2026-05-25 19:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/157 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 73 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 97/157 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 100/177 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 178 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7365 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10512ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10513ms
Starting structural reductions in LTL mode, iteration 1 : 60/125 places, 101/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10600 ms. Remains : 60/125 places, 101/240 transitions.
[2026-05-25 19:10:01] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:10:01] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:10:01] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-25 19:10:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13685326671163665533.gal : 1 ms
[2026-05-25 19:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14893440586294619785.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13685326671163665533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14893440586294619785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08441e+06,0.070964,7208,2,1351,5,13326,6,0,337,13269,0


Converting to forward existential form...Done !
original formula: E((AX((p69==1)) + (!((AF((p47==1)) * EG((p80==1)))) * AX(!(AG(((p17==1)&&(p152==1))))))) U EF((A((((p77==1)||(p99==1))||((p109==1)&&(p149...211
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,(!(EX(!((p69==1)))) + (!((!(EG(!((p47==1)))) * EG((p80==1)))) * !(EX(!(!(!(E(TRUE U !(((p17==...566
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...323
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.63822,236280,1,0,669,1.38832e+06,249,402,2648,1.48651e+06,748
FORMULA HealthRecord-PT-07-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 70 transition count 133
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 70 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 70 transition count 130
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 63 transition count 116
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 63 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 63 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 62 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 62 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 61 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 61 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 61 transition count 103
Applied a total of 139 rules in 9 ms. Remains 61 /125 variables (removed 64) and now considering 103/240 (removed 137) transitions.
[2026-05-25 19:10:08] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13700236845036598638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9226105184779070384.kers'
[2026-05-25 19:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13700236845036598638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9226105184779070384.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 98 rows 60 cols 323 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 19:10:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9226105184779070384.kers
Total runtime 0 ms.
[2026-05-25 19:10:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 19:10:08] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2026-05-25 19:10:08] [INFO ] Invariant cache hit.
[2026-05-25 19:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:10:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 19:10:08] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2026-05-25 19:10:08] [INFO ] Invariant cache hit.
[2026-05-25 19:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 98/159 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 78 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 98/159 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 102/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 180 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6318 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9502ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 9503ms
Starting structural reductions in LTL mode, iteration 1 : 61/125 places, 103/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9623 ms. Remains : 61/125 places, 103/240 transitions.
[2026-05-25 19:10:17] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:17] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 19:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9060750490706090193.gal : 1 ms
[2026-05-25 19:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7955973919328077428.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9060750490706090193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7955973919328077428.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.92262e+06,0.216382,13060,2,2630,5,40512,6,0,340,36154,0


Converting to forward existential form...Done !
original formula: (EF((((AX((p92==0)) + (p68==0)) + (p62==1)) * A((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71==1))&&((p76==1)&&(p83==1...247
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((!(EX(!((p92==0)))) + (p68==0)) + (p62==1)) * !((E(!((p81==1)) U (!((((((p18==1)&&(p37==1...416
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...378
(forward)formula 0,0,6.14681,173000,1,0,355,1.03718e+06,225,163,2444,1.04315e+06,382
FORMULA HealthRecord-PT-07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 178 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 126
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 114 place count 62 transition count 123
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 55 transition count 109
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 55 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 52 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 49 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 49 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 154 place count 49 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 161 place count 49 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 47 transition count 71
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 43 transition count 67
Applied a total of 169 rules in 23 ms. Remains 43 /125 variables (removed 82) and now considering 67/240 (removed 173) transitions.
[2026-05-25 19:10:24] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13523888911884690860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4874885990949326923.kers'
[2026-05-25 19:10:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523888911884690860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4874885990949326923.kers]
Normalized transition count is 57 out of 58 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 43 cols 194 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-25 19:10:24] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4874885990949326923.kers
Total runtime 1 ms.
[2026-05-25 19:10:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 19:10:24] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2026-05-25 19:10:24] [INFO ] Invariant cache hit.
[2026-05-25 19:10:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-25 19:10:24] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 19:10:24] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2026-05-25 19:10:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 57/100 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 55 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 57/100 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2453ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/125 places, 67/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2567 ms. Remains : 43/125 places, 67/240 transitions.
[2026-05-25 19:10:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:10:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:26] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-25 19:10:26] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:26] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12132249975080997911.gal : 1 ms
[2026-05-25 19:10:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17279132838868924021.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12132249975080997911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17279132838868924021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,126580,0.029982,4848,2,437,5,3819,6,0,223,3882,0


Converting to forward existential form...Done !
original formula: E(!(EG((p119==1))) U (p13==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG((p119==1)))) * (p13==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t31, t32, Interse...245
(forward)formula 0,1,0.170763,11264,1,0,179,33917,151,129,1572,42530,255
FORMULA HealthRecord-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 67 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 67 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 67 transition count 126
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 61 transition count 114
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 61 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 61 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 59 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 59 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 57 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 57 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 146 place count 57 transition count 96
Applied a total of 146 rules in 3 ms. Remains 57 /125 variables (removed 68) and now considering 96/240 (removed 144) transitions.
[2026-05-25 19:10:26] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12534542034933807869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12743687751722489124.kers'
[2026-05-25 19:10:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12534542034933807869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12743687751722489124.kers]
Normalized transition count is 92 out of 93 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 57 cols 309 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 19:10:26] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12743687751722489124.kers
Total runtime 1 ms.
[2026-05-25 19:10:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:10:26] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2026-05-25 19:10:26] [INFO ] Invariant cache hit.
[2026-05-25 19:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:10:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-25 19:10:26] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2026-05-25 19:10:26] [INFO ] Invariant cache hit.
[2026-05-25 19:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/149 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 69 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 92/149 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 95/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 167 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6004 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8724ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 8725ms
Starting structural reductions in LTL mode, iteration 1 : 57/125 places, 96/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8818 ms. Remains : 57/125 places, 96/240 transitions.
[2026-05-25 19:10:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:10:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:10:35] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-25 19:10:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:10:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14299812120683356702.gal : 1 ms
[2026-05-25 19:10:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13646932701487129008.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14299812120683356702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13646932701487129008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16714e+06,0.06719,6848,2,1062,5,11640,6,0,320,13955,0


Converting to forward existential form...Done !
original formula: AX(((A(((EX((p22==1)) + AF(((p109==1)&&(p151==1)))) + E((p145==1) U (p0==1))) U EF((p122==1))) * AF((p30==0))) * !(E((p33==1) U A((p118==...172
=> equivalent forward existential formula: ((([((FwdU(EY(Init),!(E(TRUE U (p122==1)))) * !(((EX((p22==1)) + !(EG(!(((p109==1)&&(p151==1)))))) + E((p145==1)...405
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...312
Hit Full ! (commute/partial/dont) 93/0/3
(forward)formula 0,1,2.0478,77084,1,0,476,437131,254,244,2365,436931,593
FORMULA HealthRecord-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 73 transition count 140
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 73 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 70 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 70 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 112 place count 70 transition count 132
Applied a total of 112 rules in 2 ms. Remains 70 /125 variables (removed 55) and now considering 132/240 (removed 108) transitions.
[2026-05-25 19:10:37] [INFO ] Flow matrix only has 129 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15347109258440283637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2477544564199608609.kers'
[2026-05-25 19:10:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15347109258440283637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2477544564199608609.kers]
Normalized transition count is 128 out of 129 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 70 cols 419 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-25 19:10:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2477544564199608609.kers
Total runtime 0 ms.
[2026-05-25 19:10:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:10:37] [INFO ] Flow matrix only has 129 transitions (discarded 3 similar events)
[2026-05-25 19:10:37] [INFO ] Invariant cache hit.
[2026-05-25 19:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:10:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-25 19:10:37] [INFO ] Flow matrix only has 129 transitions (discarded 3 similar events)
[2026-05-25 19:10:37] [INFO ] Invariant cache hit.
[2026-05-25 19:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 128/198 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/199 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 86 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 128/198 variables, 70/89 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 131/220 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 221 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14432 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19760ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 19761ms
Starting structural reductions in LTL mode, iteration 1 : 70/125 places, 132/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19876 ms. Remains : 70/125 places, 132/240 transitions.
[2026-05-25 19:10:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:10:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:10:57] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-25 19:10:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17232948077893709563.gal : 0 ms
[2026-05-25 19:10:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10017105993259649103.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17232948077893709563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10017105993259649103.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.67463e+06,0.113139,9136,2,1723,5,18129,6,0,408,24378,0


Converting to forward existential form...Done !
original formula: (AG((AX(EF((p43==0))) * EX((AG((p141==1)) * (p130==1))))) + ((AF(((AG((p143==0)) + ((p109==1)&&(p140==1))) + (((p109==0)||(p126==0))&&(p1...345
=> equivalent forward existential formula: (([FwdG((Init * !(!(E(TRUE U !((!(EX(!(E(TRUE U (p43==0))))) * EX((!(E(TRUE U !((p141==1)))) * (p130==1)))))))))...1267
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...417
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.984205,42580,1,0,375,211215,323,180,3276,156465,433
FORMULA HealthRecord-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 180 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 61 transition count 124
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 61 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 116 place count 61 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 54 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 54 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 51 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 48 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 48 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 157 place count 48 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 48 transition count 70
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 3 with 4 rules applied. Total rules applied 168 place count 46 transition count 68
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 42 transition count 64
Applied a total of 172 rules in 20 ms. Remains 42 /125 variables (removed 83) and now considering 64/240 (removed 176) transitions.
[2026-05-25 19:10:58] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15518741579601181615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13241010350663748020.kers'
[2026-05-25 19:10:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15518741579601181615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13241010350663748020.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 42 cols 186 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 19:10:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13241010350663748020.kers
Total runtime 0 ms.
[2026-05-25 19:10:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:10:58] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2026-05-25 19:10:58] [INFO ] Invariant cache hit.
[2026-05-25 19:10:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2026-05-25 19:10:58] [INFO ] Redundant transitions in 13 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-25 19:10:58] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2026-05-25 19:10:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 54/96 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 50 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 54/96 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 104 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2163ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2163ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/125 places, 64/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2282 ms. Remains : 42/125 places, 64/240 transitions.
[2026-05-25 19:11:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:11:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:00] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-25 19:11:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:11:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:11:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6188574239452687518.gal : 1 ms
[2026-05-25 19:11:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5712251017404889739.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6188574239452687518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5712251017404889739.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 5812 steps (577 resets) in 21 ms. (264 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-07-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 72 transition count 137
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 72 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 72 transition count 134
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 116 place count 65 transition count 120
Iterating global reduction 1 with 7 rules applied. Total rules applied 123 place count 65 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 65 transition count 114
Applied a total of 129 rules in 2 ms. Remains 65 /125 variables (removed 60) and now considering 114/240 (removed 126) transitions.
[2026-05-25 19:11:00] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5946769333532880240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18343417476931804578.kers'
[2026-05-25 19:11:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5946769333532880240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18343417476931804578.kers]
Normalized transition count is 109 out of 110 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 109 rows 64 cols 357 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-25 19:11:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18343417476931804578.kers
Total runtime 0 ms.
[2026-05-25 19:11:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:11:00] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
[2026-05-25 19:11:00] [INFO ] Invariant cache hit.
[2026-05-25 19:11:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:11:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-25 19:11:00] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
[2026-05-25 19:11:00] [INFO ] Invariant cache hit.
[2026-05-25 19:11:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 109/174 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 82 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 109/174 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 113/198 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 199 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8495 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13168ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 13168ms
Starting structural reductions in LTL mode, iteration 1 : 65/125 places, 114/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13258 ms. Remains : 65/125 places, 114/240 transitions.
[2026-05-25 19:11:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:11:14] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:11:14] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 19:11:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability654075305084346740.gal : 1 ms
[2026-05-25 19:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17432605513448780161.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability654075305084346740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17432605513448780161.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3195e+06,0.060121,6568,2,836,5,10035,6,0,367,11168,0


Converting to forward existential form...Done !
original formula: E(EG(!(((AX(A((p97==1) U (p44==1))) * A((p59==1) U (((p17==1)&&(p36==1))&&((p55==1)&&(p148==1))))) * !(((p19==1)||(p127==1)))))) U !((A((...256
=> equivalent forward existential formula: ([(((FwdU((FwdU(Init,EG(!(((!(EX(!(!((E(!((p44==1)) U (!((p97==1)) * !((p44==1)))) + EG(!((p44==1)))))))) * !((E...1015
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...373
Hit Full ! (commute/partial/dont) 107/0/7
(forward)formula 0,1,6.59542,230828,1,0,797,1.41993e+06,293,412,2897,1.40289e+06,966
FORMULA HealthRecord-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 66 transition count 126
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 66 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 66 transition count 123
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 58 transition count 107
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 58 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 58 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 55 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 55 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 53 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 53 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 53 transition count 82
Applied a total of 159 rules in 8 ms. Remains 53 /125 variables (removed 72) and now considering 82/240 (removed 158) transitions.
[2026-05-25 19:11:20] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10194605448472987193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15338452542244024849.kers'
[2026-05-25 19:11:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10194605448472987193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15338452542244024849.kers]
Normalized transition count is 78 out of 79 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 53 cols 259 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 19:11:20] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15338452542244024849.kers
Total runtime 0 ms.
[2026-05-25 19:11:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 19:11:20] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:11:20] [INFO ] Invariant cache hit.
[2026-05-25 19:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:11:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-25 19:11:20] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:11:20] [INFO ] Invariant cache hit.
[2026-05-25 19:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/131 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 78/131 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7293ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7294ms
Starting structural reductions in LTL mode, iteration 1 : 53/125 places, 82/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7380 ms. Remains : 53/125 places, 82/240 transitions.
[2026-05-25 19:11:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:28] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:11:28] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-25 19:11:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2209057939714961801.gal : 1 ms
[2026-05-25 19:11:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8585864628746306026.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2209057939714961801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8585864628746306026.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,899109,0.076234,7476,2,1514,5,14460,6,0,290,15940,0


Converting to forward existential form...Done !
original formula: (EX(AG((((p94==1)||(p15==1))||(p11!=1)))) + EG((p94==1)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((((p94==1)||(p15==1))||(p11!=1))))))] != FALSE + [FwdG(Init,(p94==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t21, t22, t23, t...302
(forward)formula 0,0,0.393267,21196,1,0,181,90653,191,82,2063,81844,203
FORMULA HealthRecord-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 73 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 61 transition count 124
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 61 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 116 place count 61 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 54 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 54 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 54 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 52 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 50 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 50 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 147 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 154 place count 50 transition count 81
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 3 with 4 rules applied. Total rules applied 158 place count 48 transition count 79
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 44 transition count 75
Applied a total of 162 rules in 18 ms. Remains 44 /125 variables (removed 81) and now considering 75/240 (removed 165) transitions.
[2026-05-25 19:11:28] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13424006844702025266.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10792582398236447588.kers'
[2026-05-25 19:11:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13424006844702025266.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10792582398236447588.kers]
Normalized transition count is 65 out of 66 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 44 cols 228 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:11:28] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10792582398236447588.kers
Total runtime 0 ms.
[2026-05-25 19:11:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 19:11:28] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
[2026-05-25 19:11:28] [INFO ] Invariant cache hit.
[2026-05-25 19:11:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2026-05-25 19:11:28] [INFO ] Redundant transitions in 14 ms returned []
Running 61 sub problems to find dead transitions.
[2026-05-25 19:11:28] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
[2026-05-25 19:11:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 65/109 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 57 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 65/109 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 61/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 119 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2940ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2940ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/125 places, 75/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3035 ms. Remains : 44/125 places, 75/240 transitions.
[2026-05-25 19:11:31] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:31] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:31] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-25 19:11:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:11:31] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5265398324704989930.gal : 0 ms
[2026-05-25 19:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11732332783529269692.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5265398324704989930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11732332783529269692.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,139828,0.03624,5372,2,824,5,5830,6,0,235,5823,0


Converting to forward existential form...Done !
original formula: AG((!(A(!((((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71==1))&&((p76==1)&&(p83==1))))&&((p109==1)&&(p153==1)))||(p36=...215
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((p55==1)))))))) * !(E(!(!(E(TRUE U !((p55==1))))) U (!(!((((((((p18==1...388
(forward)formula 0,0,0.037094,5636,1,0,8,5830,9,2,246,5823,1
FORMULA HealthRecord-PT-07-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 175 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 64 transition count 129
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 64 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 110 place count 64 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 57 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 57 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 57 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 55 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 55 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 53 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 53 transition count 99
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 140 place count 53 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 147 place count 53 transition count 87
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 3 with 4 rules applied. Total rules applied 151 place count 51 transition count 85
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 47 transition count 81
Applied a total of 155 rules in 11 ms. Remains 47 /125 variables (removed 78) and now considering 81/240 (removed 159) transitions.
[2026-05-25 19:11:31] [INFO ] Flow matrix only has 71 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-3060545610003762999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16111417939377643815.kers'
[2026-05-25 19:11:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3060545610003762999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16111417939377643815.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 70 rows 46 cols 240 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 19:11:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16111417939377643815.kers
Total runtime 0 ms.
[2026-05-25 19:11:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 19:11:31] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2026-05-25 19:11:31] [INFO ] Invariant cache hit.
[2026-05-25 19:11:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-25 19:11:31] [INFO ] Redundant transitions in 13 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-25 19:11:31] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2026-05-25 19:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 70/117 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 59 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 70/117 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 67/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 126 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2946ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2946ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/125 places, 81/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3045 ms. Remains : 47/125 places, 81/240 transitions.
[2026-05-25 19:11:34] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:34] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-25 19:11:34] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2314034700647696966.gal : 1 ms
[2026-05-25 19:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3390637278786496022.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2314034700647696966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3390637278786496022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,181876,0.049793,5932,2,973,5,7862,6,0,250,8833,0


Converting to forward existential form...Done !
original formula: AG(((p117==0) + EG(A(((p63!=1)&&(p50!=1)) U (p48!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p117==0))) * !(EG(!((E(!((p48!=1)) U (!(((p63!=1)&&(p50!=1))) * !((p48!=1)))) + EG(!((p4...176
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t28...280
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.07375,51764,1,0,310,280459,186,170,1893,298046,327
FORMULA HealthRecord-PT-07-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-25 19:11:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:11:35] [INFO ] Flatten gal took : 5 ms
Total runtime 280552 ms.

BK_STOP 1779736295946

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-07"
export BK_EXAMINATION="CTLFireability"
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-07, examination is CTLFireability"
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-177961074300586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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