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-177961074300585.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300585
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-12
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-13
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-14
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779736011068

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202604301425
[2026-05-25 19:06:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:06:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:06:52] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2026-05-25 19:06:52] [INFO ] Transformed 155 places.
[2026-05-25 19:06:52] [INFO ] Transformed 320 transitions.
[2026-05-25 19:06:52] [INFO ] Found NUPN structural information;
[2026-05-25 19:06:52] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 118 transition count 226
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 118 transition count 226
Applied a total of 74 rules in 21 ms. Remains 118 /155 variables (removed 37) and now considering 226/295 (removed 69) transitions.
[2026-05-25 19:06:52] [INFO ] Flow matrix only has 219 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-11434466928221815633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17722436994434901320.kers'
[2026-05-25 19:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11434466928221815633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17722436994434901320.kers]
Normalized transition count is 218 out of 219 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 218 rows 114 cols 611 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-25 19:06:52] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17722436994434901320.kers
Total runtime 2 ms.
[2026-05-25 19:06:52] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-25 19:06:52] [INFO ] Flow matrix only has 219 transitions (discarded 7 similar events)
[2026-05-25 19:06:52] [INFO ] Invariant cache hit.
[2026-05-25 19:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:06:52] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-05-25 19:06:53] [INFO ] Flow matrix only has 219 transitions (discarded 7 similar events)
[2026-05-25 19:06:53] [INFO ] Invariant cache hit.
[2026-05-25 19:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 218/336 variables, 118/165 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 1/337 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 170 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 218/336 variables, 118/180 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 225/405 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 14/439 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/337 variables, and 439 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50349ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50362ms
Starting structural reductions in LTL mode, iteration 1 : 118/155 places, 226/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50833 ms. Remains : 118/155 places, 226/295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 19:07:43] [INFO ] Flow matrix only has 219 transitions (discarded 7 similar events)
[2026-05-25 19:07:43] [INFO ] Invariant cache hit.
[2026-05-25 19:07:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 19:07:43] [INFO ] Flow matrix only has 219 transitions (discarded 7 similar events)
[2026-05-25 19:07:43] [INFO ] Invariant cache hit.
[2026-05-25 19:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:07:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 118/118 places, 226/226 transitions.
Support contains 83 out of 118 places after structural reductions.
[2026-05-25 19:07:43] [INFO ] Flatten gal took : 41 ms
[2026-05-25 19:07:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 19:07:43] [INFO ] Input system was already deterministic with 226 transitions.
Support contains 74 out of 118 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (2117 resets) in 1258 ms. (31 steps per ms) remains 23/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 30 ms. (129 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (27 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (31 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
[2026-05-25 19:07:44] [INFO ] Flow matrix only has 219 transitions (discarded 7 similar events)
[2026-05-25 19:07:44] [INFO ] Invariant cache hit.
[2026-05-25 19:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 75/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 3/116 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 2/118 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 218/336 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1/337 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/337 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 132 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 75/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/30 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 6/36 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 7/43 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 11/54 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 3/116 variables, 1/55 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/57 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/59 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/61 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 2/118 variables, 2/63 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 218/336 variables, 118/181 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 19/200 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 2/202 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 1/337 variables, 1/203 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 203 constraints, problems are : Problem set: 2 solved, 19 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6139ms problems are : Problem set: 2 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 226/226 transitions.
Graph (trivial) has 116 edges and 118 vertex of which 10 / 118 are part of one of the 5 SCC in 7 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 478 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 107 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 107 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 102 transition count 201
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 45 place count 73 transition count 143
Iterating global reduction 2 with 29 rules applied. Total rules applied 74 place count 73 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 70 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 70 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 70 transition count 133
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 86 place count 69 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 64 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 64 transition count 164
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 118 place count 64 transition count 164
Applied a total of 118 rules in 61 ms. Remains 64 /118 variables (removed 54) and now considering 164/226 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 64/118 places, 164/226 transitions.
RANDOM walk for 40000 steps (6362 resets) in 754 ms. (52 steps per ms) remains 13/19 properties
BEST_FIRST walk for 40003 steps (1563 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1529 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1493 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1547 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1357 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1552 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1557 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1526 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1535 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1507 resets) in 38 ms. (1025 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1569 resets) in 39 ms. (1000 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1494 resets) in 39 ms. (1000 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1563 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
[2026-05-25 19:07:51] [INFO ] Flow matrix only has 159 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-799295071912611545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-812834662450839089.kers'
[2026-05-25 19:07:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-799295071912611545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-812834662450839089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 64 cols 688 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-25 19:07:51] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-812834662450839089.kers
Total runtime 1 ms.
[2026-05-25 19:07:51] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 40/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 159/223 variables, 64/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 101 constraints, problems are : Problem set: 0 solved, 13 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 40/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/64 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 159/223 variables, 64/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/223 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 136 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2590ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 11 properties in 468 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 164/164 transitions.
Graph (trivial) has 50 edges and 64 vertex of which 2 / 64 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.
Graph (complete) has 286 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 60 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 60 transition count 158
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 58 transition count 158
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 22 place count 46 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 46 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 46 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 44 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 44 transition count 127
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 43 place count 42 transition count 125
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 51 place count 38 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 37 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 37 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 36 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 36 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 60 place count 36 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 36 transition count 120
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 78 place count 36 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 36 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 35 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 35 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 34 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 34 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 33 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 33 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 90 place count 33 transition count 103
Applied a total of 90 rules in 40 ms. Remains 33 /64 variables (removed 31) and now considering 103/164 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 33/64 places, 103/164 transitions.
RANDOM walk for 40000 steps (12660 resets) in 338 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2179 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2174 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4362 steps, run visited all 2 properties in 24 ms. (steps per millisecond=181 )
Probabilistic random walk after 4362 steps, saw 1309 distinct states, run finished after 28 ms. (steps per millisecond=155 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 19:07:54] [INFO ] Flatten gal took : 22 ms
[2026-05-25 19:07:54] [INFO ] Flatten gal took : 18 ms
[2026-05-25 19:07:54] [INFO ] Input system was already deterministic with 226 transitions.
Computed a total of 9 stabilizing places and 14 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Graph (trivial) has 162 edges and 118 vertex of which 14 / 118 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 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 60 transition count 122
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 60 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 109 place count 52 transition count 106
Iterating global reduction 0 with 8 rules applied. Total rules applied 117 place count 52 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 126 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 47 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 47 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 47 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 45 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 43 transition count 70
Applied a total of 152 rules in 29 ms. Remains 43 /118 variables (removed 75) and now considering 70/226 (removed 156) transitions.
[2026-05-25 19:07:54] [INFO ] Flow matrix only has 61 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-10252552240337419463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5284930736544433703.kers'
[2026-05-25 19:07:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10252552240337419463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5284930736544433703.kers]
Normalized transition count is 60 out of 61 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 43 cols 206 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-25 19:07:54] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5284930736544433703.kers
Total runtime 0 ms.
[2026-05-25 19:07:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:07:54] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2026-05-25 19:07:54] [INFO ] Invariant cache hit.
[2026-05-25 19:07:54] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-25 19:07:54] [INFO ] Redundant transitions in 14 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-25 19:07:54] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2026-05-25 19:07:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/103 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 56/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 114 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3056ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3057ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/118 places, 70/226 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3207 ms. Remains : 43/118 places, 70/226 transitions.
[2026-05-25 19:07:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:07:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:07:57] [INFO ] Input system was already deterministic with 70 transitions.
[2026-05-25 19:07:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:07:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:07:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13670798851551163558.gal : 1 ms
[2026-05-25 19:07:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10204955094732722096.ctl : 4 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/CTLCardinality13670798851551163558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10204955094732722096.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,159796,0.041173,5104,2,528,5,5009,6,0,226,5854,0


Converting to forward existential form...Done !
original formula: AF(((p41==1) * AG(((p97!=0)&&(p71!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p41==1) * !(E(TRUE U !(((p97!=0)&&(p71!=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, t15, t16, t17, t27, t28, t36...270
(forward)formula 0,0,0.122698,8384,1,0,136,20017,157,60,1693,19207,145
FORMULA HealthRecord-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 120
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 116 place count 57 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 122 place count 57 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 128 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 149 place count 51 transition count 78
Applied a total of 149 rules in 5 ms. Remains 51 /118 variables (removed 67) and now considering 78/226 (removed 148) transitions.
[2026-05-25 19:07:58] [INFO ] Flow matrix only has 75 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-3154491920020549265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2786134753870571067.kers'
[2026-05-25 19:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3154491920020549265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2786134753870571067.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 51 cols 251 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:07:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2786134753870571067.kers
Total runtime 1 ms.
[2026-05-25 19:07:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 19:07:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:07:58] [INFO ] Invariant cache hit.
[2026-05-25 19:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:07:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-25 19:07:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:07:58] [INFO ] Invariant cache hit.
[2026-05-25 19:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/125 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6442ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 6443ms
Starting structural reductions in LTL mode, iteration 1 : 51/118 places, 78/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6549 ms. Remains : 51/118 places, 78/226 transitions.
[2026-05-25 19:08:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:08:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:08:04] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-25 19:08:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:08:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12332800415367362270.gal : 1 ms
[2026-05-25 19:08:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality1792793151858234721.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/CTLCardinality12332800415367362270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1792793151858234721.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,576648,0.026254,5012,2,624,5,4548,6,0,278,4207,0


Converting to forward existential form...Done !
original formula: AG((AX((p113==1)) + EX(TRUE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(TRUE)))) * !((p113==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t18, t20, t22, Intersecti...242
(forward)formula 0,1,0.094687,8296,1,0,133,18451,169,67,1891,14489,160
FORMULA HealthRecord-PT-07-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Graph (trivial) has 164 edges and 118 vertex of which 14 / 118 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 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 60 transition count 122
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 60 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 109 place count 52 transition count 106
Iterating global reduction 0 with 8 rules applied. Total rules applied 117 place count 52 transition count 106
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 127 place count 52 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 50 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 48 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 48 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 48 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 48 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 46 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 44 transition count 72
Applied a total of 151 rules in 15 ms. Remains 44 /118 variables (removed 74) and now considering 72/226 (removed 154) transitions.
[2026-05-25 19:08:04] [INFO ] Flow matrix only has 63 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-1800221034918081237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12766162062657309408.kers'
[2026-05-25 19:08:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1800221034918081237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12766162062657309408.kers]
Normalized transition count is 62 out of 63 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 44 cols 214 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:08:04] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12766162062657309408.kers
Total runtime 0 ms.
[2026-05-25 19:08:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:08:04] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2026-05-25 19:08:04] [INFO ] Invariant cache hit.
[2026-05-25 19:08:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2026-05-25 19:08:04] [INFO ] Redundant transitions in 13 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-25 19:08:04] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2026-05-25 19:08:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 62/106 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 57 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 62/106 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 117 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2879ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2879ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/118 places, 72/226 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2992 ms. Remains : 44/118 places, 72/226 transitions.
[2026-05-25 19:08:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:08:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:08:07] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-25 19:08:07] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:08:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:08:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4828056738985956719.gal : 1 ms
[2026-05-25 19:08:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5770639349923969892.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4828056738985956719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5770639349923969892.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (4023 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality5770639349923969892.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 144
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :144 after 176
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :176 after 352
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :352 after 2896
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2896 after 16256
BEST_FIRST walk for 40004 steps (654 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Invariant property HealthRecord-PT-07-CTLCardinality-2024-03 does not hold.
FORMULA HealthRecord-PT-07-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Finished probabilistic random walk after 13136 steps, run visited all 1 properties in 19 ms. (steps per millisecond=691 )
Probabilistic random walk after 13136 steps, saw 2764 distinct states, run finished after 20 ms. (steps per millisecond=656 ) properties seen :1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,143712,0.044826,5220,2,512,13,5784,6,0,233,5412,0
Total reachable state count : 143712

Verifying 1 reachability properties.
Invariant property HealthRecord-PT-07-CTLCardinality-2024-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-07-CTLCardinality-2024-03,1,0.045927,5356,2,45,13,5784,7,0,239,5412,0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 127
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 60 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 116 place count 60 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 123 place count 60 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 57 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 57 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 54 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 54 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 144 place count 54 transition count 82
Applied a total of 144 rules in 7 ms. Remains 54 /118 variables (removed 64) and now considering 82/226 (removed 144) transitions.
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 78 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-1810638427592315055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17488819284573887668.kers'
[2026-05-25 19:08:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1810638427592315055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17488819284573887668.kers]
Normalized transition count is 77 out of 78 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 53 cols 253 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 19:08:07] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17488819284573887668.kers
Total runtime 1 ms.
[2026-05-25 19:08:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2026-05-25 19:08:07] [INFO ] Invariant cache hit.
[2026-05-25 19:08:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2026-05-25 19:08:07] [INFO ] Invariant cache hit.
[2026-05-25 19:08:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/131 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 72 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 7/7 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/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/131 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 81/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7626ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7626ms
Starting structural reductions in LTL mode, iteration 1 : 54/118 places, 82/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7723 ms. Remains : 54/118 places, 82/226 transitions.
[2026-05-25 19:08:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:08:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:08:15] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-25 19:08:15] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:08:15] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:08:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality7762862287358474698.gal : 1 ms
[2026-05-25 19:08:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality314344300393682156.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/CTLCardinality7762862287358474698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality314344300393682156.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 -...282
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,810901,0.195293,12712,2,3096,5,41730,6,0,291,29623,0


Converting to forward existential form...Done !
original formula: (AG(AX(!(E(AX(((p37==0)||(p4==1))) U !(((p66==0)||(p21==1))))))) + (EG(EX(TRUE)) * EG((((p41==0)&&(p106==0))||(p100==0)))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU((Init * !((EG(EX(TRUE)) * EG((((p41==0)&&(p106==0))||(p100==0)))))),TRUE)),!(EX(!(((p37==0)||(p4=...199
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t21, t22, t23, t24, t37, t...312
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.16967,164920,1,0,339,981298,195,176,2111,940127,380
FORMULA HealthRecord-PT-07-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Graph (trivial) has 155 edges and 118 vertex of which 10 / 118 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 62 transition count 123
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 62 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 110 place count 55 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 117 place count 55 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 126 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 52 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 52 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 135 place count 49 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 138 place count 49 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 145 place count 49 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 49 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 47 transition count 73
Applied a total of 152 rules in 18 ms. Remains 47 /118 variables (removed 71) and now considering 73/226 (removed 153) transitions.
[2026-05-25 19:08:20] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6711464316443794253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5409322549473377835.kers'
[2026-05-25 19:08:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6711464316443794253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5409322549473377835.kers]
Normalized transition count is 64 out of 65 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 47 cols 227 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-25 19:08:20] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5409322549473377835.kers
Total runtime 5 ms.
[2026-05-25 19:08:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:08:20] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-05-25 19:08:20] [INFO ] Invariant cache hit.
[2026-05-25 19:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-25 19:08:20] [INFO ] Redundant transitions in 12 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-25 19:08:20] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-05-25 19:08:20] [INFO ] Invariant cache hit.
[2026-05-25 19:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 64/111 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 59 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1817 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 64/111 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 72/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 133 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5995ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5995ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/118 places, 73/226 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6123 ms. Remains : 47/118 places, 73/226 transitions.
[2026-05-25 19:08:26] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:08:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:26] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-25 19:08:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality291101565652819540.gal : 0 ms
[2026-05-25 19:08:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality4943842234571459600.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/CTLCardinality291101565652819540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4943842234571459600.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 -...282
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,212768,0.035652,5228,2,559,5,5534,6,0,252,5480,0


Converting to forward existential form...Done !
original formula: AF((EF(((p145!=0)&&(p51!=1))) * EF((((p62==1)&&((p49==0)||(p104==1)))||(p142!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p145!=0)&&(p51!=1))) * E(TRUE U (((p62==1)&&((p49==0)||(p104==1)))||(p142!=1))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t10, t11, t12, t14, t15, t17, t26, t27, t28, t29, Inters...246
(forward)formula 0,1,0.163876,10892,1,0,140,38342,165,71,1791,27638,174
FORMULA HealthRecord-PT-07-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Graph (trivial) has 151 edges and 118 vertex of which 14 / 118 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.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 66 transition count 133
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 66 transition count 133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 96 place count 61 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 101 place count 61 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 108 place count 61 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 60 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 59 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 59 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 59 transition count 104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 56 transition count 101
Applied a total of 125 rules in 18 ms. Remains 56 /118 variables (removed 62) and now considering 101/226 (removed 125) transitions.
[2026-05-25 19:08:27] [INFO ] Flow matrix only has 92 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-15443333676146702967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5518299372434951795.kers'
[2026-05-25 19:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15443333676146702967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5518299372434951795.kers]
Normalized transition count is 91 out of 92 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 56 cols 307 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 19:08:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5518299372434951795.kers
Total runtime 0 ms.
[2026-05-25 19:08:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:08:27] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
[2026-05-25 19:08:27] [INFO ] Invariant cache hit.
[2026-05-25 19:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-25 19:08:27] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-25 19:08:27] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
[2026-05-25 19:08:27] [INFO ] Invariant cache hit.
[2026-05-25 19:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 91/147 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/148 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 72 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4539 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 91/147 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 100/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 176 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8401 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12952ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12953ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/118 places, 101/226 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13067 ms. Remains : 56/118 places, 101/226 transitions.
[2026-05-25 19:08:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:08:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:08:40] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-25 19:08:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3105316973424698326.gal : 2 ms
[2026-05-25 19:08:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12666576292999905799.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/CTLCardinality3105316973424698326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12666576292999905799.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,596021,0.259838,14712,2,3246,5,38608,6,0,315,62777,0


Converting to forward existential form...Done !
original formula: (EF(!(A(A(((p72==0)||(p80==1)) U (p28==1)) U E((p32==1) U ((p4==0)||(p51==1)))))) * AF(E(((p89==0)||(p72==1)) U !(E((p93==0) U (p116==1))...159
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(!((E(!(E((p32==1) U ((p4==0)||(p51==1)))) U (!(!((E(!((p28==1)) U (!(((p72==0)||(p80==1))...372
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, t18, t19, t20...426
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.25935,214904,1,0,516,1.09624e+06,248,251,2428,1.41455e+06,547
FORMULA HealthRecord-PT-07-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 120
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 56 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 56 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 133 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 53 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 50 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 154 place count 50 transition count 73
Applied a total of 154 rules in 3 ms. Remains 50 /118 variables (removed 68) and now considering 73/226 (removed 153) transitions.
[2026-05-25 19:08:46] [INFO ] Flow matrix only has 70 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-16712711384999502615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-532318773895418434.kers'
[2026-05-25 19:08:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16712711384999502615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-532318773895418434.kers]
Normalized transition count is 69 out of 70 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 50 cols 233 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:08:46] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-532318773895418434.kers
Total runtime 0 ms.
[2026-05-25 19:08:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 19:08:46] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2026-05-25 19:08:46] [INFO ] Invariant cache hit.
[2026-05-25 19:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2026-05-25 19:08:46] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2026-05-25 19:08:46] [INFO ] Invariant cache hit.
[2026-05-25 19:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/119 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 62 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 69/119 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 72/137 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 138 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5759ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5759ms
Starting structural reductions in LTL mode, iteration 1 : 50/118 places, 73/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5859 ms. Remains : 50/118 places, 73/226 transitions.
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:08:52] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:08:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:08:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7004907742706057675.gal : 0 ms
[2026-05-25 19:08:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16264499866421863736.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/CTLCardinality7004907742706057675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16264499866421863736.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,484795,0.11042,9572,2,2146,5,26784,6,0,269,16821,0


Converting to forward existential form...Done !
original formula: AX(E(EX(TRUE) U (p146==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(TRUE) U (p146==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t17, t19, t21, Intersection with r...233
(forward)formula 0,1,0.791776,34496,1,0,259,188995,161,208,1872,135575,341
FORMULA HealthRecord-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 65 transition count 124
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 65 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 58 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 58 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 129 place count 58 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 57 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 56 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 56 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 56 transition count 93
Applied a total of 136 rules in 8 ms. Remains 56 /118 variables (removed 62) and now considering 93/226 (removed 133) transitions.
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14050132180728759341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2210509493855924384.kers'
[2026-05-25 19:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14050132180728759341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2210509493855924384.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 56 cols 301 entries
Finished phase 1 with 47 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-2210509493855924384.kers
Total runtime 1 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 90 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 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 90 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 89/145 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/146 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 69 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2929 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/145 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 165 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6566 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9505ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 9505ms
Starting structural reductions in LTL mode, iteration 1 : 56/118 places, 93/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 56/118 places, 93/226 transitions.
[2026-05-25 19:09:02] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:09:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:02] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 19:09:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12787974261465214897.gal : 1 ms
[2026-05-25 19:09:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3260801334359764608.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/CTLCardinality12787974261465214897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3260801334359764608.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.01113e+06,0.06566,6896,2,1192,5,11804,6,0,313,13538,0


Converting to forward existential form...Done !
original formula: AG((AX(EF((p28==0))) + (EF(((p25==0)&&(p135==1))) * (p33==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(TRUE U ((p25==0)&&(p135==1))) * (p33==1))))) * !(E(TRUE U (p28==0))))] = 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, t17, t18, t19, t21, t23, t...307
(forward)formula 0,1,0.268929,14664,1,0,163,51617,203,75,2233,42799,195
FORMULA HealthRecord-PT-07-CTLCardinality-2024-08 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 : 118/118 places, 226/226 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 72 transition count 137
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 72 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 67 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 67 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 67 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 65 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 65 transition count 116
Applied a total of 111 rules in 2 ms. Remains 65 /118 variables (removed 53) and now considering 116/226 (removed 110) transitions.
[2026-05-25 19:09:03] [INFO ] Flow matrix only has 112 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-6161018122847170267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2846210706104540473.kers'
[2026-05-25 19:09:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6161018122847170267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2846210706104540473.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 64 cols 359 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-25 19:09:03] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2846210706104540473.kers
Total runtime 0 ms.
[2026-05-25 19:09:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 19:09:03] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2026-05-25 19:09:03] [INFO ] Invariant cache hit.
[2026-05-25 19:09:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:03] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-25 19:09:03] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2026-05-25 19:09:03] [INFO ] Invariant cache hit.
[2026-05-25 19:09:03] [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, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 111/176 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/177 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 84 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4612 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: 115/115 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 111/176 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 115/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/177 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 199 constraints, problems are : Problem set: 0 solved, 115 unsolved in 9375 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: 115/115 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14007ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 14007ms
Starting structural reductions in LTL mode, iteration 1 : 65/118 places, 116/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14107 ms. Remains : 65/118 places, 116/226 transitions.
[2026-05-25 19:09:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:17] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-25 19:09:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:09:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11976900668922505575.gal : 1 ms
[2026-05-25 19:09:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16836048627483699559.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/CTLCardinality11976900668922505575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16836048627483699559.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.96672e+06,0.156921,10564,2,1517,5,24935,6,0,369,34498,0


Converting to forward existential form...Done !
original formula: E(AG(EX(((((p129==0)||(p51==1))&&((p23==0)||(p152==1)))||((p13==1)&&(p30==1))))) U !((E(!(AX((p40==0))) U ((AG(((p5==0)||(p84==1))) + (p1...207
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(E(TRUE U !(EX(((((p129==0)||(p51==1))&&((p23==0)||(p152==1)))||((p13==1)&&(p30==1)))))))) * ...293
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...432
(forward)formula 0,0,1.44981,54480,1,0,314,313827,263,139,2637,223689,352
FORMULA HealthRecord-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 120
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 56 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 56 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 54 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 52 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 146 place count 52 transition count 82
Applied a total of 146 rules in 7 ms. Remains 52 /118 variables (removed 66) and now considering 82/226 (removed 144) transitions.
[2026-05-25 19:09:18] [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-13859934036617043950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14823222894737930557.kers'
[2026-05-25 19:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13859934036617043950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14823222894737930557.kers]
Normalized transition count is 78 out of 79 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 52 cols 267 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:09:18] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14823222894737930557.kers
Total runtime 1 ms.
[2026-05-25 19:09:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:09:18] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:09:18] [INFO ] Invariant cache hit.
[2026-05-25 19:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:18] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-25 19:09:18] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2026-05-25 19:09:18] [INFO ] Invariant cache hit.
[2026-05-25 19:09:18] [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, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/130 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/130 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4393 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6559ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6559ms
Starting structural reductions in LTL mode, iteration 1 : 52/118 places, 82/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6661 ms. Remains : 52/118 places, 82/226 transitions.
[2026-05-25 19:09:25] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:09:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:25] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-25 19:09:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality18402656844557094733.gal : 1 ms
[2026-05-25 19:09:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11438290433009981788.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/CTLCardinality18402656844557094733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11438290433009981788.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,713700,0.047459,5656,2,920,5,7347,6,0,286,6717,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * EX(EX(((p24==0)||(p135==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(FwdU(Init,TRUE) * !(EX(EX(((p24==0)||(p135==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, t22, t37, t38, ...252
(forward)formula 0,0,0.170013,10528,1,0,141,32039,176,70,1959,27269,171
FORMULA HealthRecord-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 69 transition count 131
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 69 transition count 131
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 63 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 63 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 118 place count 63 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 108
Applied a total of 120 rules in 4 ms. Remains 62 /118 variables (removed 56) and now considering 108/226 (removed 118) transitions.
[2026-05-25 19:09:25] [INFO ] Flow matrix only has 104 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-10455626464612209412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7717570020977824889.kers'
[2026-05-25 19:09:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10455626464612209412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7717570020977824889.kers]
Normalized transition count is 103 out of 104 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 103 rows 61 cols 341 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 19:09:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7717570020977824889.kers
Total runtime 1 ms.
[2026-05-25 19:09:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 19:09:25] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2026-05-25 19:09:25] [INFO ] Invariant cache hit.
[2026-05-25 19:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-25 19:09:25] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2026-05-25 19:09:25] [INFO ] Invariant cache hit.
[2026-05-25 19:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/165 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 78 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3560 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 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/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/165 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 107/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/166 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 190 constraints, problems are : Problem set: 0 solved, 107 unsolved in 10912 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14490ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 14490ms
Starting structural reductions in LTL mode, iteration 1 : 62/118 places, 108/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14594 ms. Remains : 62/118 places, 108/226 transitions.
[2026-05-25 19:09:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:40] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-25 19:09:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:09:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1399147463114865654.gal : 0 ms
[2026-05-25 19:09:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12616762184584461113.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/CTLCardinality1399147463114865654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12616762184584461113.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.85604e+06,0.076877,7064,2,1217,5,11543,6,0,349,15254,0


Converting to forward existential form...Done !
original formula: AX(((E(AF(((A((p9==0) U (p33==1)) + (p10==0)) + (p147==1))) U AF(EX((p126==1)))) + AG((AX((p82==1)) + AX(((p100==0)||(p40==1)))))) + A(!(...198
=> equivalent forward existential formula: [(EY((FwdU(((EY(Init) * !(!((E(!(EX((p96==1))) U (!(!(!(E(TRUE U !(((p43==0)||(p55==1))))))) * !(EX((p96==1)))))...389
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...418
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.72816,193636,1,0,1023,1.15953e+06,268,602,2659,1.20639e+06,1036
FORMULA HealthRecord-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 120
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 56 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 56 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 133 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 51 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 51 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 149 place count 51 transition count 78
Applied a total of 149 rules in 2 ms. Remains 51 /118 variables (removed 67) and now considering 78/226 (removed 148) transitions.
[2026-05-25 19:09:46] [INFO ] Flow matrix only has 75 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-863905542765404985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12419719732593303026.kers'
[2026-05-25 19:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-863905542765404985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12419719732593303026.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 51 cols 251 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:09:46] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12419719732593303026.kers
Total runtime 1 ms.
[2026-05-25 19:09:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 19:09:46] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:09:46] [INFO ] Invariant cache hit.
[2026-05-25 19:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-25 19:09:46] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:09:46] [INFO ] Invariant cache hit.
[2026-05-25 19:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/125 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 74/125 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4814 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6686ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 6686ms
Starting structural reductions in LTL mode, iteration 1 : 51/118 places, 78/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6811 ms. Remains : 51/118 places, 78/226 transitions.
[2026-05-25 19:09:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:09:52] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-25 19:09:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:09:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:09:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2968779477456215522.gal : 0 ms
[2026-05-25 19:09:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9033605861538549562.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/CTLCardinality2968779477456215522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9033605861538549562.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,653193,0.288828,16376,2,4272,5,61497,6,0,278,38439,0


Converting to forward existential form...Done !
original formula: (AG(EF((p107==1))) + AF(EG(EX((p94==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(E(TRUE U (p107==1))))))),!(EG(EX((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, t48, t...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.08392,162580,1,0,310,871107,186,184,2091,800707,334
FORMULA HealthRecord-PT-07-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 65 transition count 124
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 65 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 58 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 58 transition count 110
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 128 place count 58 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 55 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 55 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 52 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 52 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 149 place count 52 transition count 78
Applied a total of 149 rules in 2 ms. Remains 52 /118 variables (removed 66) and now considering 78/226 (removed 148) transitions.
[2026-05-25 19:09:57] [INFO ] Flow matrix only has 75 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-5420216196064774128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4199821926872519424.kers'
[2026-05-25 19:09:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5420216196064774128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4199821926872519424.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 52 cols 245 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:09:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4199821926872519424.kers
Total runtime 1 ms.
[2026-05-25 19:09:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:09:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:09:58] [INFO ] Invariant cache hit.
[2026-05-25 19:09:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-25 19:09:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-25 19:09:58] [INFO ] Invariant cache hit.
[2026-05-25 19:09:58] [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, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/126 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/126 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 77/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 146 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4877 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6787ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 6788ms
Starting structural reductions in LTL mode, iteration 1 : 52/118 places, 78/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6900 ms. Remains : 52/118 places, 78/226 transitions.
[2026-05-25 19:10:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:04] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:10:04] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-25 19:10:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:04] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:10:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality16737053686327051953.gal : 0 ms
[2026-05-25 19:10:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality217277099780225413.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/CTLCardinality16737053686327051953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality217277099780225413.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,808470,0.053513,6396,2,1074,5,10939,6,0,282,11086,0


Converting to forward existential form...Done !
original formula: AX(EF(((p109==1) * EG((((p57==0)&&(p34==1))||(p35==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((p109==1) * EG((((p57==0)&&(p34==1))||(p35==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t35, t36, t37, t38, t...272
(forward)formula 0,1,0.345548,18584,1,0,180,79932,180,86,1999,66235,218
FORMULA HealthRecord-PT-07-CTLCardinality-2024-13 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 : 118/118 places, 226/226 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 66 transition count 126
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 66 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 109 place count 61 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 114 place count 61 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 61 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 60 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 60 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 59 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 59 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 59 transition count 103
Applied a total of 126 rules in 6 ms. Remains 59 /118 variables (removed 59) and now considering 103/226 (removed 123) transitions.
[2026-05-25 19:10:05] [INFO ] Flow matrix only has 100 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-6049735272866085974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8588616681668344069.kers'
[2026-05-25 19:10:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6049735272866085974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8588616681668344069.kers]
Normalized transition count is 99 out of 100 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 59 cols 333 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 19:10:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8588616681668344069.kers
Total runtime 0 ms.
[2026-05-25 19:10:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:10:05] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2026-05-25 19:10:05] [INFO ] Invariant cache hit.
[2026-05-25 19:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:10:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 19:10:05] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2026-05-25 19:10:05] [INFO ] Invariant cache hit.
[2026-05-25 19:10:05] [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, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 99/158 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 74 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3483 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 5/5 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/158 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 102/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 179 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7763 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11265ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11265ms
Starting structural reductions in LTL mode, iteration 1 : 59/118 places, 103/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11397 ms. Remains : 59/118 places, 103/226 transitions.
[2026-05-25 19:10:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:10:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:10:16] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 19:10:16] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:16] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5064837750615940794.gal : 0 ms
[2026-05-25 19:10:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16964261003016399044.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/CTLCardinality5064837750615940794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16964261003016399044.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.27552e+06,0.062999,6828,2,912,5,10751,6,0,335,12350,0


Converting to forward existential form...Done !
original formula: AX(EF(!(A(!(((p127==0)||(p8==1))) U (((p125==0)||(p50==1))||(p87==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!((E(!((((p125==0)||(p50==1))||(p87==1))) U (!(!(((p127==0)||(p8==1)))) * !((((p125==0...239
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...338
(forward)formula 0,1,0.300737,15400,1,0,222,59719,233,102,2463,43898,266
FORMULA HealthRecord-PT-07-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 226/226 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 128
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 63 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 63 transition count 120
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 63 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 61 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 61 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 59 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 59 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 127 place count 59 transition count 101
Applied a total of 127 rules in 2 ms. Remains 59 /118 variables (removed 59) and now considering 101/226 (removed 125) transitions.
[2026-05-25 19:10:17] [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-3545602613384519482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8325472116629099869.kers'
[2026-05-25 19:10:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3545602613384519482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8325472116629099869.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 59 cols 321 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 19:10:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8325472116629099869.kers
Total runtime 1 ms.
[2026-05-25 19:10:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 19:10:17] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:10:17] [INFO ] Invariant cache hit.
[2026-05-25 19:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:10:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-25 19:10:17] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2026-05-25 19:10:17] [INFO ] Invariant cache hit.
[2026-05-25 19:10:17] [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, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 97/156 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 73 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3937 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: 4/4 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, 4/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/156 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 100/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 176 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7896 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: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11867ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11868ms
Starting structural reductions in LTL mode, iteration 1 : 59/118 places, 101/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12003 ms. Remains : 59/118 places, 101/226 transitions.
[2026-05-25 19:10:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:29] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-25 19:10:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:10:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15087104660320261749.gal : 1 ms
[2026-05-25 19:10:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality14458719018192646249.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/CTLCardinality15087104660320261749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14458719018192646249.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,983431,0.036651,5464,2,804,5,5540,6,0,333,5766,0


Converting to forward existential form...Done !
original formula: AG(AX(EX((((AG(((p18==0)||(p95==1))) + EF((p91==0))) + ((p117==0)||(p115==1))) + (p103==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX((((!(E(TRUE U !(((p18==0)||(p95==1))))) + E(TRUE U (p91==0))) + ((p117==0)||(p115==...184
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...338
(forward)formula 0,0,0.230986,13604,1,0,214,50543,223,99,2413,41327,242
FORMULA HealthRecord-PT-07-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 19:10:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:10:29] [INFO ] Flatten gal took : 4 ms
Total runtime 217011 ms.

BK_STOP 1779736229395

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-177961074300585"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;