About the Execution of ITS-Tools for HealthRecord-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 317145.00 | 0.00 | 0.00 | FFFTTFFFFFFTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200619.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200619
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 70K 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-11-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749002345852
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 01:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:59:08] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2025-06-04 01:59:08] [INFO ] Transformed 159 places.
[2025-06-04 01:59:08] [INFO ] Transformed 334 transitions.
[2025-06-04 01:59:08] [INFO ] Found NUPN structural information;
[2025-06-04 01:59:08] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 85 transition count 166
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 85 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 152 place count 81 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 156 place count 81 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 158 place count 81 transition count 156
Applied a total of 158 rules in 108 ms. Remains 81 /159 variables (removed 78) and now considering 156/307 (removed 151) transitions.
[2025-06-04 01:59:09] [INFO ] Flow matrix only has 151 transitions (discarded 5 similar events)
// Phase 1: matrix 151 rows 81 cols
[2025-06-04 01:59:09] [INFO ] Computed 11 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:59:09] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-04 01:59:09] [INFO ] Flow matrix only has 151 transitions (discarded 5 similar events)
[2025-06-04 01:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:59:09] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-04 01:59:09] [INFO ] Flow matrix only has 151 transitions (discarded 5 similar events)
[2025-06-04 01:59:09] [INFO ] Invariant cache hit.
[2025-06-04 01:59:10] [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/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 9 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:59:12] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:12] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:13] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:13] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:13] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 150/231 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/232 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 103 constraints, problems are : Problem set: 0 solved, 155 unsolved in 13972 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:25] [INFO ] Deduced a trap composed of 28 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:59:25] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:25] [INFO ] Deduced a trap composed of 15 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:59:25] [INFO ] Deduced a trap composed of 15 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:59:25] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:26] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:26] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:26] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:26] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:26] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 150/231 variables, 81/112 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 155/267 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:44] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/232 variables, and 270 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44258ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 44279ms
Starting structural reductions in LTL mode, iteration 1 : 81/159 places, 156/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45119 ms. Remains : 81/159 places, 156/307 transitions.
Support contains 30 out of 81 places after structural reductions.
[2025-06-04 01:59:54] [INFO ] Flatten gal took : 85 ms
[2025-06-04 01:59:54] [INFO ] Flatten gal took : 42 ms
[2025-06-04 01:59:54] [INFO ] Input system was already deterministic with 156 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (2684 resets) in 2042 ms. (19 steps per ms) remains 9/20 properties
BEST_FIRST walk for 40004 steps (397 resets) in 404 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (397 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (393 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (387 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (399 resets) in 195 ms. (204 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (398 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (394 resets) in 283 ms. (140 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (384 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (394 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
[2025-06-04 01:59:56] [INFO ] Flow matrix only has 151 transitions (discarded 5 similar events)
[2025-06-04 01:59:56] [INFO ] Invariant cache hit.
[2025-06-04 01:59:56] [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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 38/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 150/231 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:56] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:56] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:56] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/232 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:56] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:56] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 98 constraints, problems are : Problem set: 0 solved, 7 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 38/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 26 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:59:57] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:58] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:58] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 150/231 variables, 81/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 7/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:58] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/232 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:59:59] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 8 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/232 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 116 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3617ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 691 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 156/156 transitions.
Graph (trivial) has 94 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 327 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 74 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 72 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 72 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 69 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 29 place count 51 transition count 102
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 51 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 51 transition count 101
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 45 transition count 88
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 45 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 66 place count 45 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 69 place count 42 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 42 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 75 place count 42 transition count 71
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 77 place count 40 transition count 67
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 40 transition count 67
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 85 place count 40 transition count 61
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 6 with 2 rules applied. Total rules applied 87 place count 39 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 39 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 100 place count 33 transition count 93
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 101 place count 33 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 103 place count 33 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 105 place count 31 transition count 90
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 107 place count 31 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 108 place count 31 transition count 153
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 110 place count 30 transition count 152
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 113 place count 30 transition count 149
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 114 place count 29 transition count 114
Iterating global reduction 9 with 1 rules applied. Total rules applied 115 place count 29 transition count 114
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 116 place count 28 transition count 111
Iterating global reduction 9 with 1 rules applied. Total rules applied 117 place count 28 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 127 place count 28 transition count 101
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 129 place count 28 transition count 101
Applied a total of 129 rules in 88 ms. Remains 28 /81 variables (removed 53) and now considering 101/156 (removed 55) transitions.
Running 85 sub problems to find dead transitions.
[2025-06-04 02:00:00] [INFO ] Flow matrix only has 83 transitions (discarded 18 similar events)
// Phase 1: matrix 83 rows 28 cols
[2025-06-04 02:00:00] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 02:00:00] [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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD100 is UNSAT
At refinement iteration 3 (OVERLAPS) 83/111 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 55 constraints, problems are : Problem set: 1 solved, 84 unsolved in 3066 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 84 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 83/111 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 84 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 20/55 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 79/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 134 constraints, problems are : Problem set: 6 solved, 79 unsolved in 6782 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 79/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9929ms problems are : Problem set: 6 solved, 79 unsolved
Search for dead transitions found 6 dead transitions in 9930ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/81 places, 95/156 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 95
Applied a total of 7 rules in 10 ms. Remains 28 /28 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10031 ms. Remains : 28/81 places, 95/156 transitions.
RANDOM walk for 3391 steps (772 resets) in 38 ms. (86 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-11-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-11-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 8 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(X(F((!((p0 U p1) U X(X(X(p0))))||p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 121
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 63 transition count 120
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 59 transition count 111
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 59 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 57 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 57 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 56 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 56 transition count 95
Applied a total of 60 rules in 20 ms. Remains 56 /81 variables (removed 25) and now considering 95/156 (removed 61) transitions.
[2025-06-04 02:00:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 56 cols
[2025-06-04 02:00:11] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:00:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 02:00:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:00:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:00:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-04 02:00:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:11] [INFO ] Invariant cache hit.
[2025-06-04 02:00:11] [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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:12] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:12] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:12] [INFO ] Deduced a trap composed of 12 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 02:00:12] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 71 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6826 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 94/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 165 constraints, problems are : Problem set: 0 solved, 94 unsolved in 8946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15811ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 15812ms
Starting structural reductions in LTL mode, iteration 1 : 56/81 places, 95/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16058 ms. Remains : 56/81 places, 95/156 transitions.
Stuttering acceptance computed with spot in 1330 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 14623 reset in 623 ms.
Product exploration explored 100000 steps with 14583 reset in 517 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 719 ms. Reduced automaton from 18 states, 58 edges and 3 AP (stutter sensitive) to 18 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1176 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
RANDOM walk for 40000 steps (2715 resets) in 533 ms. (74 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (395 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (380 resets) in 424 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (402 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (389 resets) in 182 ms. (218 steps per ms) remains 2/5 properties
[2025-06-04 02:00:32] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:32] [INFO ] Invariant cache hit.
[2025-06-04 02:00:32] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:32] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/56 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/146 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:32] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:32] [INFO ] Deduced a trap composed of 19 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 02:00:32] [INFO ] Deduced a trap composed of 19 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 02:00:32] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/147 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/56 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/146 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/147 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 873ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 707 steps, including 59 resets, run visited all 1 properties in 4 ms. (steps per millisecond=176 )
Parikh walk visited 2 properties in 21 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 1049 ms. Reduced automaton from 18 states, 58 edges and 3 AP (stutter sensitive) to 18 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1172 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 1169 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-04 02:00:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:00:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 02:00:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:00:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:00:36] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-04 02:00:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:36] [INFO ] Invariant cache hit.
[2025-06-04 02:00:36] [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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:37] [INFO ] Deduced a trap composed of 11 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 02:00:37] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:37] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:38] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 71 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6672 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 94/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 165 constraints, problems are : Problem set: 0 solved, 94 unsolved in 9045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15747ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 15748ms
Finished structural reductions in LTL mode , in 1 iterations and 15983 ms. Remains : 56/56 places, 95/95 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 485 ms. Reduced automaton from 18 states, 58 edges and 3 AP (stutter sensitive) to 18 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 896 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
RANDOM walk for 40000 steps (2713 resets) in 281 ms. (141 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (395 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (380 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
[2025-06-04 02:00:53] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2025-06-04 02:00:53] [INFO ] Invariant cache hit.
[2025-06-04 02:00:53] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:54] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 90/146 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:54] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/147 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/146 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:00:54] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/147 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 49 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 919 ms. Reduced automaton from 18 states, 58 edges and 3 AP (stutter sensitive) to 18 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1018 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 1120 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 1153 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0)]
Product exploration explored 100000 steps with 14606 reset in 391 ms.
Product exploration explored 100000 steps with 14623 reset in 298 ms.
Built C files in :
/tmp/ltsmin15022304049450621483
[2025-06-04 02:01:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15022304049450621483
Running compilation step : cd /tmp/ltsmin15022304049450621483;'/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 627 ms.
Running link step : cd /tmp/ltsmin15022304049450621483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin15022304049450621483;'/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/stateBased12710129897902572156.hoa' '--buchi-type=spotba'
LTSmin run took 615 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-00 finished in 50557 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((G(((G(p0) U X(p1))||F(p2)))&&(G(p4)||p3))))'
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 65 transition count 126
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 65 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 65 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 59 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 59 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 59 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 57 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 57 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 56 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 56 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 56 transition count 94
Applied a total of 62 rules in 12 ms. Remains 56 /81 variables (removed 25) and now considering 94/156 (removed 62) transitions.
[2025-06-04 02:01:01] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 56 cols
[2025-06-04 02:01:01] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 02:01:01] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 02:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:01:01] [INFO ] Implicit Places using invariants and state equation in 125 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 02:01:01] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 02:01:01] [INFO ] Invariant cache hit.
[2025-06-04 02:01:01] [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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 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 02:01:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:02] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 90/146 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 68 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5864 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 2/2 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 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 02:01:08] [INFO ] Deduced a trap composed of 17 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 02:01:08] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:08] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:08] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 93/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 165 constraints, problems are : Problem set: 0 solved, 93 unsolved in 9740 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15637ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 15637ms
Starting structural reductions in LTL mode, iteration 1 : 56/81 places, 94/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15851 ms. Remains : 56/81 places, 94/156 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p4), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p3 (NOT p4) p0 p2 p1), (X p2), (X p3), (X (OR p3 p4)), (X (NOT p4)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) p4))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p4)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 18 factoid took 293 ms. Reduced automaton from 9 states, 19 edges and 5 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (2662 resets) in 191 ms. (208 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (384 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (450 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (450 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (394 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (388 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (451 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (397 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
[2025-06-04 02:01:19] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 02:01:19] [INFO ] Invariant cache hit.
[2025-06-04 02:01:19] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/56 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 66 constraints, problems are : Problem set: 0 solved, 7 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:19] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/56 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 90/146 variables, 56/68 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 5/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:20] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/74 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/147 variables, 1/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 75 constraints, problems are : Problem set: 2 solved, 5 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1141ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 85 ms.
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 94/94 transitions.
Graph (trivial) has 54 edges and 56 vertex of which 8 / 56 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 194 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (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 51 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 49 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 49 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 46 transition count 78
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 42 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 41 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 41 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 40 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 40 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 40 transition count 61
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 29 place count 39 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 39 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 42 place count 33 transition count 93
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 43 place count 33 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 45 place count 33 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 47 place count 31 transition count 90
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 49 place count 31 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 50 place count 31 transition count 153
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 52 place count 30 transition count 152
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 55 place count 30 transition count 149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 56 place count 29 transition count 114
Iterating global reduction 7 with 1 rules applied. Total rules applied 57 place count 29 transition count 114
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 58 place count 28 transition count 111
Iterating global reduction 7 with 1 rules applied. Total rules applied 59 place count 28 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 69 place count 28 transition count 101
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 71 place count 28 transition count 101
Applied a total of 71 rules in 73 ms. Remains 28 /56 variables (removed 28) and now considering 101/94 (removed -7) transitions.
Running 85 sub problems to find dead transitions.
[2025-06-04 02:01:20] [INFO ] Flow matrix only has 83 transitions (discarded 18 similar events)
// Phase 1: matrix 83 rows 28 cols
[2025-06-04 02:01:20] [INFO ] Computed 7 invariants in 1 ms
[2025-06-04 02:01:20] [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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD100 is UNSAT
At refinement iteration 3 (OVERLAPS) 83/111 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 55 constraints, problems are : Problem set: 1 solved, 84 unsolved in 3392 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 84 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 83/111 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 84 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 20/55 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 79/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/134 constraints. Problems are: Problem set: 6 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 134 constraints, problems are : Problem set: 6 solved, 79 unsolved in 6143 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 79/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9590ms problems are : Problem set: 6 solved, 79 unsolved
Search for dead transitions found 6 dead transitions in 9591ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/56 places, 95/94 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 95
Applied a total of 7 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9673 ms. Remains : 28/56 places, 95/94 transitions.
RANDOM walk for 2734 steps (608 resets) in 11 ms. (227 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p4) p0 p2 p1), (X p2), (X p3), (X (OR p3 p4)), (X (NOT p4)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) p4))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p4)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (G (OR p0 p2)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 531 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 56 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 : 56/56 places, 94/94 transitions.
Graph (trivial) has 45 edges and 56 vertex of which 8 / 56 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 50 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 48 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 48 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 47 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 47 transition count 110
Applied a total of 13 rules in 34 ms. Remains 47 /56 variables (removed 9) and now considering 110/94 (removed -16) transitions.
[2025-06-04 02:01:30] [INFO ] Flow matrix only has 97 transitions (discarded 13 similar events)
// Phase 1: matrix 97 rows 47 cols
[2025-06-04 02:01:30] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 02:01:31] [INFO ] Flow matrix only has 97 transitions (discarded 13 similar events)
[2025-06-04 02:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 02:01:31] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:01:31] [INFO ] Redundant transitions in 55 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-04 02:01:31] [INFO ] Flow matrix only has 97 transitions (discarded 13 similar events)
[2025-06-04 02:01:31] [INFO ] Invariant cache hit.
[2025-06-04 02:01:31] [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/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:32] [INFO ] Deduced a trap composed of 4 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 02:01:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:32] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 96/143 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 79 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:36] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:37] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 96/143 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 96/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 178 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12630ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12631ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/56 places, 110/94 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12968 ms. Remains : 47/56 places, 110/94 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Computed a total of 10 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (4217 resets) in 178 ms. (223 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (577 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (557 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
[2025-06-04 02:01:44] [INFO ] Flow matrix only has 97 transitions (discarded 13 similar events)
[2025-06-04 02:01:44] [INFO ] Invariant cache hit.
[2025-06-04 02:01:44] [INFO ] State equation strengthened by 20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 96/143 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:44] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:44] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 96/143 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 81 constraints, problems are : Problem set: 0 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 370 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 161 ms.
Product exploration explored 100000 steps with 9 reset in 184 ms.
Built C files in :
/tmp/ltsmin5732495763009913339
[2025-06-04 02:01:45] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2025-06-04 02:01:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:01:45] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2025-06-04 02:01:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:01:45] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2025-06-04 02:01:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:01:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5732495763009913339
Running compilation step : cd /tmp/ltsmin5732495763009913339;'/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 545 ms.
Running link step : cd /tmp/ltsmin5732495763009913339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5732495763009913339;'/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/stateBased10554358654885300207.hoa' '--buchi-type=spotba'
LTSmin run took 220 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-05 finished in 45264 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(p0)&&(p1 U (p2||G(p1)))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 64 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 64 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 64 transition count 122
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 59 transition count 112
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 59 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 59 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 57 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 56 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 56 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 59 place count 56 transition count 96
Applied a total of 59 rules in 16 ms. Remains 56 /81 variables (removed 25) and now considering 96/156 (removed 60) transitions.
[2025-06-04 02:01:46] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
// Phase 1: matrix 92 rows 56 cols
[2025-06-04 02:01:46] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 02:01:46] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2025-06-04 02:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:01:47] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-04 02:01:47] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2025-06-04 02:01:47] [INFO ] Invariant cache hit.
[2025-06-04 02:01:47] [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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 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 02:01:48] [INFO ] Deduced a trap composed of 16 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 02:01:48] [INFO ] Deduced a trap composed of 18 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 02:01:48] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/13 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 02:01:49] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 91/147 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 71 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 4/4 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 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 02:01:54] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:01:54] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 91/147 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 168 constraints, problems are : Problem set: 0 solved, 95 unsolved in 10513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17069ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 17071ms
Starting structural reductions in LTL mode, iteration 1 : 56/81 places, 96/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17316 ms. Remains : 56/81 places, 96/156 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-08 finished in 17472 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((X(X(F(p0)))||(p1&&F(G(p2))))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 122
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 57 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 57 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 54 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 54 transition count 95
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 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 53 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 53 transition count 88
Applied a total of 67 rules in 9 ms. Remains 53 /81 variables (removed 28) and now considering 88/156 (removed 68) transitions.
[2025-06-04 02:02:04] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2025-06-04 02:02:04] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:02:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 02:02:04] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 02:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:02:04] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-04 02:02:04] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 02:02:04] [INFO ] Invariant cache hit.
[2025-06-04 02:02:04] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:05] [INFO ] Deduced a trap composed of 14 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 02:02:05] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 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 02:02:05] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:05] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:11] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 156 constraints, problems are : Problem set: 0 solved, 87 unsolved in 9190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15389ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 15390ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 88/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15600 ms. Remains : 53/81 places, 88/156 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-10
Product exploration explored 100000 steps with 24890 reset in 232 ms.
Product exploration explored 100000 steps with 24947 reset in 288 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2694 resets) in 173 ms. (229 steps per ms) remains 1/5 properties
BEST_FIRST walk for 39510 steps (385 resets) in 39 ms. (987 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 4 factoid took 394 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-06-04 02:02:22] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 02:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:02:22] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 02:02:22] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 02:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:02:22] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-04 02:02:22] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 02:02:22] [INFO ] Invariant cache hit.
[2025-06-04 02:02:22] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 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 02:02:23] [INFO ] Deduced a trap composed of 16 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 02:02:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6278 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:29] [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 02:02:29] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 156 constraints, problems are : Problem set: 0 solved, 87 unsolved in 10253 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16553ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 16554ms
Finished structural reductions in LTL mode , in 1 iterations and 16776 ms. Remains : 53/53 places, 88/88 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 38864 steps (2619 resets) in 107 ms. (359 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24901 reset in 237 ms.
Product exploration explored 100000 steps with 24990 reset in 425 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 43 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 81
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 47 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 47 transition count 131
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 47 transition count 129
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 12 rules in 21 ms. Remains 47 /53 variables (removed 6) and now considering 129/88 (removed -41) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:02:41] [INFO ] Redundant transitions in 46 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-04 02:02:41] [INFO ] Flow matrix only has 116 transitions (discarded 13 similar events)
// Phase 1: matrix 116 rows 47 cols
[2025-06-04 02:02:41] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 02:02:41] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:43] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 5 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:43] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 5 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/15 constraints. Problems are: Problem set: 8 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 105 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 4 (OVERLAPS) 115/162 variables, 47/62 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 24/86 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/87 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/87 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/87 constraints. Problems are: Problem set: 12 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 87 constraints, problems are : Problem set: 12 solved, 101 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 7/47 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/15 constraints. Problems are: Problem set: 12 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:48] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/16 constraints. Problems are: Problem set: 12 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:02:49] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/17 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 115/162 variables, 47/64 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 24/88 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 101/189 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/163 variables, 0/190 constraints. Problems are: Problem set: 12 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 190 constraints, problems are : Problem set: 12 solved, 101 unsolved in 13905 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 101/113 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20679ms problems are : Problem set: 12 solved, 101 unsolved
Search for dead transitions found 12 dead transitions in 20680ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 117/88 transitions.
Graph (complete) has 193 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 41 /47 variables (removed 6) and now considering 117/117 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/53 places, 117/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20781 ms. Remains : 41/53 places, 117/88 transitions.
Built C files in :
/tmp/ltsmin17471539816765294265
[2025-06-04 02:03:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17471539816765294265
Running compilation step : cd /tmp/ltsmin17471539816765294265;'/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 343 ms.
Running link step : cd /tmp/ltsmin17471539816765294265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17471539816765294265;'/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/stateBased2467289597341082882.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-10 finished in 58644 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 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Graph (trivial) has 84 edges and 81 vertex of which 10 / 81 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 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 54 transition count 110
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 54 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 54 transition count 109
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 48 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 48 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 45 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 43 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 43 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 81 place count 43 transition count 69
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 83 place count 42 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 42 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 88 place count 40 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 40 transition count 79
Applied a total of 90 rules in 45 ms. Remains 40 /81 variables (removed 41) and now considering 79/156 (removed 77) transitions.
[2025-06-04 02:03:02] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 40 cols
[2025-06-04 02:03:02] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 02:03:03] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2025-06-04 02:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:03:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:03:03] [INFO ] Redundant transitions in 89 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-04 02:03:03] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2025-06-04 02:03:03] [INFO ] Invariant cache hit.
[2025-06-04 02:03:03] [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/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:04] [INFO ] Deduced a trap composed of 4 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 02:03:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 69/109 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 64 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:06] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 65/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 130 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7441ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/81 places, 79/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7809 ms. Remains : 40/81 places, 79/156 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 347 ms.
Product exploration explored 100000 steps with 2 reset in 364 ms.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 33 ms :[(NOT p0)]
RANDOM walk for 646 steps (66 resets) in 4 ms. (129 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2025-06-04 02:03:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2025-06-04 02:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 02:03:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2025-06-04 02:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:03:11] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:03:11] [INFO ] Redundant transitions in 35 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-04 02:03:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2025-06-04 02:03:11] [INFO ] Invariant cache hit.
[2025-06-04 02:03:11] [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/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:12] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:12] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 69/109 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 64 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:15] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 65/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 130 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4174 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7153ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7393 ms. Remains : 40/40 places, 79/79 transitions.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 32 ms :[(NOT p0)]
RANDOM walk for 1133 steps (115 resets) in 6 ms. (161 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 69 ms.
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-12 finished in 16666 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(((!p0&&F(p1)) U (G((G(!p0)||(!p0&&F(p1))))||(p2&&(G(!p0)||(!p0&&F(p1)))&&X(!p1))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 156/156 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 121
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 63 transition count 120
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 58 transition count 109
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 58 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 58 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 55 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 53 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 69 place count 53 transition count 85
Applied a total of 69 rules in 6 ms. Remains 53 /81 variables (removed 28) and now considering 85/156 (removed 71) transitions.
[2025-06-04 02:03:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2025-06-04 02:03:19] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 02:03:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:03:19] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 02:03:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:19] [INFO ] Invariant cache hit.
[2025-06-04 02:03:19] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 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 02:03:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 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 02:03:21] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9826 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15447ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 15448ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 85/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15629 ms. Remains : 53/81 places, 85/156 transitions.
Stuttering acceptance computed with spot in 291 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 1 reset in 305 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 247 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (2680 resets) in 235 ms. (169 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (386 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (403 resets) in 356 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (384 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (392 resets) in 61 ms. (645 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40003 steps (399 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (389 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (395 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
[2025-06-04 02:03:36] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:36] [INFO ] Invariant cache hit.
[2025-06-04 02:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:36] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Problem apf4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/53 variables, 8/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 65 constraints, problems are : Problem set: 3 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 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: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/53 variables, 8/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/66 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 67 constraints, problems are : Problem set: 3 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 3 solved, 2 unsolved
Finished Parikh walk after 187 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=93 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) p1))), (F p0), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 21 factoid took 699 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-04 02:03:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 02:03:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:03:38] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 02:03:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:38] [INFO ] Invariant cache hit.
[2025-06-04 02:03: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 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 02:03:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:39] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 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 02:03:40] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5716 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 8160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13895ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13896ms
Finished structural reductions in LTL mode , in 1 iterations and 14110 ms. Remains : 53/53 places, 85/85 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), false, (NOT p1)]
RANDOM walk for 40000 steps (2690 resets) in 162 ms. (245 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (402 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2025-06-04 02:03:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 02:03:52] [INFO ] Invariant cache hit.
[2025-06-04 02:03: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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/133 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:52] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/53 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 80/133 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 556 steps, including 42 resets, run visited all 1 properties in 5 ms. (steps per millisecond=111 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), false, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 343 ms.
Product exploration explored 100000 steps with 1 reset in 284 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 78
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 47 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 47 transition count 125
Deduced a syphon composed of 6 places in 0 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 11 place count 47 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 10 ms. Remains 47 /53 variables (removed 6) and now considering 124/85 (removed -39) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:03:55] [INFO ] Redundant transitions in 36 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-04 02:03:55] [INFO ] Flow matrix only has 107 transitions (discarded 17 similar events)
// Phase 1: matrix 107 rows 47 cols
[2025-06-04 02:03:55] [INFO ] Computed 10 invariants in 2 ms
[2025-06-04 02:03:55] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:55] [INFO ] Deduced a trap composed of 4 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 02:03:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:55] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 5 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:56] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:03:56] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 5 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 7/17 constraints. Problems are: Problem set: 10 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 98 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/153 variables, 47/64 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 21/85 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/85 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/86 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 86 constraints, problems are : Problem set: 12 solved, 96 unsolved in 6241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/5 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 7/12 constraints. Problems are: Problem set: 12 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:04:01] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 5/47 variables, 5/18 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 106/153 variables, 47/65 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 21/86 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 96/182 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/182 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 1/154 variables, 1/183 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/183 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/154 variables, 0/183 constraints. Problems are: Problem set: 12 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 183 constraints, problems are : Problem set: 12 solved, 96 unsolved in 14331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 96/108 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20610ms problems are : Problem set: 12 solved, 96 unsolved
Search for dead transitions found 12 dead transitions in 20610ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 112/85 transitions.
Graph (complete) has 199 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 41 /47 variables (removed 6) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/53 places, 112/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20665 ms. Remains : 41/53 places, 112/85 transitions.
Built C files in :
/tmp/ltsmin5944919923134286195
[2025-06-04 02:04:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5944919923134286195
Running compilation step : cd /tmp/ltsmin5944919923134286195;'/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 267 ms.
Running link step : cd /tmp/ltsmin5944919923134286195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5944919923134286195;'/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/stateBased14975268079934143601.hoa' '--buchi-type=spotba'
LTSmin run took 6973 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-14 finished in 63404 ms.
All properties solved by simple procedures.
Total runtime 314675 ms.
BK_STOP 1749002662997
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-11"
export BK_EXAMINATION="LTLCardinality"
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-11, examination is LTLCardinality"
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-174867008200619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;