fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r100-smll-174867008200596
Last Updated
June 24, 2025

About the Execution of ITS-Tools for HealthRecord-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 313200.00 0.00 0.00 FTFFFFFFFFTFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200596.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HealthRecord-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 68K May 29 14:32 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-08-LTLFireability-00
FORMULA_NAME HealthRecord-PT-08-LTLFireability-01
FORMULA_NAME HealthRecord-PT-08-LTLFireability-02
FORMULA_NAME HealthRecord-PT-08-LTLFireability-03
FORMULA_NAME HealthRecord-PT-08-LTLFireability-04
FORMULA_NAME HealthRecord-PT-08-LTLFireability-05
FORMULA_NAME HealthRecord-PT-08-LTLFireability-06
FORMULA_NAME HealthRecord-PT-08-LTLFireability-07
FORMULA_NAME HealthRecord-PT-08-LTLFireability-08
FORMULA_NAME HealthRecord-PT-08-LTLFireability-09
FORMULA_NAME HealthRecord-PT-08-LTLFireability-10
FORMULA_NAME HealthRecord-PT-08-LTLFireability-11
FORMULA_NAME HealthRecord-PT-08-LTLFireability-12
FORMULA_NAME HealthRecord-PT-08-LTLFireability-13
FORMULA_NAME HealthRecord-PT-08-LTLFireability-14
FORMULA_NAME HealthRecord-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749000377138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 01:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:26:19] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2025-06-04 01:26:19] [INFO ] Transformed 156 places.
[2025-06-04 01:26:19] [INFO ] Transformed 326 transitions.
[2025-06-04 01:26:19] [INFO ] Found NUPN structural information;
[2025-06-04 01:26:19] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 300/300 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 88 transition count 171
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 88 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 140 place count 84 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 144 place count 84 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 148 place count 84 transition count 159
Applied a total of 148 rules in 83 ms. Remains 84 /156 variables (removed 72) and now considering 159/300 (removed 141) transitions.
[2025-06-04 01:26:20] [INFO ] Flow matrix only has 154 transitions (discarded 5 similar events)
// Phase 1: matrix 154 rows 84 cols
[2025-06-04 01:26:20] [INFO ] Computed 11 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:26:20] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-04 01:26:20] [INFO ] Flow matrix only has 154 transitions (discarded 5 similar events)
[2025-06-04 01:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:26:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:26:20] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2025-06-04 01:26:20] [INFO ] Flow matrix only has 154 transitions (discarded 5 similar events)
[2025-06-04 01:26:20] [INFO ] Invariant cache hit.
[2025-06-04 01:26:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:23] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:23] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:24] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:24] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:24] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:24] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:25] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:25] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:25] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:25] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:27] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:28] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:28] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:29] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 153/237 variables, 84/116 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:32] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:35] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 14 (OVERLAPS) 1/238 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 0/238 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 120 constraints, problems are : Problem set: 0 solved, 158 unsolved in 23724 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:46] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:26:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 153/237 variables, 84/121 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 158/279 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 280 constraints, problems are : Problem set: 0 solved, 158 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53977ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 54008ms
Starting structural reductions in LTL mode, iteration 1 : 84/156 places, 159/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54851 ms. Remains : 84/156 places, 159/300 transitions.
Support contains 33 out of 84 places after structural reductions.
[2025-06-04 01:27:15] [INFO ] Flatten gal took : 61 ms
[2025-06-04 01:27:15] [INFO ] Flatten gal took : 28 ms
[2025-06-04 01:27:15] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 32 out of 84 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (2236 resets) in 2986 ms. (13 steps per ms) remains 18/35 properties
BEST_FIRST walk for 4004 steps (29 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (29 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (26 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (29 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
[2025-06-04 01:27:16] [INFO ] Flow matrix only has 154 transitions (discarded 5 similar events)
[2025-06-04 01:27:16] [INFO ] Invariant cache hit.
[2025-06-04 01:27:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/84 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:16] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:16] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:17] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:18] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:18] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:18] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/28 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 153/237 variables, 84/112 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:19] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/238 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 114 constraints, problems are : Problem set: 1 solved, 16 unsolved in 3383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 33/49 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 35/84 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 15/29 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:20] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:20] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:20] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:20] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 4/33 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 153/237 variables, 84/117 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 16/133 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:21] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:21] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:21] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 1/238 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/238 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 137 constraints, problems are : Problem set: 1 solved, 16 unsolved in 3577 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6970ms problems are : Problem set: 1 solved, 16 unsolved
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 15 properties in 1407 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 106 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 331 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 76 transition count 138
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 8 rules applied. Total rules applied 13 place count 73 transition count 133
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 71 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 71 transition count 129
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 3 with 8 rules applied. Total rules applied 24 place count 66 transition count 129
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 46 place count 44 transition count 85
Iterating global reduction 3 with 22 rules applied. Total rules applied 68 place count 44 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 44 transition count 83
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 75 place count 39 transition count 71
Iterating global reduction 4 with 5 rules applied. Total rules applied 80 place count 39 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 39 transition count 68
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 86 place count 36 transition count 61
Iterating global reduction 5 with 3 rules applied. Total rules applied 89 place count 36 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 95 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 35 transition count 53
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 35 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 100 place count 35 transition count 50
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 7 with 2 rules applied. Total rules applied 102 place count 34 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 112 place count 29 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 29 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 115 place count 29 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 117 place count 27 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 119 place count 27 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 120 place count 27 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 122 place count 26 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 125 place count 26 transition count 121
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 126 place count 25 transition count 94
Iterating global reduction 9 with 1 rules applied. Total rules applied 127 place count 25 transition count 94
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 24 transition count 91
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 24 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 139 place count 24 transition count 81
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 147 place count 24 transition count 81
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 154 place count 24 transition count 81
Applied a total of 154 rules in 92 ms. Remains 24 /84 variables (removed 60) and now considering 81/159 (removed 78) transitions.
Running 65 sub problems to find dead transitions.
[2025-06-04 01:27:24] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 24 cols
[2025-06-04 01:27:24] [INFO ] Computed 7 invariants in 6 ms
[2025-06-04 01:27:24] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/93 variables, 24/31 constraints. Problems are: Problem set: 8 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 20/51 constraints. Problems are: Problem set: 8 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 52 constraints, problems are : Problem set: 9 solved, 56 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 69/93 variables, 24/32 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 20/52 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 54/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 106 constraints, problems are : Problem set: 11 solved, 54 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6071ms problems are : Problem set: 11 solved, 54 unsolved
Search for dead transitions found 11 dead transitions in 6072ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/84 places, 70/159 transitions.
Graph (complete) has 88 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6173 ms. Remains : 23/84 places, 70/159 transitions.
RANDOM walk for 40000 steps (9211 resets) in 758 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1193 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 630 steps, run visited all 1 properties in 18 ms. (steps per millisecond=35 )
Probabilistic random walk after 630 steps, saw 255 distinct states, run finished after 25 ms. (steps per millisecond=25 ) properties seen :1
FORMULA HealthRecord-PT-08-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 8 stabilizing places and 13 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0&&X(X(p1))))&&F(p2)))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 59 transition count 111
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 59 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 59 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 55 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 55 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 53 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 53 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 53 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 52 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 52 transition count 85
Applied a total of 74 rules in 15 ms. Remains 52 /84 variables (removed 32) and now considering 85/159 (removed 74) transitions.
[2025-06-04 01:27:32] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 52 cols
[2025-06-04 01:27:32] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:27:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:27:32] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:27:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:27:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:27:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 01:27:32] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:27:32] [INFO ] Invariant cache hit.
[2025-06-04 01:27:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:33] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:37] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:38] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:38] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:38] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 81/133 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 84/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 153 constraints, problems are : Problem set: 0 solved, 84 unsolved in 10183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15109ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 15110ms
Starting structural reductions in LTL mode, iteration 1 : 52/84 places, 85/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15328 ms. Remains : 52/84 places, 85/159 transitions.
Stuttering acceptance computed with spot in 884 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 4 ms.
FORMULA HealthRecord-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-00 finished in 16351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 58 transition count 109
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 58 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 58 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 53 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 53 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 53 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 50 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 50 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 79 place count 50 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 49 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 49 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 49 transition count 74
Applied a total of 84 rules in 16 ms. Remains 49 /84 variables (removed 35) and now considering 74/159 (removed 85) transitions.
[2025-06-04 01:27:48] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
// Phase 1: matrix 71 rows 49 cols
[2025-06-04 01:27:48] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:27:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:27:48] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2025-06-04 01:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:27:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:27:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-04 01:27:48] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2025-06-04 01:27:48] [INFO ] Invariant cache hit.
[2025-06-04 01:27:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:49] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 70/119 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:51] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 62 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:53] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:27:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 70/119 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 73/136 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 137 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7574 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12447ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 12449ms
Starting structural reductions in LTL mode, iteration 1 : 49/84 places, 74/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12670 ms. Remains : 49/84 places, 74/159 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 27 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-08-LTLFireability-01 finished in 13620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 105 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 53 transition count 106
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 53 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 51 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 48 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 48 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 48 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 46 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 46 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 46 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 45 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 81 place count 43 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 43 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 42 transition count 92
Applied a total of 85 rules in 34 ms. Remains 42 /84 variables (removed 42) and now considering 92/159 (removed 67) transitions.
[2025-06-04 01:28:01] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
// Phase 1: matrix 81 rows 42 cols
[2025-06-04 01:28:01] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-04 01:28:01] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
[2025-06-04 01:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-04 01:28:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:28:02] [INFO ] Redundant transitions in 29 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-04 01:28:02] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
[2025-06-04 01:28:02] [INFO ] Invariant cache hit.
[2025-06-04 01:28:02] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 80/122 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/123 variables, and 70 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3468 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 80/122 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 76/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8797ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 8798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/84 places, 92/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9008 ms. Remains : 42/84 places, 92/159 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 2 reset in 177 ms.
Computed a total of 15 stabilizing places and 32 stable transitions
Computed a total of 15 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3802 resets) in 482 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (503 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17683 steps, run visited all 1 properties in 69 ms. (steps per millisecond=256 )
Probabilistic random walk after 17683 steps, saw 3308 distinct states, run finished after 69 ms. (steps per millisecond=256 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 42 /42 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2025-06-04 01:28:12] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
[2025-06-04 01:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 01:28:12] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
[2025-06-04 01:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-04 01:28:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:28:12] [INFO ] Redundant transitions in 38 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-04 01:28:12] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
[2025-06-04 01:28:12] [INFO ] Invariant cache hit.
[2025-06-04 01:28:12] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 80/122 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/123 variables, and 70 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 80/122 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 76/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5920 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8879ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 8880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9107 ms. Remains : 42/42 places, 92/92 transitions.
Computed a total of 15 stabilizing places and 32 stable transitions
Computed a total of 15 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3803 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (500 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17683 steps, run visited all 1 properties in 50 ms. (steps per millisecond=353 )
Probabilistic random walk after 17683 steps, saw 3308 distinct states, run finished after 50 ms. (steps per millisecond=353 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Built C files in :
/tmp/ltsmin11146454560125274168
[2025-06-04 01:28:22] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2025-06-04 01:28:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:28:22] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2025-06-04 01:28:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:28:22] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2025-06-04 01:28:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:28:22] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11146454560125274168
Running compilation step : cd /tmp/ltsmin11146454560125274168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 702 ms.
Running link step : cd /tmp/ltsmin11146454560125274168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11146454560125274168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5957399608851882301.hoa' '--buchi-type=spotba'
LTSmin run took 368 ms.
FORMULA HealthRecord-PT-08-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-08-LTLFireability-02 finished in 21532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0&&X(p1)))||G(p2)) U G(p3)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 60 transition count 113
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 60 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 60 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 56 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 56 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 56 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 55 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 55 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 55 transition count 96
Applied a total of 64 rules in 10 ms. Remains 55 /84 variables (removed 29) and now considering 96/159 (removed 63) transitions.
[2025-06-04 01:28:23] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 55 cols
[2025-06-04 01:28:23] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 01:28:23] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2025-06-04 01:28:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:28:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-04 01:28:23] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2025-06-04 01:28:23] [INFO ] Invariant cache hit.
[2025-06-04 01:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/147 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/148 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 67 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4337 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:28] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:28] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 92/147 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 95/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 164 constraints, problems are : Problem set: 0 solved, 95 unsolved in 11183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15547ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 15547ms
Starting structural reductions in LTL mode, iteration 1 : 55/84 places, 96/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15777 ms. Remains : 55/84 places, 96/159 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p3), true, (OR (AND (NOT p0) p3) (AND p0 (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p2) p3) (AND p0 (NOT p2))), (OR (AND (NOT p0) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p3) (NOT p2) p0), (OR (AND (NOT p0) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p2) p0 (NOT p1))]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-03 finished in 16243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U G(p2))&&X((p3&&X(X(G(p2)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 61 transition count 115
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 61 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 57 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 57 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 55 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 55 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 55 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 54 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 54 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 54 transition count 88
Applied a total of 71 rules in 17 ms. Remains 54 /84 variables (removed 30) and now considering 88/159 (removed 71) transitions.
[2025-06-04 01:28:39] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 54 cols
[2025-06-04 01:28:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 01:28:39] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:28:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:28:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-04 01:28:39] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:28:39] [INFO ] Invariant cache hit.
[2025-06-04 01:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:40] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:41] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:41] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/138 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:45] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:45] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:46] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 84/138 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 87/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 157 constraints, problems are : Problem set: 0 solved, 87 unsolved in 10088 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15299ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 15300ms
Starting structural reductions in LTL mode, iteration 1 : 54/84 places, 88/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15514 ms. Remains : 54/84 places, 88/159 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-05 finished in 15923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 97 edges and 84 vertex of which 10 / 84 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 54 transition count 107
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 54 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 51 place count 54 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 49 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 46 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 46 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 46 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 45 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 45 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 81 place count 45 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 43 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 42 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 42 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 41 transition count 71
Applied a total of 91 rules in 30 ms. Remains 41 /84 variables (removed 43) and now considering 71/159 (removed 88) transitions.
[2025-06-04 01:28:55] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 41 cols
[2025-06-04 01:28:55] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 01:28:55] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2025-06-04 01:28:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:28:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 01:28:55] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:28:55] [INFO ] Redundant transitions in 19 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-04 01:28:55] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2025-06-04 01:28:55] [INFO ] Invariant cache hit.
[2025-06-04 01:28:55] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:56] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 62/103 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 59 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:58] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 62/103 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 115 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3899 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6270ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 6270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/84 places, 71/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6494 ms. Remains : 41/84 places, 71/159 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-06 finished in 6570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 102 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 54 transition count 108
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 54 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 49 place count 54 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 49 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 49 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 49 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 46 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 46 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 46 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 45 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 45 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 45 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 44 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 42 transition count 90
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 85 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 41 transition count 87
Applied a total of 86 rules in 37 ms. Remains 41 /84 variables (removed 43) and now considering 87/159 (removed 72) transitions.
[2025-06-04 01:29:02] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
// Phase 1: matrix 76 rows 41 cols
[2025-06-04 01:29:02] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 01:29:02] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
[2025-06-04 01:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 01:29:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:29:02] [INFO ] Redundant transitions in 26 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-04 01:29:02] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
[2025-06-04 01:29:02] [INFO ] Invariant cache hit.
[2025-06-04 01:29:02] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 75/116 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 67 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:05] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:05] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 75/116 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 71/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 142 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6676ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6678ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/84 places, 87/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6893 ms. Remains : 41/84 places, 87/159 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-07 finished in 7029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p0))&&F(p1)) U X(X((p2||G(p3)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 61 transition count 114
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 61 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 61 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 58 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 55 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 55 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 55 transition count 93
Applied a total of 65 rules in 4 ms. Remains 55 /84 variables (removed 29) and now considering 93/159 (removed 66) transitions.
[2025-06-04 01:29:09] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 55 cols
[2025-06-04 01:29:09] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 01:29:09] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:29:09] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-04 01:29:09] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:09] [INFO ] Invariant cache hit.
[2025-06-04 01:29:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/143 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 68 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:15] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:15] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 88/143 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 163 constraints, problems are : Problem set: 0 solved, 92 unsolved in 11274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16786ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 16786ms
Starting structural reductions in LTL mode, iteration 1 : 55/84 places, 93/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16970 ms. Remains : 55/84 places, 93/159 transitions.
Stuttering acceptance computed with spot in 614 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 544 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 183 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (2240 resets) in 272 ms. (146 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (297 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (307 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (299 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (292 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (296 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (289 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
[2025-06-04 01:29:29] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:29] [INFO ] Invariant cache hit.
[2025-06-04 01:29:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 88/143 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 67 constraints, problems are : Problem set: 0 solved, 6 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:29] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 88/143 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 74 constraints, problems are : Problem set: 0 solved, 6 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1152ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 100 ms.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 93/93 transitions.
Graph (trivial) has 56 edges and 55 vertex of which 12 / 55 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 192 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 74
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 46 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 46 transition count 70
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 15 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 38 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 38 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 36 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 36 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 35 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 35 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 34 place count 35 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 34 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 46 place count 29 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 29 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 29 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 27 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 53 place count 27 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 27 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 56 place count 26 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 59 place count 26 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 60 place count 25 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 61 place count 25 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 62 place count 24 transition count 91
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 24 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 73 place count 24 transition count 81
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 81 place count 24 transition count 81
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 88 place count 24 transition count 81
Applied a total of 88 rules in 54 ms. Remains 24 /55 variables (removed 31) and now considering 81/93 (removed 12) transitions.
Running 65 sub problems to find dead transitions.
[2025-06-04 01:29:30] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 24 cols
[2025-06-04 01:29:30] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 01:29:30] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/93 variables, 24/31 constraints. Problems are: Problem set: 8 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 20/51 constraints. Problems are: Problem set: 8 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 52 constraints, problems are : Problem set: 9 solved, 56 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 69/93 variables, 24/32 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 20/52 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 54/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 106 constraints, problems are : Problem set: 11 solved, 54 unsolved in 3652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5694ms problems are : Problem set: 11 solved, 54 unsolved
Search for dead transitions found 11 dead transitions in 5694ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/55 places, 70/93 transitions.
Graph (complete) has 88 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5754 ms. Remains : 23/55 places, 70/93 transitions.
RANDOM walk for 40000 steps (9188 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1162 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 630 steps, run visited all 1 properties in 5 ms. (steps per millisecond=126 )
Probabilistic random walk after 630 steps, saw 255 distinct states, run finished after 5 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p1))), (F (NOT p3)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p3))), (F p2), (F (NOT (OR p2 p3 p1))), (F (NOT (AND p3 (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F p0), (F p1), (F (NOT (AND (NOT p2) p3 (NOT p1))))]
Knowledge based reduction with 10 factoid took 469 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 93/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2025-06-04 01:29:37] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 55 cols
[2025-06-04 01:29:37] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 01:29:37] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:29:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:29:37] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-04 01:29:37] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:37] [INFO ] Invariant cache hit.
[2025-06-04 01:29:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/143 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 68 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5077 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 88/143 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 163 constraints, problems are : Problem set: 0 solved, 92 unsolved in 9087 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14183ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 14183ms
Finished structural reductions in LTL mode , in 1 iterations and 14354 ms. Remains : 55/55 places, 93/93 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 499 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (2228 resets) in 240 ms. (165 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (302 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (302 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (298 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (293 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (300 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (294 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
[2025-06-04 01:29:52] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 01:29:52] [INFO ] Invariant cache hit.
[2025-06-04 01:29:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 88/143 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:53] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 67 constraints, problems are : Problem set: 0 solved, 6 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:53] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 88/143 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 74 constraints, problems are : Problem set: 0 solved, 6 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1082ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 32 ms.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 93/93 transitions.
Graph (trivial) has 56 edges and 55 vertex of which 12 / 55 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 192 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 74
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 46 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 46 transition count 70
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 15 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 38 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 38 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 36 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 36 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 35 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 35 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 34 place count 35 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 34 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 46 place count 29 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 29 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 29 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 27 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 53 place count 27 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 27 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 56 place count 26 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 59 place count 26 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 60 place count 25 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 61 place count 25 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 62 place count 24 transition count 91
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 24 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 73 place count 24 transition count 81
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 81 place count 24 transition count 81
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 88 place count 24 transition count 81
Applied a total of 88 rules in 26 ms. Remains 24 /55 variables (removed 31) and now considering 81/93 (removed 12) transitions.
Running 65 sub problems to find dead transitions.
[2025-06-04 01:29:53] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 24 cols
[2025-06-04 01:29:53] [INFO ] Computed 7 invariants in 1 ms
[2025-06-04 01:29:53] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/93 variables, 24/31 constraints. Problems are: Problem set: 8 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 20/51 constraints. Problems are: Problem set: 8 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 52 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 69/93 variables, 24/32 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 20/52 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 54/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 106 constraints, problems are : Problem set: 11 solved, 54 unsolved in 4146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6202ms problems are : Problem set: 11 solved, 54 unsolved
Search for dead transitions found 11 dead transitions in 6202ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/55 places, 70/93 transitions.
Graph (complete) has 88 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6230 ms. Remains : 23/55 places, 70/93 transitions.
RANDOM walk for 40000 steps (9182 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1187 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 630 steps, run visited all 1 properties in 7 ms. (steps per millisecond=90 )
Probabilistic random walk after 630 steps, saw 255 distinct states, run finished after 7 ms. (steps per millisecond=90 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p3))), (F (NOT (OR p2 p3))), (F p1), (F (NOT (OR p1 p2 p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT (AND (NOT p1) p3))), (F p0)]
Knowledge based reduction with 10 factoid took 638 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 578 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 570 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 574 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 156 ms.
Product exploration explored 100000 steps with 1 reset in 174 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 571 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 93/93 transitions.
Graph (trivial) has 50 edges and 55 vertex of which 12 / 55 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 48 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 48 transition count 135
Deduced a syphon composed of 5 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 48 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 10 rules in 18 ms. Remains 48 /55 variables (removed 7) and now considering 134/93 (removed -41) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:30:04] [INFO ] Redundant transitions in 44 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-04 01:30:04] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
// Phase 1: matrix 117 rows 48 cols
[2025-06-04 01:30:04] [INFO ] Computed 10 invariants in 2 ms
[2025-06-04 01:30:04] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 7 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:05] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 8 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 110 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 5 (OVERLAPS) 116/164 variables, 48/66 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 26/92 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/92 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/93 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/93 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/93 constraints. Problems are: Problem set: 10 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 93 constraints, problems are : Problem set: 10 solved, 108 unsolved in 6099 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/6 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 8/14 constraints. Problems are: Problem set: 10 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:10] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:11] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/16 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/20 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/20 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 116/164 variables, 48/68 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 26/94 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 108/202 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/202 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/165 variables, 1/203 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/203 constraints. Problems are: Problem set: 10 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 0/165 variables, 0/203 constraints. Problems are: Problem set: 10 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 203 constraints, problems are : Problem set: 10 solved, 108 unsolved in 19015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 108/118 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25192ms problems are : Problem set: 10 solved, 108 unsolved
Search for dead transitions found 10 dead transitions in 25194ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/55 places, 124/93 transitions.
Graph (complete) has 211 edges and 48 vertex of which 43 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 43 /48 variables (removed 5) and now considering 124/124 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/55 places, 124/93 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25270 ms. Remains : 43/55 places, 124/93 transitions.
Built C files in :
/tmp/ltsmin4889867223953145758
[2025-06-04 01:30:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4889867223953145758
Running compilation step : cd /tmp/ltsmin4889867223953145758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin4889867223953145758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4889867223953145758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17387251094615404592.hoa' '--buchi-type=spotba'
LTSmin run took 251 ms.
FORMULA HealthRecord-PT-08-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-08-LTLFireability-08 finished in 80671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((F(p0) U p1)||(p2 U G(p1))))&&F(p2))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 100 edges and 84 vertex of which 10 / 84 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 54 transition count 107
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 54 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 51 place count 54 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 49 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 46 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 46 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 46 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 45 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 45 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 81 place count 45 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 43 transition count 86
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 87 place count 43 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 42 transition count 83
Applied a total of 88 rules in 20 ms. Remains 42 /84 variables (removed 42) and now considering 83/159 (removed 76) transitions.
[2025-06-04 01:30:29] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
// Phase 1: matrix 73 rows 42 cols
[2025-06-04 01:30:29] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 01:30:29] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2025-06-04 01:30:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 01:30:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:30:30] [INFO ] Redundant transitions in 55 ms returned []
Running 67 sub problems to find dead transitions.
[2025-06-04 01:30:30] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2025-06-04 01:30:30] [INFO ] Invariant cache hit.
[2025-06-04 01:30:30] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:30] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 72/114 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 70 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:34] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:34] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 72/114 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 67/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 140 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5185 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8363ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 8365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/84 places, 83/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8660 ms. Remains : 42/84 places, 83/159 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-09 finished in 8806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(F(((p1&&X(F(p2)))||G(F(p2)))) U !p2))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 60 transition count 112
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 60 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 60 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 55 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 55 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 52 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 52 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 52 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 51 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 51 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 80 place count 51 transition count 77
Applied a total of 80 rules in 15 ms. Remains 51 /84 variables (removed 33) and now considering 77/159 (removed 82) transitions.
[2025-06-04 01:30:38] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 51 cols
[2025-06-04 01:30:38] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-04 01:30:38] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2025-06-04 01:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:30:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-06-04 01:30:38] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2025-06-04 01:30:38] [INFO ] Invariant cache hit.
[2025-06-04 01:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:39] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:39] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 72/123 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 68 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 72/123 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 144 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13217ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 13217ms
Starting structural reductions in LTL mode, iteration 1 : 51/84 places, 77/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13379 ms. Remains : 51/84 places, 77/159 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p2), p2, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/51 stabilizing places and 7/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (OR (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-08-LTLFireability-10 finished in 14143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1&&X(X(G(p1)))))&&p0)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 60 transition count 113
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 60 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 60 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 57 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 57 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 56 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 56 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 55 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 55 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 55 transition count 94
Applied a total of 66 rules in 4 ms. Remains 55 /84 variables (removed 29) and now considering 94/159 (removed 65) transitions.
[2025-06-04 01:30:52] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 55 cols
[2025-06-04 01:30:52] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 01:30:52] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 01:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:30:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:30:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-04 01:30:53] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 01:30:53] [INFO ] Invariant cache hit.
[2025-06-04 01:30:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:54] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/145 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 68 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5110 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:58] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:58] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:30:59] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/145 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 93/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 165 constraints, problems are : Problem set: 0 solved, 93 unsolved in 9872 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15001ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 15002ms
Starting structural reductions in LTL mode, iteration 1 : 55/84 places, 94/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15208 ms. Remains : 55/84 places, 94/159 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-13 finished in 15596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 104 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 53 transition count 106
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 53 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 51 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 48 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 48 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 45 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 45 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 45 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 44 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 44 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 44 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 41 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 40 transition count 79
Applied a total of 92 rules in 15 ms. Remains 40 /84 variables (removed 44) and now considering 79/159 (removed 80) transitions.
[2025-06-04 01:31:08] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2025-06-04 01:31:08] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:31:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 01:31:08] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2025-06-04 01:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:31:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 01:31:08] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:31:08] [INFO ] Redundant transitions in 30 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-04 01:31:08] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2025-06-04 01:31:08] [INFO ] Invariant cache hit.
[2025-06-04 01:31:08] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:09] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 68/108 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 65 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2868 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:11] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 68/108 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 63/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 129 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7161ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/84 places, 79/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7383 ms. Remains : 40/84 places, 79/159 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-14 finished in 7527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 159/159 transitions.
Graph (trivial) has 105 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 53 transition count 105
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 53 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 53 place count 53 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 47 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 47 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 47 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 44 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 44 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 81 place count 44 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 43 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 43 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 43 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 42 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 37 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 37 transition count 95
Applied a total of 101 rules in 18 ms. Remains 37 /84 variables (removed 47) and now considering 95/159 (removed 64) transitions.
[2025-06-04 01:31:15] [INFO ] Flow matrix only has 81 transitions (discarded 14 similar events)
// Phase 1: matrix 81 rows 37 cols
[2025-06-04 01:31:15] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:31:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 01:31:16] [INFO ] Flow matrix only has 81 transitions (discarded 14 similar events)
[2025-06-04 01:31:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:31:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 01:31:16] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:31:16] [INFO ] Redundant transitions in 30 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-04 01:31:16] [INFO ] Flow matrix only has 81 transitions (discarded 14 similar events)
[2025-06-04 01:31:16] [INFO ] Invariant cache hit.
[2025-06-04 01:31:16] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:16] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/117 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 68 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4328 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:31:20] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/117 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 79/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 148 constraints, problems are : Problem set: 0 solved, 79 unsolved in 9673 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14034ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 14037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/84 places, 95/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14258 ms. Remains : 37/84 places, 95/159 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLFireability-15 finished in 14317 ms.
All properties solved by simple procedures.
Total runtime 311007 ms.

BK_STOP 1749000690338

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867008200596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;