MCC'2025- Execution of r100-smll-174867008200636

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HealthRecord-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 71K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HealthRecord-PT-13-LTLFireability-00
FORMULA_NAME HealthRecord-PT-13-LTLFireability-01
FORMULA_NAME HealthRecord-PT-13-LTLFireability-02
FORMULA_NAME HealthRecord-PT-13-LTLFireability-03
FORMULA_NAME HealthRecord-PT-13-LTLFireability-04
FORMULA_NAME HealthRecord-PT-13-LTLFireability-05
FORMULA_NAME HealthRecord-PT-13-LTLFireability-06
FORMULA_NAME HealthRecord-PT-13-LTLFireability-07
FORMULA_NAME HealthRecord-PT-13-LTLFireability-08
FORMULA_NAME HealthRecord-PT-13-LTLFireability-09
FORMULA_NAME HealthRecord-PT-13-LTLFireability-10
FORMULA_NAME HealthRecord-PT-13-LTLFireability-11
FORMULA_NAME HealthRecord-PT-13-LTLFireability-12
FORMULA_NAME HealthRecord-PT-13-LTLFireability-13
FORMULA_NAME HealthRecord-PT-13-LTLFireability-14
FORMULA_NAME HealthRecord-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749004318988

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 02:32:01] [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 02:32:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:32:01] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2025-06-04 02:32:01] [INFO ] Transformed 161 places.
[2025-06-04 02:32:01] [INFO ] Transformed 341 transitions.
[2025-06-04 02:32:01] [INFO ] Found NUPN structural information;
[2025-06-04 02:32:02] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 78 transition count 155
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 78 transition count 155
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 172 place count 72 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 178 place count 72 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 181 place count 72 transition count 140
Applied a total of 181 rules in 76 ms. Remains 72 /161 variables (removed 89) and now considering 140/313 (removed 173) transitions.
[2025-06-04 02:32:02] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 72 cols
[2025-06-04 02:32:02] [INFO ] Computed 10 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:02] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-04 02:32:02] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2025-06-04 02:32:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:32:03] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-04 02:32:03] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2025-06-04 02:32:03] [INFO ] Invariant cache hit.
[2025-06-04 02:32:03] [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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:05] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:06] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:06] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:07] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:07] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:07] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:08] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:08] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:09] [INFO ] Deduced a trap composed of 26 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 02:32:09] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 135/207 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:11] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 1/208 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 95 constraints, problems are : Problem set: 0 solved, 139 unsolved in 14846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:19] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:19] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 135/207 variables, 72/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 139/240 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 1/208 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 241 constraints, problems are : Problem set: 0 solved, 139 unsolved in 27260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42387ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 42415ms
Starting structural reductions in LTL mode, iteration 1 : 72/161 places, 140/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43275 ms. Remains : 72/161 places, 140/313 transitions.
Support contains 26 out of 72 places after structural reductions.
[2025-06-04 02:32:45] [INFO ] Flatten gal took : 50 ms
[2025-06-04 02:32:45] [INFO ] Flatten gal took : 25 ms
[2025-06-04 02:32:45] [INFO ] Input system was already deterministic with 140 transitions.
RANDOM walk for 40000 steps (3099 resets) in 2743 ms. (14 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40004 steps (436 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (434 resets) in 132 ms. (300 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (446 resets) in 108 ms. (367 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (429 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (440 resets) in 111 ms. (357 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (437 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (425 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (453 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
[2025-06-04 02:32:47] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2025-06-04 02:32:47] [INFO ] Invariant cache hit.
[2025-06-04 02:32:47] [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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/72 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 135/207 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/208 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 90 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 33/72 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:48] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/207 variables, 72/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/208 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 97 constraints, problems are : Problem set: 0 solved, 6 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1797ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 3 properties in 421 ms.
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 140/140 transitions.
Graph (trivial) has 77 edges and 72 vertex of which 6 / 72 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 286 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 128
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 67 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 67 transition count 126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 66 transition count 126
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 19 place count 54 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 54 transition count 99
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 38 place count 50 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 50 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 45 place count 50 transition count 86
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 47 place count 48 transition count 82
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 48 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 55 place count 48 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 59 place count 46 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 71 place count 40 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 40 transition count 108
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 76 place count 40 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 79 place count 37 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 37 transition count 103
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 37 transition count 233
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 86 place count 35 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 90 place count 35 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 91 place count 34 transition count 182
Iterating global reduction 7 with 1 rules applied. Total rules applied 92 place count 34 transition count 182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 93 place count 33 transition count 180
Iterating global reduction 7 with 1 rules applied. Total rules applied 94 place count 33 transition count 180
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 109 place count 33 transition count 165
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 118 place count 33 transition count 165
Applied a total of 118 rules in 156 ms. Remains 33 /72 variables (removed 39) and now considering 165/140 (removed -25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 33/72 places, 165/140 transitions.
RANDOM walk for 40000 steps (26 resets) in 439 ms. (90 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (27 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
[2025-06-04 02:32:49] [INFO ] Flow matrix only has 123 transitions (discarded 42 similar events)
// Phase 1: matrix 123 rows 33 cols
[2025-06-04 02:32:49] [INFO ] Computed 9 invariants in 4 ms
[2025-06-04 02:32:49] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/33 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:49] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:49] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/156 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/33 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:50] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 123/156 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 28/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 8 ms.
FORMULA HealthRecord-PT-13-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 14 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' '!((F(p0)||X((p1||G(p2)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 59 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 59 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 29 place count 59 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 54 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 54 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 51 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 51 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 57 place count 51 transition count 80
Applied a total of 57 rules in 12 ms. Remains 51 /72 variables (removed 21) and now considering 80/140 (removed 60) transitions.
[2025-06-04 02:32:50] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 51 cols
[2025-06-04 02:32:50] [INFO ] Computed 10 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:50] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 02:32:50] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2025-06-04 02:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:32:51] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-04 02:32:51] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2025-06-04 02:32:51] [INFO ] Invariant cache hit.
[2025-06-04 02:32:51] [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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 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 02:32:52] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:32:52] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/12 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 02:32:52] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/13 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 02:32:52] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 75/126 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 66 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 75/126 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 79/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13314ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 13315ms
Starting structural reductions in LTL mode, iteration 1 : 51/72 places, 80/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13555 ms. Remains : 51/72 places, 80/140 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 481 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/51 stabilizing places and 6/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 27 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLFireability-01 finished in 15032 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 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Graph (trivial) has 80 edges and 72 vertex of which 8 / 72 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 48 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 48 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 45 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 60 place count 45 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 43 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 43 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 42 transition count 85
Applied a total of 67 rules in 28 ms. Remains 42 /72 variables (removed 30) and now considering 85/140 (removed 55) transitions.
[2025-06-04 02:33:05] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
// Phase 1: matrix 77 rows 42 cols
[2025-06-04 02:33:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 02:33:05] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
[2025-06-04 02:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:33:05] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:33:05] [INFO ] Redundant transitions in 33 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-04 02:33:05] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
[2025-06-04 02:33:05] [INFO ] Invariant cache hit.
[2025-06-04 02:33:05] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:06] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 76/118 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 67 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 76/118 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 71/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 138 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4556 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7789ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 7790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/72 places, 85/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8005 ms. Remains : 42/72 places, 85/140 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-02 finished in 8063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(G(p1))) U X(X(X(X(!p1))))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 59 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 59 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 29 place count 59 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 55 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 53 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 53 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 53 transition count 89
Applied a total of 50 rules in 14 ms. Remains 53 /72 variables (removed 19) and now considering 89/140 (removed 51) transitions.
[2025-06-04 02:33:13] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2025-06-04 02:33:13] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 02:33:13] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:33:14] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 02:33:14] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:14] [INFO ] Invariant cache hit.
[2025-06-04 02:33: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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:15] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:18] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/139 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 66 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6532 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:21] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:21] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 156 constraints, problems are : Problem set: 0 solved, 88 unsolved in 10071 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16642ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 16642ms
Starting structural reductions in LTL mode, iteration 1 : 53/72 places, 89/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16826 ms. Remains : 53/72 places, 89/140 transitions.
Stuttering acceptance computed with spot in 892 ms :[(NOT p0), p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, (OR (NOT p0) p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 200 ms.
Product exploration explored 100000 steps with 20000 reset in 420 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 p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 17 states, 34 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 505 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (3102 resets) in 378 ms. (105 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (454 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (429 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (428 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
[2025-06-04 02:33:33] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:33] [INFO ] Invariant cache hit.
[2025-06-04 02:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:33] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 66 constraints, problems are : Problem set: 0 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 85/138 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 70 constraints, problems are : Problem set: 0 solved, 3 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 728 steps, including 33 resets, run visited all 1 properties in 4 ms. (steps per millisecond=182 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 27 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 552 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-06-04 02:33:35] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 02:33:35] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:33:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 02:33:35] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:35] [INFO ] Invariant cache hit.
[2025-06-04 02:33:35] [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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:36] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:38] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/139 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 66 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6055 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:41] [INFO ] Deduced a trap composed of 11 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 02:33:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 156 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8968 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15055ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15056ms
Finished structural reductions in LTL mode , in 1 iterations and 15247 ms. Remains : 53/53 places, 89/89 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 (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (3114 resets) in 241 ms. (165 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (446 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (418 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (434 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
[2025-06-04 02:33:51] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 02:33:51] [INFO ] Invariant cache hit.
[2025-06-04 02:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:51] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 66 constraints, problems are : Problem set: 0 solved, 3 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/53 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 85/138 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:51] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 70 constraints, problems are : Problem set: 0 solved, 3 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1154 steps, including 54 resets, run visited all 1 properties in 6 ms. (steps per millisecond=192 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 571 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 576 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 566 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 20000 reset in 229 ms.
Product exploration explored 100000 steps with 20000 reset in 299 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 586 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 89/89 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 6 / 53 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 49 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 49 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 49 transition count 128
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 127
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 30 ms. Remains 49 /53 variables (removed 4) and now considering 127/89 (removed -38) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:33:55] [INFO ] Redundant transitions in 44 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-04 02:33:55] [INFO ] Flow matrix only has 112 transitions (discarded 15 similar events)
// Phase 1: matrix 112 rows 49 cols
[2025-06-04 02:33:55] [INFO ] Computed 9 invariants in 3 ms
[2025-06-04 02:33:55] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:56] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:56] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:56] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:56] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:57] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:57] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 6 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:57] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 111/160 variables, 49/66 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 17/83 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/84 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/84 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/84 constraints. Problems are: Problem set: 12 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 84 constraints, problems are : Problem set: 12 solved, 99 unsolved in 7130 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 7/49 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:03] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/18 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 111/160 variables, 49/67 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 17/84 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 99/183 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/183 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/184 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/184 constraints. Problems are: Problem set: 12 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/184 constraints. Problems are: Problem set: 12 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 184 constraints, problems are : Problem set: 12 solved, 99 unsolved in 13630 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 99/111 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20824ms problems are : Problem set: 12 solved, 99 unsolved
Search for dead transitions found 12 dead transitions in 20826ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/53 places, 115/89 transitions.
Graph (complete) has 194 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 43 /49 variables (removed 6) and now considering 115/115 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/53 places, 115/89 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20918 ms. Remains : 43/53 places, 115/89 transitions.
Built C files in :
/tmp/ltsmin8103923053785907093
[2025-06-04 02:34:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8103923053785907093
Running compilation step : cd /tmp/ltsmin8103923053785907093;'/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 551 ms.
Running link step : cd /tmp/ltsmin8103923053785907093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin8103923053785907093;'/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/stateBased14036212516916938012.hoa' '--buchi-type=spotba'
LTSmin run took 925 ms.
FORMULA HealthRecord-PT-13-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLFireability-04 finished in 64252 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) U (G(p1)||X(p2))) U X(!p0)))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 59 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 59 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 29 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 54 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 54 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 51 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 51 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 57 place count 51 transition count 81
Applied a total of 57 rules in 7 ms. Remains 51 /72 variables (removed 21) and now considering 81/140 (removed 59) transitions.
[2025-06-04 02:34:18] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2025-06-04 02:34:18] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 02:34:18] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2025-06-04 02:34:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:34:18] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-04 02:34:18] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2025-06-04 02:34:18] [INFO ] Invariant cache hit.
[2025-06-04 02:34:18] [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, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 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 02:34:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 77/128 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 63 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 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 02:34:23] [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 02:34:23] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:23] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 77/128 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/147 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 02:34:27] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/148 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 02:34:29] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 149 constraints, problems are : Problem set: 0 solved, 80 unsolved in 11698 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16369ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 16371ms
Starting structural reductions in LTL mode, iteration 1 : 51/72 places, 81/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16524 ms. Remains : 51/72 places, 81/140 transitions.
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-05 finished in 16925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(p1)))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 58 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 55 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 55 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 53 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 47 place count 53 transition count 92
Applied a total of 47 rules in 7 ms. Remains 53 /72 variables (removed 19) and now considering 92/140 (removed 48) transitions.
[2025-06-04 02:34:35] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 53 cols
[2025-06-04 02:34:35] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 02:34:35] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:34:35] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 02:34:35] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:35] [INFO ] Invariant cache hit.
[2025-06-04 02:34:35] [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, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:36] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/141 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 65 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5441 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:41] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:41] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:41] [INFO ] Deduced a trap composed of 19 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 02:34:41] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/141 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 91/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 8386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13865ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 13865ms
Starting structural reductions in LTL mode, iteration 1 : 53/72 places, 92/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14070 ms. Remains : 53/72 places, 92/140 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 237 ms.
Product exploration explored 100000 steps with 25000 reset in 302 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3124 resets) in 191 ms. (208 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (438 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2025-06-04 02:34:50] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:50] [INFO ] Invariant cache hit.
[2025-06-04 02:34:50] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/53 variables, 8/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) 88/141 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:50] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 26/142 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/9 constraints, State Equation: 0/53 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2025-06-04 02:34:51] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 02:34:51] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:34:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:34:51] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 02:34:51] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:34:51] [INFO ] Invariant cache hit.
[2025-06-04 02:34:51] [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, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:52] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:52] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/141 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 65 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:57] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:34:57] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/141 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 91/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 8226 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13552ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 13552ms
Finished structural reductions in LTL mode , in 1 iterations and 13690 ms. Remains : 53/53 places, 92/92 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3105 resets) in 113 ms. (350 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Product exploration explored 100000 steps with 25000 reset in 235 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 270 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 92/92 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 8 / 53 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 48 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 48 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 36 ms. Remains 48 /53 variables (removed 5) and now considering 136/92 (removed -44) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:35:07] [INFO ] Redundant transitions in 48 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-04 02:35:07] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
// Phase 1: matrix 116 rows 48 cols
[2025-06-04 02:35:07] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 02:35:07] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:09] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 115/163 variables, 48/65 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 20/85 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/85 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/86 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 86 constraints, problems are : Problem set: 12 solved, 108 unsolved in 7442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 7/48 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:15] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/18 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 115/163 variables, 48/66 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 20/86 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 108/194 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/195 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/195 constraints. Problems are: Problem set: 12 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/195 constraints. Problems are: Problem set: 12 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 195 constraints, problems are : Problem set: 12 solved, 108 unsolved in 15315 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 108/120 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22835ms problems are : Problem set: 12 solved, 108 unsolved
Search for dead transitions found 12 dead transitions in 22836ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/53 places, 124/92 transitions.
Graph (complete) has 199 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 42 /48 variables (removed 6) and now considering 124/124 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/53 places, 124/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22945 ms. Remains : 42/53 places, 124/92 transitions.
Built C files in :
/tmp/ltsmin9805177065968613860
[2025-06-04 02:35:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9805177065968613860
Running compilation step : cd /tmp/ltsmin9805177065968613860;'/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 397 ms.
Running link step : cd /tmp/ltsmin9805177065968613860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9805177065968613860;'/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/stateBased13044925927994214670.hoa' '--buchi-type=spotba'
LTSmin run took 1245 ms.
FORMULA HealthRecord-PT-13-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLFireability-06 finished in 56963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p0)||X(X(X(X(F(p1))))))))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 58 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 54 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 54 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 52 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 52 transition count 87
Applied a total of 52 rules in 4 ms. Remains 52 /72 variables (removed 20) and now considering 87/140 (removed 53) transitions.
[2025-06-04 02:35:31] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2025-06-04 02:35:31] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:35:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 02:35:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2025-06-04 02:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:35:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:35:32] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-04 02:35:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2025-06-04 02:35:32] [INFO ] Invariant cache hit.
[2025-06-04 02:35:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:32] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:33] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 83/135 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 66 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5922 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 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, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:38] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:38] [INFO ] Deduced a trap composed of 17 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 02:35:38] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 83/135 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 86/154 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 155 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15000ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 15001ms
Starting structural reductions in LTL mode, iteration 1 : 52/72 places, 87/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15193 ms. Remains : 52/72 places, 87/140 transitions.
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-09 finished in 15674 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((X(X(F(p1)))||G(p2))))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Graph (trivial) has 75 edges and 72 vertex of which 8 / 72 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 109
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 54 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 50 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 50 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 47 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 47 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 59 place count 47 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 46 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 73 place count 40 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 82 place count 40 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 39 transition count 110
Applied a total of 84 rules in 22 ms. Remains 39 /72 variables (removed 33) and now considering 110/140 (removed 30) transitions.
[2025-06-04 02:35:47] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
// Phase 1: matrix 92 rows 39 cols
[2025-06-04 02:35:47] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:35:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 02:35:47] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
[2025-06-04 02:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:35:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-04 02:35:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:35:47] [INFO ] Redundant transitions in 38 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-04 02:35:47] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
[2025-06-04 02:35:47] [INFO ] Invariant cache hit.
[2025-06-04 02:35:47] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:48] [INFO ] Deduced a trap composed of 5 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 02:35:48] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 91/130 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 69 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4282 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:35:52] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 91/130 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 94/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 164 constraints, problems are : Problem set: 0 solved, 94 unsolved in 12279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16592ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 16592ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/72 places, 110/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16805 ms. Remains : 39/72 places, 110/140 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-10 finished in 17072 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 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Graph (trivial) has 80 edges and 72 vertex of which 8 / 72 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 48 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 48 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 48 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 46 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 46 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 46 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 44 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 44 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 43 transition count 91
Applied a total of 63 rules in 34 ms. Remains 43 /72 variables (removed 29) and now considering 91/140 (removed 49) transitions.
[2025-06-04 02:36:04] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 43 cols
[2025-06-04 02:36:04] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 02:36:04] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 02:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 02:36:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:36:05] [INFO ] Redundant transitions in 69 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-04 02:36:05] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 02:36:05] [INFO ] Invariant cache hit.
[2025-06-04 02:36:05] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:05] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:05] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:05] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:06] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/124 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 71 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:09] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:09] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 77/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 150 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5344 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8938ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 8939ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/72 places, 91/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9251 ms. Remains : 43/72 places, 91/140 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 25 reset in 118 ms.
Product exploration explored 100000 steps with 1 reset in 265 ms.
Computed a total of 12 stabilizing places and 28 stable transitions
Computed a total of 12 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
RANDOM walk for 23679 steps (2484 resets) in 91 ms. (257 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-04 02:36:14] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 02:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:14] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 02:36:14] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 02:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 02:36:15] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:36:15] [INFO ] Redundant transitions in 36 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-04 02:36:15] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 02:36:15] [INFO ] Invariant cache hit.
[2025-06-04 02:36:15] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:15] [INFO ] Deduced a trap composed of 14 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 02:36:16] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:16] [INFO ] Deduced a trap composed of 14 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 02:36:16] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/124 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 71 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3784 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:19] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 77/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 150 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3965 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7768ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 7769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7978 ms. Remains : 43/43 places, 91/91 transitions.
Computed a total of 12 stabilizing places and 28 stable transitions
Computed a total of 12 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 33545 steps (3466 resets) in 98 ms. (338 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13 reset in 108 ms.
Product exploration explored 100000 steps with 10 reset in 413 ms.
Built C files in :
/tmp/ltsmin4920423626925379361
[2025-06-04 02:36:23] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-06-04 02:36:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:36:23] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-06-04 02:36:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:36:23] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-06-04 02:36:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 02:36:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4920423626925379361
Running compilation step : cd /tmp/ltsmin4920423626925379361;'/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 367 ms.
Running link step : cd /tmp/ltsmin4920423626925379361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4920423626925379361;'/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/stateBased7548300923667119390.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA HealthRecord-PT-13-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLFireability-12 finished in 19789 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(X(G((p1||G(p2)))))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 59 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 59 transition count 115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 55 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 55 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 53 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 47 place count 53 transition count 91
Applied a total of 47 rules in 4 ms. Remains 53 /72 variables (removed 19) and now considering 91/140 (removed 49) transitions.
[2025-06-04 02:36:24] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2025-06-04 02:36:24] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 02:36:24] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:36:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:36:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-04 02:36:24] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2025-06-04 02:36:24] [INFO ] Invariant cache hit.
[2025-06-04 02:36: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:25] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 87/140 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 65 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:30] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:30] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 87/140 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 90/157 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 158 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11456 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16335ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 16335ms
Starting structural reductions in LTL mode, iteration 1 : 53/72 places, 91/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16557 ms. Remains : 53/72 places, 91/140 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-14 finished in 16836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(F(p1))&&F(p2))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 140/140 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 58 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 54 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 54 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 52 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 52 transition count 87
Applied a total of 52 rules in 5 ms. Remains 52 /72 variables (removed 20) and now considering 87/140 (removed 53) transitions.
[2025-06-04 02:36:41] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2025-06-04 02:36:41] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-04 02:36:41] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2025-06-04 02:36:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:36:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:36:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-04 02:36:41] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2025-06-04 02:36:41] [INFO ] Invariant cache hit.
[2025-06-04 02:36:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:42] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 83/135 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 64 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 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, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:36:46] [INFO ] Deduced a trap composed of 11 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 02:36:47] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 83/135 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 86/151 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 152 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14394ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 14395ms
Starting structural reductions in LTL mode, iteration 1 : 52/72 places, 87/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14581 ms. Remains : 52/72 places, 87/140 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-15 finished in 14826 ms.
All properties solved by simple procedures.
Total runtime 294532 ms.

BK_STOP 1749004616231

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-13"
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-13, 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-174867008200636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 execution
cd execution
if [ "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 ;