Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200588.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-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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-07-LTLFireability-00
FORMULA_NAME HealthRecord-PT-07-LTLFireability-01
FORMULA_NAME HealthRecord-PT-07-LTLFireability-02
FORMULA_NAME HealthRecord-PT-07-LTLFireability-03
FORMULA_NAME HealthRecord-PT-07-LTLFireability-04
FORMULA_NAME HealthRecord-PT-07-LTLFireability-05
FORMULA_NAME HealthRecord-PT-07-LTLFireability-06
FORMULA_NAME HealthRecord-PT-07-LTLFireability-07
FORMULA_NAME HealthRecord-PT-07-LTLFireability-08
FORMULA_NAME HealthRecord-PT-07-LTLFireability-09
FORMULA_NAME HealthRecord-PT-07-LTLFireability-10
FORMULA_NAME HealthRecord-PT-07-LTLFireability-11
FORMULA_NAME HealthRecord-PT-07-LTLFireability-12
FORMULA_NAME HealthRecord-PT-07-LTLFireability-13
FORMULA_NAME HealthRecord-PT-07-LTLFireability-14
FORMULA_NAME HealthRecord-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748999748072

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 01:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:15:51] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2025-06-04 01:15:51] [INFO ] Transformed 155 places.
[2025-06-04 01:15:51] [INFO ] Transformed 320 transitions.
[2025-06-04 01:15:51] [INFO ] Found NUPN structural information;
[2025-06-04 01:15:51] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 85 transition count 162
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 85 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 144 place count 81 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 148 place count 81 transition count 154
Applied a total of 148 rules in 53 ms. Remains 81 /155 variables (removed 74) and now considering 154/295 (removed 141) transitions.
[2025-06-04 01:15:51] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
// Phase 1: matrix 149 rows 81 cols
[2025-06-04 01:15:51] [INFO ] Computed 11 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:15:52] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-04 01:15:52] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
[2025-06-04 01:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:15:52] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-04 01:15:52] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
[2025-06-04 01:15:52] [INFO ] Invariant cache hit.
[2025-06-04 01:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:55] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:55] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:55] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:55] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:55] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:15:56] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 148/229 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:02] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 100 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14944 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:09] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 148/229 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 153/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:20] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 256 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45195ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 45218ms
Starting structural reductions in LTL mode, iteration 1 : 81/155 places, 154/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46098 ms. Remains : 81/155 places, 154/295 transitions.
Support contains 36 out of 81 places after structural reductions.
[2025-06-04 01:16:37] [INFO ] Flatten gal took : 74 ms
[2025-06-04 01:16:38] [INFO ] Flatten gal took : 33 ms
[2025-06-04 01:16:38] [INFO ] Input system was already deterministic with 154 transitions.
RANDOM walk for 40000 steps (2106 resets) in 2404 ms. (16 steps per ms) remains 14/34 properties
BEST_FIRST walk for 40004 steps (316 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (330 resets) in 252 ms. (158 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (317 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (310 resets) in 204 ms. (195 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (314 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (343 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (312 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (305 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (314 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (317 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (318 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (306 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (318 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
[2025-06-04 01:16:39] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
[2025-06-04 01:16:39] [INFO ] Invariant cache hit.
[2025-06-04 01:16:39] [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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:39] [INFO ] Deduced a trap composed of 15 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 01:16:40] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 5 (OVERLAPS) 30/81 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 148/229 variables, 81/105 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 106 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 34/50 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 31/81 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 8/24 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 148/229 variables, 81/105 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 10/115 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 116 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/12 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2814ms problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 2924 steps, including 115 resets, run visited all 1 properties in 13 ms. (steps per millisecond=224 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 140 ms.
FORMULA HealthRecord-PT-07-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA HealthRecord-PT-07-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1))) U (!p0&&G((p0||G(p1)))))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 115
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 112
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 55 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 55 transition count 98
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 55 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 53 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 53 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 53 transition count 82
Applied a total of 71 rules in 23 ms. Remains 53 /81 variables (removed 28) and now considering 82/154 (removed 72) transitions.
[2025-06-04 01:16:43] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
// Phase 1: matrix 78 rows 53 cols
[2025-06-04 01:16:43] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:16:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-04 01:16:43] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2025-06-04 01:16:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:16:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-06-04 01:16:43] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2025-06-04 01:16:43] [INFO ] Invariant cache hit.
[2025-06-04 01:16: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:44] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:44] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:44] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/130 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 68 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5473 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/130 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13153ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 13155ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 82/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13412 ms. Remains : 53/81 places, 82/154 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-00 finished in 13925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U (G((p0 U X(X(X(p1)))))||((p0 U X(X(X(p1))))&&X(p2)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 56 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 54 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 53 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 53 transition count 85
Applied a total of 68 rules in 14 ms. Remains 53 /81 variables (removed 28) and now considering 85/154 (removed 69) transitions.
[2025-06-04 01:16:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2025-06-04 01:16:57] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:16:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 01:16:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:16:57] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 01:16:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:16:57] [INFO ] Invariant cache hit.
[2025-06-04 01:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:16:58] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/134 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 65 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4788 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:02] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:03] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:03] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:03] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/134 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 84/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 153 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13914ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13917ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 85/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14156 ms. Remains : 53/81 places, 85/154 transitions.
Stuttering acceptance computed with spot in 607 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-01 finished in 14809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Graph (trivial) has 96 edges and 81 vertex of which 14 / 81 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 54 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 54 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 43 place count 54 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 49 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 48 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 48 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 46 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 46 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 44 transition count 99
Applied a total of 73 rules in 89 ms. Remains 44 /81 variables (removed 37) and now considering 99/154 (removed 55) transitions.
[2025-06-04 01:17:12] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 44 cols
[2025-06-04 01:17:12] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 01:17:12] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
[2025-06-04 01:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-04 01:17:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:17:12] [INFO ] Redundant transitions in 47 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-04 01:17:12] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
[2025-06-04 01:17:12] [INFO ] Invariant cache hit.
[2025-06-04 01:17:12] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:13] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:13] [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 01:17:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 85/129 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:17] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:17] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 85/129 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 85/160 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:19] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 161 constraints, problems are : Problem set: 0 solved, 85 unsolved in 7167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11529ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 11531ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/81 places, 99/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11912 ms. Remains : 44/81 places, 99/154 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-03 finished in 12089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (!p0&&G((X(X(X(p1)))||F(p2)))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 62 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 62 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 62 transition count 114
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 57 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 57 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 57 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 56 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 56 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 56 transition count 92
Applied a total of 62 rules in 8 ms. Remains 56 /81 variables (removed 25) and now considering 92/154 (removed 62) transitions.
[2025-06-04 01:17:24] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 56 cols
[2025-06-04 01:17:24] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 01:17:24] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-04 01:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:17:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 01:17:24] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-04 01:17:24] [INFO ] Invariant cache hit.
[2025-06-04 01:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 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 01:17:25] [INFO ] Deduced a trap composed of 18 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 01:17:25] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/12 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 01:17:26] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/13 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 01:17:26] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:26] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 87/143 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 72 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 5/15 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 01:17:31] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:31] [INFO ] Deduced a trap composed of 19 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 01:17:31] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 87/143 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 91/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 168 constraints, problems are : Problem set: 0 solved, 91 unsolved in 10654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16862ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 16869ms
Starting structural reductions in LTL mode, iteration 1 : 56/81 places, 92/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17077 ms. Remains : 56/81 places, 92/154 transitions.
Stuttering acceptance computed with spot in 1064 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-04 finished in 18191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0 U X(p1))) U X(p2)) U (p0&&(G((p0 U X(p1))) U X(p2))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 56 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 54 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 53 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 53 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 53 transition count 86
Applied a total of 67 rules in 13 ms. Remains 53 /81 variables (removed 28) and now considering 86/154 (removed 68) transitions.
[2025-06-04 01:17:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2025-06-04 01:17:42] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:42] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-04 01:17:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:17:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-04 01:17:42] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:17:42] [INFO ] Invariant cache hit.
[2025-06-04 01:17: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:43] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:43] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/135 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:45] [INFO ] Deduced a trap composed of 17 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 01:17:45] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 70 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5219 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:48] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/135 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 85/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 157 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8525 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13775ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 13778ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 86/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14031 ms. Remains : 53/81 places, 86/154 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-05 finished in 14427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(G(p1))) U (p1||G(p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 56 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 56 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 59 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 54 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 54 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 69 place count 54 transition count 85
Applied a total of 69 rules in 7 ms. Remains 54 /81 variables (removed 27) and now considering 85/154 (removed 69) transitions.
[2025-06-04 01:17:56] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 54 cols
[2025-06-04 01:17:56] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 01:17:56] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:17:57] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 01:17:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:17:57] [INFO ] Invariant cache hit.
[2025-06-04 01:17:57] [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, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/135 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 66 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:00] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:00] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:01] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 81/135 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 84/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 155 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6964 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10112ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 10112ms
Starting structural reductions in LTL mode, iteration 1 : 54/81 places, 85/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10260 ms. Remains : 54/81 places, 85/154 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 37 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-07-LTLFireability-06 finished in 11187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Graph (trivial) has 97 edges and 81 vertex of which 14 / 81 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 52 transition count 106
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 52 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 47 place count 52 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 46 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 46 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 43 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 43 transition count 75
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 43 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 42 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 42 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 42 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 40 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 89 place count 40 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 38 transition count 73
Applied a total of 91 rules in 24 ms. Remains 38 /81 variables (removed 43) and now considering 73/154 (removed 81) transitions.
[2025-06-04 01:18:08] [INFO ] Flow matrix only has 62 transitions (discarded 11 similar events)
// Phase 1: matrix 62 rows 38 cols
[2025-06-04 01:18:08] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 01:18:08] [INFO ] Flow matrix only has 62 transitions (discarded 11 similar events)
[2025-06-04 01:18:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 01:18:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:18:08] [INFO ] Redundant transitions in 32 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-04 01:18:08] [INFO ] Flow matrix only has 62 transitions (discarded 11 similar events)
[2025-06-04 01:18:08] [INFO ] Invariant cache hit.
[2025-06-04 01:18:08] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/99 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/100 variables, and 62 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:10] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 61/99 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 59/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/100 variables, and 122 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5496ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/81 places, 73/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5695 ms. Remains : 38/81 places, 73/154 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-07 finished in 5746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(p0))&&(p1||(p2 U (G(p2)||(p2&&G(p3))))))||G(p0))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 120
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 57 transition count 104
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 57 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 57 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 54 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 54 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 54 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 53 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 53 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 53 transition count 80
Applied a total of 73 rules in 7 ms. Remains 53 /81 variables (removed 28) and now considering 80/154 (removed 74) transitions.
[2025-06-04 01:18:13] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 53 cols
[2025-06-04 01:18:13] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 01:18:13] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:18:14] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-04 01:18:14] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:14] [INFO ] Invariant cache hit.
[2025-06-04 01:18:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:14] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:15] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/129 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:18] [INFO ] Deduced a trap composed of 9 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 01:18:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/130 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 79 unsolved in 8596 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:23] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/129 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 79/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7916 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16535ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 16536ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 80/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16732 ms. Remains : 53/81 places, 80/154 transitions.
Stuttering acceptance computed with spot in 1251 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-08
Product exploration explored 100000 steps with 10 reset in 343 ms.
Product exploration explored 100000 steps with 13 reset in 309 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 (NOT p1) p2 p0 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (AND (NOT p1) p3 p2 p0)), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (AND (NOT p1) p3 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (OR (AND p1 p3 p0) (AND p3 p2 p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 57 factoid took 574 ms. Reduced automaton from 16 states, 144 edges and 4 AP (stutter sensitive) to 16 states, 144 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1011 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (2085 resets) in 799 ms. (50 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4002 steps (34 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (29 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (24 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (35 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
[2025-06-04 01:18:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:34] [INFO ] Invariant cache hit.
[2025-06-04 01:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf20 is UNSAT
Problem apf22 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 3 ms to minimize.
Problem apf18 is UNSAT
Problem apf19 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 36/53 variables, 6/10 constraints. Problems are: Problem set: 8 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:34] [INFO ] Deduced a trap composed of 10 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 01:18:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 76/129 variables, 53/66 constraints. Problems are: Problem set: 8 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/67 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/68 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/68 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 68 constraints, problems are : Problem set: 8 solved, 12 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 12 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: 8 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 2/5 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 36/53 variables, 6/11 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 3/14 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 76/129 variables, 53/67 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 12/79 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/79 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/80 constraints. Problems are: Problem set: 8 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:35] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 1/81 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/81 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/81 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 81 constraints, problems are : Problem set: 8 solved, 12 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/20 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1627ms problems are : Problem set: 8 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 4466 steps, including 114 resets, run visited all 1 properties in 8 ms. (steps per millisecond=558 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 409 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (AND (NOT p1) p3 p2 p0)), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (AND (NOT p1) p3 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (OR (AND p1 p3 p0) (AND p3 p2 p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0)))), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR (NOT p0) (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3)))), (F (NOT (OR (AND p0 p1 p3) (AND p0 p2 p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT p2)), (F p1), (F (NOT p0)), (F (NOT p3)), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) (NOT p2) p3)))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 (NOT p2))))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (AND (OR p0 (NOT p1) (NOT p3)) (OR p0 (NOT p2) (NOT p3))))), (F (NOT (AND p0 (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 65 factoid took 1978 ms. Reduced automaton from 16 states, 144 edges and 4 AP (stutter sensitive) to 16 states, 110 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1045 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 976 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-04 01:18:40] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 01:18:40] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:18:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:18:40] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-04 01:18:40] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:40] [INFO ] Invariant cache hit.
[2025-06-04 01:18:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:41] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:41] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/129 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:44] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/130 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:45] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7567 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:48] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:48] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/129 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 79/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7925 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15511ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 15511ms
Finished structural reductions in LTL mode , in 1 iterations and 15701 ms. Remains : 53/53 places, 80/80 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 p0 p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p3), (X (NOT (AND (NOT p0) p2 p3))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 443 ms. Reduced automaton from 16 states, 110 edges and 4 AP (stutter sensitive) to 16 states, 110 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1049 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (2098 resets) in 486 ms. (82 steps per ms) remains 10/20 properties
BEST_FIRST walk for 40004 steps (308 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (309 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (324 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (306 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (328 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (312 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (300 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (332 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (309 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (321 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
[2025-06-04 01:18:58] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2025-06-04 01:18:58] [INFO ] Invariant cache hit.
[2025-06-04 01:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:58] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:58] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 36/53 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:58] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 76/129 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:58] [INFO ] Deduced a trap composed of 9 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 01:18:58] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 68 constraints, problems are : Problem set: 0 solved, 10 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 36/53 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:18:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 76/129 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 79 constraints, problems are : Problem set: 0 solved, 10 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1801ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 9 properties in 177 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 80/80 transitions.
Graph (trivial) has 48 edges and 53 vertex of which 12 / 53 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 164 edges and 47 vertex of which 30 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 30 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 21 place count 30 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 27 transition count 36
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 25 transition count 34
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 24 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 24 transition count 33
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 23 transition count 32
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 23 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 23 transition count 31
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 19 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 19 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 18 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
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 2 with 4 rules applied. Total rules applied 51 place count 15 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 14 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 14 transition count 18
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 58 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 12 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 12 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 12 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 67 place count 10 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 10 transition count 12
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 9 transition count 11
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 9 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 73 place count 6 transition count 9
Applied a total of 73 rules in 27 ms. Remains 6 /53 variables (removed 47) and now considering 9/80 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 6/53 places, 9/80 transitions.
RANDOM walk for 616 steps (60 resets) in 5 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p3), (X (NOT (AND (NOT p0) p2 p3))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p3))), (F (NOT (AND p0 p2 p3 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p2 p3))), (F (NOT p3)), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) p2 p3))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2) p3 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p3))))]
Knowledge based reduction with 39 factoid took 1679 ms. Reduced automaton from 16 states, 110 edges and 4 AP (stutter sensitive) to 16 states, 110 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1089 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1163 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1094 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 2 reset in 303 ms.
Product exploration explored 100000 steps with 7 reset in 459 ms.
Built C files in :
/tmp/ltsmin2073433486776184978
[2025-06-04 01:19:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2073433486776184978
Running compilation step : cd /tmp/ltsmin2073433486776184978;'/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 663 ms.
Running link step : cd /tmp/ltsmin2073433486776184978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin2073433486776184978;'/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/stateBased7758309525791699435.hoa' '--buchi-type=spotba'
LTSmin run took 1996 ms.
FORMULA HealthRecord-PT-07-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-07-LTLFireability-08 finished in 55760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Graph (trivial) has 82 edges and 81 vertex of which 14 / 81 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 52 transition count 106
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 52 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 47 place count 52 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 47 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 47 transition count 91
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 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 45 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 45 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 45 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 44 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 44 transition count 72
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 77 place count 44 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 42 transition count 68
Applied a total of 79 rules in 17 ms. Remains 42 /81 variables (removed 39) and now considering 68/154 (removed 86) transitions.
[2025-06-04 01:19:09] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-06-04 01:19:09] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-04 01:19:09] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2025-06-04 01:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:19:09] [INFO ] Redundant transitions in 16 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-04 01:19:09] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2025-06-04 01:19:09] [INFO ] Invariant cache hit.
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, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:10] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 58/100 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 53 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 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, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:11] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 58/100 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 109 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2589 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4287ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 4287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/81 places, 68/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4439 ms. Remains : 42/81 places, 68/154 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-10
Product exploration explored 100000 steps with 2 reset in 106 ms.
Product exploration explored 100000 steps with 1 reset in 119 ms.
Computed a total of 14 stabilizing places and 11 stable transitions
Computed a total of 14 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4010 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (653 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12160 steps, run visited all 1 properties in 57 ms. (steps per millisecond=213 )
Probabilistic random walk after 12160 steps, saw 2614 distinct states, run finished after 63 ms. (steps per millisecond=193 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2025-06-04 01:19:15] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2025-06-04 01:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 01:19:15] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2025-06-04 01:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:19:15] [INFO ] Redundant transitions in 23 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-04 01:19:15] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2025-06-04 01:19:15] [INFO ] Invariant cache hit.
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, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:15] [INFO ] Deduced a trap composed of 4 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 01:19:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 58/100 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 53 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2331 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 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, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:17] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:18] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 58/100 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 109 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5508ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5509ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5720 ms. Remains : 42/42 places, 68/68 transitions.
Computed a total of 14 stabilizing places and 11 stable transitions
Computed a total of 14 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4046 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (660 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12160 steps, run visited all 1 properties in 39 ms. (steps per millisecond=311 )
Probabilistic random walk after 12160 steps, saw 2614 distinct states, run finished after 39 ms. (steps per millisecond=311 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 99 ms.
Product exploration explored 100000 steps with 5 reset in 117 ms.
Built C files in :
/tmp/ltsmin13692657536134830825
[2025-06-04 01:19:21] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2025-06-04 01:19:21] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:19:21] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2025-06-04 01:19:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:19:21] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2025-06-04 01:19:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:19:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13692657536134830825
Running compilation step : cd /tmp/ltsmin13692657536134830825;'/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 346 ms.
Running link step : cd /tmp/ltsmin13692657536134830825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13692657536134830825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13852072658921406320.hoa' '--buchi-type=spotba'
LTSmin run took 196 ms.
FORMULA HealthRecord-PT-07-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-07-LTLFireability-10 finished in 12819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X((p0||G(p1)))))) U (p1&&X(p2))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 62 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 62 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 56 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 56 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 56 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 53 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 53 transition count 91
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 53 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 52 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 52 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 52 transition count 81
Applied a total of 72 rules in 5 ms. Remains 52 /81 variables (removed 29) and now considering 81/154 (removed 73) transitions.
[2025-06-04 01:19:22] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 52 cols
[2025-06-04 01:19:22] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 01:19:22] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2025-06-04 01:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:19:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-04 01:19:22] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2025-06-04 01:19:22] [INFO ] Invariant cache hit.
[2025-06-04 01:19:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:23] [INFO ] Deduced a trap composed of 14 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 01:19:23] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 77/129 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:27] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:28] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 77/129 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8844 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13717ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 13719ms
Starting structural reductions in LTL mode, iteration 1 : 52/81 places, 81/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13919 ms. Remains : 52/81 places, 81/154 transitions.
Stuttering acceptance computed with spot in 752 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-11 finished in 14726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U X(p1))&&(F(G(p2))||(p3 U p4))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 60 transition count 114
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 60 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 60 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 55 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 55 transition count 99
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 55 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 53 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 53 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 53 transition count 83
Applied a total of 71 rules in 7 ms. Remains 53 /81 variables (removed 28) and now considering 83/154 (removed 71) transitions.
[2025-06-04 01:19:37] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 53 cols
[2025-06-04 01:19:37] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 01:19:37] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:19:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-06-04 01:19:37] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:19:37] [INFO ] Invariant cache hit.
[2025-06-04 01:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:38] [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 01:19:38] [INFO ] Deduced a trap composed of 14 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 01:19:38] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:38] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:38] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 70 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5600 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:43] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:43] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:43] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:44] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 79/132 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 82/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 156 constraints, problems are : Problem set: 0 solved, 82 unsolved in 10214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15830ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 15831ms
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 83/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16045 ms. Remains : 53/81 places, 83/154 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4))), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p4)), (NOT p1), true, p0]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 2 reset in 92 ms.
Product exploration explored 100000 steps with 4 reset in 239 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p4) (NOT p3) (NOT p1) p2), (X p2), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p2 (NOT p4) p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p4) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p4) (NOT p3))), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 163 ms. Reduced automaton from 7 states, 16 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1) p0), (NOT p2), (NOT p1), true, p0, false, false]
RANDOM walk for 40000 steps (2097 resets) in 144 ms. (275 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (220 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2025-06-04 01:19:54] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:19:54] [INFO ] Invariant cache hit.
[2025-06-04 01:19:54] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/63 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 01:19:54] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2246 steps, including 118 resets, run visited all 1 properties in 7 ms. (steps per millisecond=320 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p4) (NOT p3) (NOT p1) p2), (X p2), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p2 (NOT p4) p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p4) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p4) (NOT p3))), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 21 factoid took 240 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-07-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-07-LTLFireability-12 finished in 17983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 154/154 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 59 transition count 112
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 59 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 59 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 54 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 54 transition count 98
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 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 52 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 52 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 52 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 51 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 51 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 51 transition count 79
Applied a total of 75 rules in 5 ms. Remains 51 /81 variables (removed 30) and now considering 79/154 (removed 75) transitions.
[2025-06-04 01:19:55] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2025-06-04 01:19:55] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 01:19:55] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 01:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:19:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:19:55] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-04 01:19:55] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 01:19:55] [INFO ] Invariant cache hit.
[2025-06-04 01:19:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 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 01:19:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/126 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 63 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3195 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 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 01:19:59] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:59] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:59] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:19:59] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/126 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 78/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8585 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11798ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 11798ms
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 79/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11998 ms. Remains : 51/81 places, 79/154 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-13 finished in 12202 ms.
All properties solved by simple procedures.
Total runtime 256609 ms.

BK_STOP 1749000007374

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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