Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K 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 69K 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-10-LTLFireability-00
FORMULA_NAME HealthRecord-PT-10-LTLFireability-01
FORMULA_NAME HealthRecord-PT-10-LTLFireability-02
FORMULA_NAME HealthRecord-PT-10-LTLFireability-03
FORMULA_NAME HealthRecord-PT-10-LTLFireability-04
FORMULA_NAME HealthRecord-PT-10-LTLFireability-05
FORMULA_NAME HealthRecord-PT-10-LTLFireability-06
FORMULA_NAME HealthRecord-PT-10-LTLFireability-07
FORMULA_NAME HealthRecord-PT-10-LTLFireability-08
FORMULA_NAME HealthRecord-PT-10-LTLFireability-09
FORMULA_NAME HealthRecord-PT-10-LTLFireability-10
FORMULA_NAME HealthRecord-PT-10-LTLFireability-11
FORMULA_NAME HealthRecord-PT-10-LTLFireability-12
FORMULA_NAME HealthRecord-PT-10-LTLFireability-13
FORMULA_NAME HealthRecord-PT-10-LTLFireability-14
FORMULA_NAME HealthRecord-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749001717347

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 01:48:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:48:40] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-06-04 01:48:40] [INFO ] Transformed 158 places.
[2025-06-04 01:48:40] [INFO ] Transformed 333 transitions.
[2025-06-04 01:48:40] [INFO ] Found NUPN structural information;
[2025-06-04 01:48:40] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 82 transition count 161
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 82 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 158 place count 76 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 164 place count 76 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 168 place count 76 transition count 145
Applied a total of 168 rules in 63 ms. Remains 76 /158 variables (removed 82) and now considering 145/306 (removed 161) transitions.
[2025-06-04 01:48:40] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 76 cols
[2025-06-04 01:48:40] [INFO ] Computed 11 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:48:41] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-06-04 01:48:41] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
[2025-06-04 01:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:48:41] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-04 01:48:41] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
[2025-06-04 01:48:41] [INFO ] Invariant cache hit.
[2025-06-04 01:48: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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:44] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:44] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:44] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:44] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 139/215 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 92 constraints, problems are : Problem set: 0 solved, 144 unsolved in 12471 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 139/215 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 144/235 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 236 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20267 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32991ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 33015ms
Starting structural reductions in LTL mode, iteration 1 : 76/158 places, 145/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33813 ms. Remains : 76/158 places, 145/306 transitions.
Support contains 32 out of 76 places after structural reductions.
[2025-06-04 01:49:15] [INFO ] Flatten gal took : 80 ms
[2025-06-04 01:49:15] [INFO ] Flatten gal took : 29 ms
[2025-06-04 01:49:15] [INFO ] Input system was already deterministic with 145 transitions.
RANDOM walk for 40000 steps (2535 resets) in 1572 ms. (25 steps per ms) remains 14/22 properties
BEST_FIRST walk for 40004 steps (187 resets) in 279 ms. (142 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (325 resets) in 368 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (325 resets) in 294 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (333 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (319 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (325 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (328 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (322 resets) in 108 ms. (367 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (322 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (330 resets) in 61 ms. (645 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (323 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (325 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (320 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (326 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
[2025-06-04 01:49:16] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
[2025-06-04 01:49:16] [INFO ] Invariant cache hit.
[2025-06-04 01:49:16] [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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 35/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:16] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/76 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:16] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:16] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:17] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 139/215 variables, 76/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:18] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1/216 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 102 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 35/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/76 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:19] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:19] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 139/215 variables, 76/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/216 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/216 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 116 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3942ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 10 properties in 528 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 145/145 transitions.
Graph (trivial) has 91 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 307 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 4 rules applied. Total rules applied 8 place count 67 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 66 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 66 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 15 place count 63 transition count 122
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 31 place count 47 transition count 90
Iterating global reduction 3 with 16 rules applied. Total rules applied 47 place count 47 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 47 transition count 88
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 55 place count 41 transition count 73
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 41 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 38 transition count 64
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 38 transition count 64
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 79 place count 38 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 37 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 91 place count 32 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 32 transition count 84
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 95 place count 32 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 98 place count 29 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 100 place count 29 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 29 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 105 place count 27 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 108 place count 27 transition count 135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 109 place count 26 transition count 102
Iterating global reduction 8 with 1 rules applied. Total rules applied 110 place count 26 transition count 102
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 111 place count 25 transition count 100
Iterating global reduction 8 with 1 rules applied. Total rules applied 112 place count 25 transition count 100
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 122 place count 25 transition count 90
Applied a total of 122 rules in 117 ms. Remains 25 /76 variables (removed 51) and now considering 90/145 (removed 55) transitions.
Running 74 sub problems to find dead transitions.
[2025-06-04 01:49:21] [INFO ] Flow matrix only has 72 transitions (discarded 18 similar events)
// Phase 1: matrix 72 rows 25 cols
[2025-06-04 01:49:21] [INFO ] Computed 8 invariants in 3 ms
[2025-06-04 01:49:21] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/97 variables, 25/33 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/54 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 54 constraints, problems are : Problem set: 2 solved, 72 unsolved in 2876 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 72 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 7/8 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 72/97 variables, 25/34 constraints. Problems are: Problem set: 2 solved, 72 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 20/54 constraints. Problems are: Problem set: 4 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 70/124 constraints. Problems are: Problem set: 4 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/124 constraints. Problems are: Problem set: 4 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/124 constraints. Problems are: Problem set: 4 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 124 constraints, problems are : Problem set: 4 solved, 70 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 70/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7376ms problems are : Problem set: 4 solved, 70 unsolved
Search for dead transitions found 4 dead transitions in 7377ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/76 places, 86/145 transitions.
Graph (complete) has 99 edges and 25 vertex of which 24 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 (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 24 transition count 79
Applied a total of 8 rules in 7 ms. Remains 24 /25 variables (removed 1) and now considering 79/86 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7503 ms. Remains : 24/76 places, 79/145 transitions.
RANDOM walk for 40000 steps (19 resets) in 968 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (16 resets) in 458 ms. (87 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 388 steps, run visited all 1 properties in 9 ms. (steps per millisecond=43 )
Probabilistic random walk after 388 steps, saw 169 distinct states, run finished after 15 ms. (steps per millisecond=25 ) properties seen :1
FORMULA HealthRecord-PT-10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 7 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((G(p1)&&p0)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Graph (trivial) has 78 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 53 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 48 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 48 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 49 place count 48 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 46 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 46 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 46 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 45 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 43 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 43 transition count 94
Applied a total of 68 rules in 36 ms. Remains 43 /76 variables (removed 33) and now considering 94/145 (removed 51) transitions.
[2025-06-04 01:49:29] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
// Phase 1: matrix 84 rows 43 cols
[2025-06-04 01:49:29] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 01:49:29] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
[2025-06-04 01:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 01:49:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:49:29] [INFO ] Redundant transitions in 41 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-04 01:49:29] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
[2025-06-04 01:49:29] [INFO ] Invariant cache hit.
[2025-06-04 01:49:29] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:30] [INFO ] Deduced a trap composed of 4 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 01:49:30] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 83/126 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 70 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:34] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 83/126 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 78/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 151 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10283ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 10285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/76 places, 94/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10529 ms. Remains : 43/76 places, 94/145 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-01 finished in 11030 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)&&(G((p1||G(p2))) U p3)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Graph (trivial) has 85 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 54 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 54 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 54 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 49 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 49 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 47 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 47 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 44 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 44 transition count 97
Applied a total of 66 rules in 48 ms. Remains 44 /76 variables (removed 32) and now considering 97/145 (removed 48) transitions.
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 86 transitions (discarded 11 similar events)
// Phase 1: matrix 86 rows 44 cols
[2025-06-04 01:49:40] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 86 transitions (discarded 11 similar events)
[2025-06-04 01:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-04 01:49:40] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:49:40] [INFO ] Redundant transitions in 44 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 86 transitions (discarded 11 similar events)
[2025-06-04 01:49:40] [INFO ] Invariant cache hit.
[2025-06-04 01:49:40] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 6/44 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 85/129 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:45] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 6/44 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 85/129 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 81/155 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 155 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10402ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10404ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/76 places, 97/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10727 ms. Remains : 44/76 places, 97/145 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-02 finished in 11098 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(F(p1))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 59 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 59 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 59 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 54 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 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 49 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 52 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 52 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 52 transition count 86
Applied a total of 59 rules in 6 ms. Remains 52 /76 variables (removed 24) and now considering 86/145 (removed 59) transitions.
[2025-06-04 01:49:51] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2025-06-04 01:49:51] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 01:49:51] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:49:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-04 01:49:51] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:49:51] [INFO ] Invariant cache hit.
[2025-06-04 01:49: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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:52] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 64 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:57] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:57] [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 01:49:57] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/134 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 153 constraints, problems are : Problem set: 0 solved, 85 unsolved in 10201 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15506ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 15507ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 86/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15668 ms. Remains : 52/76 places, 86/145 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-03 finished in 15786 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(X(p0))) U (p1||X(X(G(p2))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 60 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 55 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 55 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 47 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 52 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 52 transition count 91
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 61 place count 52 transition count 83
Applied a total of 61 rules in 6 ms. Remains 52 /76 variables (removed 24) and now considering 83/145 (removed 62) transitions.
[2025-06-04 01:50:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 52 cols
[2025-06-04 01:50:07] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 01:50:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:50:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-06-04 01:50:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:07] [INFO ] Invariant cache hit.
[2025-06-04 01:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:08] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:08] [INFO ] Deduced a trap composed of 13 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 01:50:08] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:12] [INFO ] Deduced a trap composed of 16 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 01:50:12] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:12] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:12] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 151 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8793 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13031ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 13032ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 83/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13178 ms. Remains : 52/76 places, 83/145 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 1361 reset in 428 ms.
Product exploration explored 100000 steps with 1899 reset in 218 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/52 stabilizing places and 7/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (2526 resets) in 584 ms. (68 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (328 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-06-04 01:50:22] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:22] [INFO ] Invariant cache hit.
[2025-06-04 01:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/52 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 01:50:22] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:22] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 79/131 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 775 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-04 01:50:24] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 01:50:24] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:50:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-06-04 01:50:24] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:24] [INFO ] Invariant cache hit.
[2025-06-04 01:50: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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:25] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4534 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:29] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:29] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 151 constraints, problems are : Problem set: 0 solved, 82 unsolved in 9328 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13883ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 13883ms
Finished structural reductions in LTL mode , in 1 iterations and 14116 ms. Remains : 52/52 places, 83/83 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/52 stabilizing places and 7/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (2499 resets) in 294 ms. (135 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (328 resets) in 163 ms. (243 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (325 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2025-06-04 01:50:38] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2025-06-04 01:50:38] [INFO ] Invariant cache hit.
[2025-06-04 01:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/52 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 01:50:39] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:39] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 79/131 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 707 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Product exploration explored 100000 steps with 1324 reset in 115 ms.
Product exploration explored 100000 steps with 1708 reset in 137 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 83/83 transitions.
Graph (trivial) has 46 edges and 52 vertex of which 10 / 52 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 76
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 46 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 46 transition count 116
Deduced a syphon composed of 5 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 10 place count 46 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 16 ms. Remains 46 /52 variables (removed 6) and now considering 115/83 (removed -32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:50:42] [INFO ] Redundant transitions in 26 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-04 01:50:42] [INFO ] Flow matrix only has 99 transitions (discarded 16 similar events)
// Phase 1: matrix 99 rows 46 cols
[2025-06-04 01:50:42] [INFO ] Computed 9 invariants in 1 ms
[2025-06-04 01:50:42] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 4 places in 39 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 01:50:43] [INFO ] Deduced a trap composed of 4 places in 41 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 01:50:43] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 5 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:43] [INFO ] Deduced a trap composed of 5 places in 79 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 01:50:43] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 9/18 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 98/144 variables, 46/64 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 15/79 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/79 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/80 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 80 constraints, problems are : Problem set: 10 solved, 89 unsolved in 6681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/46 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 9/18 constraints. Problems are: Problem set: 10 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:49] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/19 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 98/144 variables, 46/65 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 15/80 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 89/169 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/170 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/170 constraints. Problems are: Problem set: 10 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/170 constraints. Problems are: Problem set: 10 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 170 constraints, problems are : Problem set: 10 solved, 89 unsolved in 12011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 89/99 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18721ms problems are : Problem set: 10 solved, 89 unsolved
Search for dead transitions found 10 dead transitions in 18723ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 105/83 transitions.
Graph (complete) has 178 edges and 46 vertex of which 41 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 41 /46 variables (removed 5) and now considering 105/105 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/52 places, 105/83 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18777 ms. Remains : 41/52 places, 105/83 transitions.
Built C files in :
/tmp/ltsmin17993980333069205270
[2025-06-04 01:51:00] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17993980333069205270
Running compilation step : cd /tmp/ltsmin17993980333069205270;'/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 610 ms.
Running link step : cd /tmp/ltsmin17993980333069205270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin17993980333069205270;'/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/stateBased4316322348848584309.hoa' '--buchi-type=spotba'
LTSmin run took 362 ms.
FORMULA HealthRecord-PT-10-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-05 finished in 54762 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&&G((X(X(p0))||F(p1)))))&&X(p2)))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 60 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 57 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 57 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 57 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 56 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 56 transition count 98
Applied a total of 48 rules in 7 ms. Remains 56 /76 variables (removed 20) and now considering 98/145 (removed 47) transitions.
[2025-06-04 01:51:01] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 56 cols
[2025-06-04 01:51:02] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:02] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 01:51:02] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2025-06-04 01:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:51:02] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-04 01:51:02] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2025-06-04 01:51:02] [INFO ] Invariant cache hit.
[2025-06-04 01:51:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:03] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:03] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/150 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:06] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 70 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:09] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:09] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:09] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/150 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 97/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 170 constraints, problems are : Problem set: 0 solved, 97 unsolved in 12522 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19416ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 19417ms
Starting structural reductions in LTL mode, iteration 1 : 56/76 places, 98/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19645 ms. Remains : 56/76 places, 98/145 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-06
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-06 finished in 20066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Graph (trivial) has 90 edges and 76 vertex of which 10 / 76 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 52 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 52 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 52 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 46 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 46 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 46 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 43 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 43 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 68 place count 43 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 40 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 40 transition count 81
Applied a total of 77 rules in 23 ms. Remains 40 /76 variables (removed 36) and now considering 81/145 (removed 64) transitions.
[2025-06-04 01:51:22] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 40 cols
[2025-06-04 01:51:22] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 01:51:22] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2025-06-04 01:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 01:51:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:51:22] [INFO ] Redundant transitions in 36 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-04 01:51:22] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2025-06-04 01:51:22] [INFO ] Invariant cache hit.
[2025-06-04 01:51:22] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 71/111 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 65 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3312 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:26] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 71/111 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 65/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 131 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4620 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7954ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/76 places, 81/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8224 ms. Remains : 40/76 places, 81/145 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-07 finished in 8339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (X(p1) U p2))||G(p3)))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 60 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 55 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 53 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 53 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 53 transition count 88
Applied a total of 57 rules in 7 ms. Remains 53 /76 variables (removed 23) and now considering 88/145 (removed 57) transitions.
[2025-06-04 01:51:30] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2025-06-04 01:51:30] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 01:51:30] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:51:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:51:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-04 01:51:30] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:51:30] [INFO ] Invariant cache hit.
[2025-06-04 01:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:31] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/137 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 66 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:37] [INFO ] Deduced a trap composed of 11 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 01:51:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:37] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 84/137 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 87/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 158 constraints, problems are : Problem set: 0 solved, 87 unsolved in 10133 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16299ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 16301ms
Starting structural reductions in LTL mode, iteration 1 : 53/76 places, 88/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16491 ms. Remains : 53/76 places, 88/145 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p3), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND p3 (NOT p1))), (X (NOT p1)), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 31 factoid took 154 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p3)]
RANDOM walk for 40000 steps (2514 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (329 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 95961 steps, run visited all 1 properties in 232 ms. (steps per millisecond=413 )
Probabilistic random walk after 95961 steps, saw 14292 distinct states, run finished after 233 ms. (steps per millisecond=411 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p3), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND p3 (NOT p1))), (X (NOT p1)), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 31 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-08 finished in 17608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||((p1||X(F(p2))) U X(X(p1))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 60 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 60 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 55 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 55 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 52 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 52 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 59 place count 52 transition count 84
Applied a total of 59 rules in 3 ms. Remains 52 /76 variables (removed 24) and now considering 84/145 (removed 61) transitions.
[2025-06-04 01:51:48] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 52 cols
[2025-06-04 01:51:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 01:51:48] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
[2025-06-04 01:51:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:51:48] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-04 01:51:48] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
[2025-06-04 01:51:48] [INFO ] Invariant cache hit.
[2025-06-04 01:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:49] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:53] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 79/131 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 83/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 151 constraints, problems are : Problem set: 0 solved, 83 unsolved in 9025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14097ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 14097ms
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 84/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14277 ms. Remains : 52/76 places, 84/145 transitions.
Stuttering acceptance computed with spot in 572 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-11 finished in 14883 ms.
All properties solved by simple procedures.
Total runtime 202860 ms.

BK_STOP 1749001922947

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-10"
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-10, 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-174867008200612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 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 ;