About the Execution of ITS-Tools for HealthRecord-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 306472.00 | 0.00 | 0.00 | FFFTFFFFFTFTFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200635.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-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 71K 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-13-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749004057716
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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 02:27:40] [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 02:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:27:40] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-06-04 02:27:40] [INFO ] Transformed 161 places.
[2025-06-04 02:27:40] [INFO ] Transformed 341 transitions.
[2025-06-04 02:27:40] [INFO ] Found NUPN structural information;
[2025-06-04 02:27:40] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 88 transition count 173
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 88 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 148 place count 86 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 150 place count 86 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 152 place count 86 transition count 167
Applied a total of 152 rules in 66 ms. Remains 86 /161 variables (removed 75) and now considering 167/313 (removed 146) transitions.
[2025-06-04 02:27:41] [INFO ] Flow matrix only has 161 transitions (discarded 6 similar events)
// Phase 1: matrix 161 rows 86 cols
[2025-06-04 02:27:41] [INFO ] Computed 12 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:27:41] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-06-04 02:27:41] [INFO ] Flow matrix only has 161 transitions (discarded 6 similar events)
[2025-06-04 02:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:27:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:27:41] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-06-04 02:27:41] [INFO ] Flow matrix only has 161 transitions (discarded 6 similar events)
[2025-06-04 02:27:41] [INFO ] Invariant cache hit.
[2025-06-04 02:27:41] [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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:44] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:45] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:45] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:45] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 160/246 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:51] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:51] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:52] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:52] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:52] [INFO ] Deduced a trap composed of 12 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 02:27:52] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:53] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:27:54] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:00] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:00] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/247 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/247 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 121 constraints, problems are : Problem set: 0 solved, 166 unsolved in 24470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 160/246 variables, 86/120 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 166/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 1/247 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 287 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54774ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 54797ms
Starting structural reductions in LTL mode, iteration 1 : 86/161 places, 167/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55549 ms. Remains : 86/161 places, 167/313 transitions.
Support contains 36 out of 86 places after structural reductions.
[2025-06-04 02:28:36] [INFO ] Flatten gal took : 77 ms
[2025-06-04 02:28:36] [INFO ] Flatten gal took : 34 ms
[2025-06-04 02:28:37] [INFO ] Input system was already deterministic with 167 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (3101 resets) in 1554 ms. (25 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (433 resets) in 257 ms. (155 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (430 resets) in 291 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (443 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (435 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (446 resets) in 90 ms. (439 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (441 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (426 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (439 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
[2025-06-04 02:28:38] [INFO ] Flow matrix only has 161 transitions (discarded 6 similar events)
[2025-06-04 02:28:38] [INFO ] Invariant cache hit.
[2025-06-04 02:28:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 160/246 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 99 constraints, problems are : Problem set: 0 solved, 8 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:38] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:38] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:38] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:38] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:38] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 7 ms to minimize.
Problem AtomicPropp19 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 30/86 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 160/246 variables, 86/108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 7/115 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:39] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/116 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/247 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/247 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 117 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2829ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 4 properties in 1015 ms.
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 167/167 transitions.
Graph (trivial) has 90 edges and 86 vertex of which 6 / 86 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 355 edges and 83 vertex of which 80 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 80 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 79 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 78 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 78 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 77 transition count 149
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 27 place count 60 transition count 115
Iterating global reduction 3 with 17 rules applied. Total rules applied 44 place count 60 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 60 transition count 114
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 55 transition count 104
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 61 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 63 place count 53 transition count 92
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 53 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 67 place count 51 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 51 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 75 place count 51 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 79 place count 49 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 93 place count 42 transition count 122
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 95 place count 42 transition count 120
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 42 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 97 place count 41 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 99 place count 41 transition count 117
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 111 place count 41 transition count 117
Applied a total of 111 rules in 74 ms. Remains 41 /86 variables (removed 45) and now considering 117/167 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 41/86 places, 117/167 transitions.
RANDOM walk for 40000 steps (5964 resets) in 829 ms. (48 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (819 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
[2025-06-04 02:28:42] [INFO ] Flow matrix only has 101 transitions (discarded 16 similar events)
// Phase 1: matrix 101 rows 41 cols
[2025-06-04 02:28:42] [INFO ] Computed 9 invariants in 6 ms
[2025-06-04 02:28:42] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
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) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 101/142 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 28/28 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 45.0 s and query timeout 4500.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) 20/22 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:28:42] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/41 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 101/142 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 117/117 transitions.
Graph (complete) has 185 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 39 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 39 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 115
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 38 transition count 115
Applied a total of 7 rules in 32 ms. Remains 38 /41 variables (removed 3) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 38/41 places, 115/117 transitions.
RANDOM walk for 40000 steps (6046 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (831 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1775 steps, run visited all 1 properties in 28 ms. (steps per millisecond=63 )
Probabilistic random walk after 1775 steps, saw 728 distinct states, run finished after 35 ms. (steps per millisecond=50 ) properties seen :1
FORMULA HealthRecord-PT-13-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA HealthRecord-PT-13-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 16 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' '!((G(p0)||X(X(F(p1)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 65 transition count 128
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 65 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 59 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 59 transition count 116
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 59 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 55 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 55 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 73 place count 55 transition count 95
Applied a total of 73 rules in 16 ms. Remains 55 /86 variables (removed 31) and now considering 95/167 (removed 72) transitions.
[2025-06-04 02:28:43] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 55 cols
[2025-06-04 02:28:43] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:28:43] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 02:28:43] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2025-06-04 02:28:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:28:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-04 02:28:43] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2025-06-04 02:28:43] [INFO ] Invariant cache hit.
[2025-06-04 02:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 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:28:44] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:44] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 91/146 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 67 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5149 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 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:28:49] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:28:49] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/13 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:28:49] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 91/146 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 94/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/147 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 164 constraints, problems are : Problem set: 0 solved, 94 unsolved in 9996 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15194ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 15196ms
Starting structural reductions in LTL mode, iteration 1 : 55/86 places, 95/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15479 ms. Remains : 55/86 places, 95/167 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-01 finished in 16013 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 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Graph (trivial) has 98 edges and 86 vertex of which 8 / 86 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.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 58 transition count 119
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 58 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 58 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 52 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 52 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 49 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 46 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 46 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 87 place count 46 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 45 transition count 75
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 3 with 4 rules applied. Total rules applied 93 place count 43 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 43 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 42 transition count 84
Applied a total of 98 rules in 88 ms. Remains 42 /86 variables (removed 44) and now considering 84/167 (removed 83) transitions.
[2025-06-04 02:28:59] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
// Phase 1: matrix 76 rows 42 cols
[2025-06-04 02:28:59] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:28:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-04 02:28:59] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2025-06-04 02:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:28:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:28:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:28:59] [INFO ] Redundant transitions in 31 ms returned []
Running 70 sub problems to find dead transitions.
[2025-06-04 02:28:59] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2025-06-04 02:28:59] [INFO ] Invariant cache hit.
[2025-06-04 02:28:59] [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/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:00] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:00] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:00] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 75/117 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 69 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3267 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 75/117 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 70/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3768 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7077ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 7078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/86 places, 84/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7412 ms. Remains : 42/86 places, 84/167 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-02 finished in 7490 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(((G(p0) U p1)||X(X(X(p2))))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 65 transition count 127
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 65 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 65 transition count 126
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 62 transition count 120
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 62 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 62 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 60 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 60 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 58 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 58 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 58 transition count 101
Applied a total of 66 rules in 14 ms. Remains 58 /86 variables (removed 28) and now considering 101/167 (removed 66) transitions.
[2025-06-04 02:29:06] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
// Phase 1: matrix 97 rows 58 cols
[2025-06-04 02:29:06] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:29:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 02:29:06] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:29:07] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-04 02:29:07] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:07] [INFO ] Invariant cache hit.
[2025-06-04 02:29:07] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:07] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:08] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 96/154 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 72 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:13] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 96/154 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 100/172 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:15] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:15] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18360ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 18370ms
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 101/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18565 ms. Remains : 58/86 places, 101/167 transitions.
Stuttering acceptance computed with spot in 612 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-03
Product exploration explored 100000 steps with 1 reset in 371 ms.
Product exploration explored 100000 steps with 2 reset in 237 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 12 states, 21 edges and 3 AP (stutter sensitive) to 12 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (3125 resets) in 1164 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (444 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (445 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (434 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (432 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (427 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (446 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (443 resets) in 153 ms. (259 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (430 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
[2025-06-04 02:29:28] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:28] [INFO ] Invariant cache hit.
[2025-06-04 02:29:28] [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) 26/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 26/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 96/154 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 69 constraints, problems are : Problem set: 0 solved, 7 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 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) 26/32 variables, 2/2 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:29:28] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:28] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Problem apf4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 8/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:28] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 96/154 variables, 58/71 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 4/75 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/76 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 76 constraints, problems are : Problem set: 3 solved, 4 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 832ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 107 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 101/101 transitions.
Graph (trivial) has 51 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 214 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 53 transition count 87
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 4 place count 52 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 50 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 49 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 48 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 48 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 47 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 47 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 47 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 45 transition count 71
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 38 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 38 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 38 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 36 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 36 transition count 105
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 36 transition count 105
Applied a total of 53 rules in 46 ms. Remains 36 /58 variables (removed 22) and now considering 105/101 (removed -4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 36/58 places, 105/101 transitions.
RANDOM walk for 12174 steps (1844 resets) in 101 ms. (119 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 12 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-04 02:29:30] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:29:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 02:29:30] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:29:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-04 02:29:30] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:30] [INFO ] Invariant cache hit.
[2025-06-04 02:29:30] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:31] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:31] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:32] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 96/154 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 72 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:38] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 96/154 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 100/172 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:40] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:40] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 10876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17575ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 17577ms
Finished structural reductions in LTL mode , in 1 iterations and 17788 ms. Remains : 58/58 places, 101/101 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (3101 resets) in 206 ms. (193 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (448 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (435 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2025-06-04 02:29:48] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2025-06-04 02:29:48] [INFO ] Invariant cache hit.
[2025-06-04 02:29:48] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 96/154 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 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) 28/32 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:29:49] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 8/12 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:29:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 96/154 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 55 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 101/101 transitions.
Graph (trivial) has 54 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 214 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 53 transition count 87
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 4 place count 52 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 48 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 48 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 48 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 46 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 46 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 46 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 45 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 45 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 44 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 44 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 44 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 42 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 45 place count 35 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 35 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 35 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 33 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 33 transition count 92
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 33 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 55 place count 32 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 58 place count 32 transition count 165
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 31 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 31 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 30 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 30 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 72 place count 30 transition count 111
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 79 place count 30 transition count 111
Applied a total of 79 rules in 42 ms. Remains 30 /58 variables (removed 28) and now considering 111/101 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 30/58 places, 111/101 transitions.
RANDOM walk for 2816 steps (536 resets) in 19 ms. (140 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 9 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 101/101 transitions.
Graph (trivial) has 48 edges and 58 vertex of which 8 / 58 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 53 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 95
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 53 transition count 94
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 53 transition count 143
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 53 transition count 142
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 19 ms. Remains 53 /58 variables (removed 5) and now considering 142/101 (removed -41) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:29:51] [INFO ] Redundant transitions in 39 ms returned []
Running 134 sub problems to find dead transitions.
[2025-06-04 02:29:51] [INFO ] Flow matrix only has 125 transitions (discarded 17 similar events)
// Phase 1: matrix 125 rows 53 cols
[2025-06-04 02:29:51] [INFO ] Computed 10 invariants in 1 ms
[2025-06-04 02:29:51] [INFO ] State equation strengthened by 30 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, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:53] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:53] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:53] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 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:29:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:53] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:53] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 7/17 constraints. Problems are: Problem set: 10 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 124 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 5 (OVERLAPS) 124/177 variables, 53/70 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 29/99 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/100 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 100 constraints, problems are : Problem set: 12 solved, 122 unsolved in 5356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 122 unsolved
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: 12 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 2/48 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/5 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 7/12 constraints. Problems are: Problem set: 12 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:29:58] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 5/53 variables, 5/18 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 124/177 variables, 53/71 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 29/100 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 122/222 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/222 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 1/178 variables, 1/223 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/223 constraints. Problems are: Problem set: 12 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/223 constraints. Problems are: Problem set: 12 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 223 constraints, problems are : Problem set: 12 solved, 122 unsolved in 18693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 122/134 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24117ms problems are : Problem set: 12 solved, 122 unsolved
Search for dead transitions found 12 dead transitions in 24118ms
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 : 53/58 places, 130/101 transitions.
Graph (complete) has 233 edges and 53 vertex of which 47 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 47 /53 variables (removed 6) and now considering 130/130 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 130/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24193 ms. Remains : 47/58 places, 130/101 transitions.
Built C files in :
/tmp/ltsmin8105464001999757661
[2025-06-04 02:30:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8105464001999757661
Running compilation step : cd /tmp/ltsmin8105464001999757661;'/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 656 ms.
Running link step : cd /tmp/ltsmin8105464001999757661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8105464001999757661;'/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/stateBased1108875387597883570.hoa' '--buchi-type=spotba'
LTSmin run took 11341 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-03 finished in 81387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((F(p0)&&p1) U (X(!(X(p0)||p2))||!p3)))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 64 transition count 126
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 64 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 45 place count 64 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 59 transition count 115
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 59 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 57 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 55 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 55 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 55 transition count 93
Applied a total of 75 rules in 4 ms. Remains 55 /86 variables (removed 31) and now considering 93/167 (removed 74) transitions.
[2025-06-04 02:30:28] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2025-06-04 02:30:28] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:30:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 02:30:28] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2025-06-04 02:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:30:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:30:28] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-04 02:30:28] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2025-06-04 02:30:28] [INFO ] Invariant cache hit.
[2025-06-04 02:30:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:29] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:29] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 89/144 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 67 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5450 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:34] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:34] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 89/144 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 92/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 164 constraints, problems are : Problem set: 0 solved, 92 unsolved in 11590 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17057ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 17057ms
Starting structural reductions in LTL mode, iteration 1 : 55/86 places, 93/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17188 ms. Remains : 55/86 places, 93/167 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), true, (AND (NOT p2) (NOT p0)), (AND p0 (NOT p3)), (NOT p0), p0, false, false]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 120 steps with 38 reset in 2 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-06 finished in 17543 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(F((!p0||G(!p1)||(!p1&&F(!p2)))))||(X(!p3)&&F((!p0||X(F((G(!p1)||(!p1&&F(!p2)))))))))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 67 transition count 132
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 67 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 62 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 62 transition count 122
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 62 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 60 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 58 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 58 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 58 transition count 101
Applied a total of 67 rules in 6 ms. Remains 58 /86 variables (removed 28) and now considering 101/167 (removed 66) transitions.
[2025-06-04 02:30:45] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 58 cols
[2025-06-04 02:30:45] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:30:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 02:30:45] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2025-06-04 02:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:30:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:30:45] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-04 02:30:45] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2025-06-04 02:30:46] [INFO ] Invariant cache hit.
[2025-06-04 02:30:46] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:47] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 97/155 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 71 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:53] [INFO ] Deduced a trap composed of 17 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:30:53] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/155 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 100/173 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:30:59] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 14651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21756ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 21756ms
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 101/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21979 ms. Remains : 58/86 places, 101/167 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND p0 p1), (AND p0 p1 p3), (AND p0 p1), (AND p0 p1 p2)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-10 finished in 22236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Graph (trivial) has 102 edges and 86 vertex of which 8 / 86 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 60 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 60 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 60 transition count 121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 54 transition count 109
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 54 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 51 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 48 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 48 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 85 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 45 transition count 75
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 4 with 12 rules applied. Total rules applied 104 place count 39 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 115 place count 39 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 38 transition count 107
Applied a total of 117 rules in 21 ms. Remains 38 /86 variables (removed 48) and now considering 107/167 (removed 60) transitions.
[2025-06-04 02:31:07] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
// Phase 1: matrix 89 rows 38 cols
[2025-06-04 02:31:07] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 02:31:08] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2025-06-04 02:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-04 02:31:08] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:31:08] [INFO ] Redundant transitions in 41 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-04 02:31:08] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2025-06-04 02:31:08] [INFO ] Invariant cache hit.
[2025-06-04 02:31:08] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:08] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:09] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:09] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:09] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/126 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 71 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:14] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:14] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:15] [INFO ] Deduced a trap composed of 15 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:31:15] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 88/126 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 91/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/127 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 167 constraints, problems are : Problem set: 0 solved, 91 unsolved in 11589 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17669ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 17671ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/86 places, 107/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17908 ms. Remains : 38/86 places, 107/167 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Computed a total of 22 stabilizing places and 59 stable transitions
Computed a total of 22 stabilizing places and 59 stable transitions
Detected a total of 22/38 stabilizing places and 59/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLCardinality-11 finished in 18744 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(X(G(p0))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 64 transition count 126
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 64 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 45 place count 64 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 58 transition count 113
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 58 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 56 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 54 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 54 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 54 transition count 91
Applied a total of 77 rules in 4 ms. Remains 54 /86 variables (removed 32) and now considering 91/167 (removed 76) transitions.
[2025-06-04 02:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 54 cols
[2025-06-04 02:31:26] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 02:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:31:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:31:26] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-04 02:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:31:26] [INFO ] Invariant cache hit.
[2025-06-04 02:31:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:27] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 87/141 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 67 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5495 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:32] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:33] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 90 unsolved in 8577 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14088ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 14088ms
Starting structural reductions in LTL mode, iteration 1 : 54/86 places, 91/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14249 ms. Remains : 54/86 places, 91/167 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-12
Product exploration explored 100000 steps with 2 reset in 374 ms.
Product exploration explored 100000 steps with 1 reset in 371 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32597 steps (2522 resets) in 111 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-04 02:31:42] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:42] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 02:31:42] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:31:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:31:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-04 02:31:42] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:31:42] [INFO ] Invariant cache hit.
[2025-06-04 02:31:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:43] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 87/141 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:45] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 67 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6291 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:49] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:49] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:31:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17540ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17541ms
Finished structural reductions in LTL mode , in 1 iterations and 17774 ms. Remains : 54/54 places, 91/91 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3092 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39044 steps (426 resets) in 301 ms. (129 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 151 ms.
Product exploration explored 100000 steps with 2 reset in 170 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Graph (trivial) has 45 edges and 54 vertex of which 8 / 54 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 49 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 49 transition count 134
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 49 transition count 133
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 11 rules in 17 ms. Remains 49 /54 variables (removed 5) and now considering 133/91 (removed -42) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:32:02] [INFO ] Redundant transitions in 30 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-04 02:32:02] [INFO ] Flow matrix only has 114 transitions (discarded 19 similar events)
// Phase 1: matrix 114 rows 49 cols
[2025-06-04 02:32:02] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 02:32:02] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:03] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 113/162 variables, 49/66 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 20/86 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/87 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/87 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/87 constraints. Problems are: Problem set: 12 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 87 constraints, problems are : Problem set: 12 solved, 105 unsolved in 7273 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 7/49 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:10] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:10] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:10] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 4/21 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 113/162 variables, 49/70 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 20/90 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 105/195 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/195 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/196 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/196 constraints. Problems are: Problem set: 12 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/196 constraints. Problems are: Problem set: 12 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 196 constraints, problems are : Problem set: 12 solved, 105 unsolved in 17893 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 105/117 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25219ms problems are : Problem set: 12 solved, 105 unsolved
Search for dead transitions found 12 dead transitions in 25220ms
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 : 49/54 places, 121/91 transitions.
Graph (complete) has 202 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 43 /49 variables (removed 6) and now considering 121/121 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/54 places, 121/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25282 ms. Remains : 43/54 places, 121/91 transitions.
Built C files in :
/tmp/ltsmin16036659711492689093
[2025-06-04 02:32:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16036659711492689093
Running compilation step : cd /tmp/ltsmin16036659711492689093;'/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 252 ms.
Running link step : cd /tmp/ltsmin16036659711492689093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16036659711492689093;'/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/stateBased16321152196347542166.hoa' '--buchi-type=spotba'
LTSmin run took 1220 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-12 finished in 62231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 167/167 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 61 transition count 120
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 61 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 61 transition count 119
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 56 transition count 109
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 53 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 50 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 50 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 88 place count 50 transition count 79
Applied a total of 88 rules in 3 ms. Remains 50 /86 variables (removed 36) and now considering 79/167 (removed 88) transitions.
[2025-06-04 02:32:28] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2025-06-04 02:32:28] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-04 02:32:29] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 02:32:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:32:29] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-04 02:32:29] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 02:32:29] [INFO ] Invariant cache hit.
[2025-06-04 02:32:29] [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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:29] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:29] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/125 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 63 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5895 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:35] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:35] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:35] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/125 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 78/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14726ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 14726ms
Starting structural reductions in LTL mode, iteration 1 : 50/86 places, 79/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14863 ms. Remains : 50/86 places, 79/167 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 112 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLCardinality-13 finished in 15181 ms.
All properties solved by simple procedures.
Total runtime 304012 ms.
BK_STOP 1749004364188
--------------------
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-13"
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-13, 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-174867008200635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 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 ;