Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 50K 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-04-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748997859874

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 00:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 00:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:44:22] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-04 00:44:22] [INFO ] Transformed 123 places.
[2025-06-04 00:44:22] [INFO ] Transformed 239 transitions.
[2025-06-04 00:44:22] [INFO ] Found NUPN structural information;
[2025-06-04 00:44:22] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA HealthRecord-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 231/231 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 78 transition count 146
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 78 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 76 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 76 transition count 142
Applied a total of 94 rules in 48 ms. Remains 76 /123 variables (removed 47) and now considering 142/231 (removed 89) transitions.
[2025-06-04 00:44:23] [INFO ] Flow matrix only has 139 transitions (discarded 3 similar events)
// Phase 1: matrix 139 rows 76 cols
[2025-06-04 00:44:23] [INFO ] Computed 9 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:44:23] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-06-04 00:44:23] [INFO ] Flow matrix only has 139 transitions (discarded 3 similar events)
[2025-06-04 00:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:44:24] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-04 00:44:24] [INFO ] Flow matrix only has 139 transitions (discarded 3 similar events)
[2025-06-04 00:44:24] [INFO ] Invariant cache hit.
[2025-06-04 00:44: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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:26] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:26] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:27] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:28] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:28] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:28] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:28] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:29] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:29] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:29] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:29] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 138/214 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/215 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 98 constraints, problems are : Problem set: 0 solved, 141 unsolved in 14612 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 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, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:40] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:40] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 138/214 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 141/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:44:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 215/215 variables, and 243 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44823ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 44844ms
Starting structural reductions in LTL mode, iteration 1 : 76/123 places, 142/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45653 ms. Remains : 76/123 places, 142/231 transitions.
Support contains 32 out of 76 places after structural reductions.
[2025-06-04 00:45:09] [INFO ] Flatten gal took : 45 ms
[2025-06-04 00:45:09] [INFO ] Flatten gal took : 20 ms
[2025-06-04 00:45:09] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 31 out of 76 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (3164 resets) in 2362 ms. (16 steps per ms) remains 8/22 properties
BEST_FIRST walk for 40004 steps (438 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (444 resets) in 181 ms. (219 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (444 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (448 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (451 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (450 resets) in 77 ms. (512 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (446 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
[2025-06-04 00:45:10] [INFO ] Flow matrix only has 139 transitions (discarded 3 similar events)
[2025-06-04 00:45:10] [INFO ] Invariant cache hit.
[2025-06-04 00:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/76 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 138/214 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/215 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 86 constraints, problems are : Problem set: 0 solved, 6 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:10] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:10] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:10] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 23/76 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:11] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:11] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:11] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 138/214 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/215 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 99 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1538ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 801 ms.
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 142/142 transitions.
Graph (trivial) has 76 edges and 76 vertex of which 6 / 76 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 264 edges and 73 vertex of which 70 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 130
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 rules applied. Total rules applied 9 place count 68 transition count 127
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 67 transition count 126
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 66 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 66 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 15 place count 65 transition count 124
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 25 place count 55 transition count 104
Iterating global reduction 4 with 10 rules applied. Total rules applied 35 place count 55 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 55 transition count 103
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 40 place count 51 transition count 95
Iterating global reduction 5 with 4 rules applied. Total rules applied 44 place count 51 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 46 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 47 place count 50 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 49 place count 49 transition count 88
Iterating global reduction 6 with 1 rules applied. Total rules applied 50 place count 49 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 51 place count 49 transition count 87
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 61 place count 44 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 62 place count 44 transition count 110
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 79 place count 44 transition count 110
Applied a total of 79 rules in 59 ms. Remains 44 /76 variables (removed 32) and now considering 110/142 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 44/76 places, 110/142 transitions.
RANDOM walk for 40000 steps (3522 resets) in 292 ms. (136 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (731 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2025-06-04 00:45:12] [INFO ] Flow matrix only has 101 transitions (discarded 9 similar events)
// Phase 1: matrix 101 rows 44 cols
[2025-06-04 00:45:12] [INFO ] Computed 6 invariants in 3 ms
[2025-06-04 00:45:12] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/145 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 59 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/145 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 60 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 8 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 55 transition count 102
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 55 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 55 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 49 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 49 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 58 place count 49 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 46 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 46 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 43 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 43 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 43 transition count 68
Applied a total of 73 rules in 16 ms. Remains 43 /76 variables (removed 33) and now considering 68/142 (removed 74) transitions.
[2025-06-04 00:45:13] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
// Phase 1: matrix 67 rows 43 cols
[2025-06-04 00:45:13] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 00:45:13] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2025-06-04 00:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:45:13] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2025-06-04 00:45:13] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2025-06-04 00:45:13] [INFO ] Invariant cache hit.
[2025-06-04 00:45:13] [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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:14] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 66/109 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 54 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:17] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:17] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 66/109 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 67/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 124 constraints, problems are : Problem set: 0 solved, 67 unsolved in 6466 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9404ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 9405ms
Starting structural reductions in LTL mode, iteration 1 : 43/76 places, 68/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9609 ms. Remains : 43/76 places, 68/142 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLCardinality-01 finished in 9983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((!p1&&X(!p2)) U (G((!p1&&X(!p2)))||(X(!p2)&&p3))))&&p0))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 59 transition count 110
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 59 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 59 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 54 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 54 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 54 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 51 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 51 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 49 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 49 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 49 transition count 83
Applied a total of 58 rules in 14 ms. Remains 49 /76 variables (removed 27) and now considering 83/142 (removed 59) transitions.
[2025-06-04 00:45:23] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 49 cols
[2025-06-04 00:45:23] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 00:45:23] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2025-06-04 00:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:45:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-06-04 00:45:23] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2025-06-04 00:45:23] [INFO ] Invariant cache hit.
[2025-06-04 00:45:23] [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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 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 00:45:24] [INFO ] Deduced a trap composed of 16 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 00:45:24] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 81/130 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/59 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 00:45:27] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 60 constraints, problems are : Problem set: 0 solved, 82 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 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 00:45:30] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/11 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 00:45:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 81/130 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 82/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 144 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8391 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14454ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 14455ms
Starting structural reductions in LTL mode, iteration 1 : 49/76 places, 83/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14652 ms. Remains : 49/76 places, 83/142 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) p2 (AND p1 (NOT p3))), (OR (NOT p0) p2 (AND p1 (NOT p3))), (OR p2 (AND p1 (NOT p3))), p2, p2]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLCardinality-04 finished in 14981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 57 transition count 106
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 57 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 57 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 52 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 49 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 49 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 46 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 46 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 46 transition count 77
Applied a total of 64 rules in 14 ms. Remains 46 /76 variables (removed 30) and now considering 77/142 (removed 65) transitions.
[2025-06-04 00:45:38] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
// Phase 1: matrix 76 rows 46 cols
[2025-06-04 00:45:38] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 00:45:38] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2025-06-04 00:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:45:38] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-06-04 00:45:38] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2025-06-04 00:45:38] [INFO ] Invariant cache hit.
[2025-06-04 00:45:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:39] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:39] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 75/121 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:41] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:44] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:44] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 75/121 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 76/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 136 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7535 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12871ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 12872ms
Starting structural reductions in LTL mode, iteration 1 : 46/76 places, 77/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13085 ms. Remains : 46/76 places, 77/142 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 512 ms.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-04-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-04-LTLCardinality-05 finished in 14072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 54 transition count 100
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 54 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 54 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 48 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 48 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 48 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 45 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 45 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 42 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 42 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 42 transition count 67
Applied a total of 74 rules in 10 ms. Remains 42 /76 variables (removed 34) and now considering 67/142 (removed 75) transitions.
[2025-06-04 00:45:52] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
// Phase 1: matrix 66 rows 42 cols
[2025-06-04 00:45:52] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 00:45:52] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:45:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:45:52] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-04 00:45:52] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:45:52] [INFO ] Invariant cache hit.
[2025-06-04 00:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:53] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:53] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 65/107 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 52 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:45:56] [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 00:45:56] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 65/107 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 66/119 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 120 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9322ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 9323ms
Starting structural reductions in LTL mode, iteration 1 : 42/76 places, 67/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9492 ms. Remains : 42/76 places, 67/142 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLCardinality-06 finished in 9612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 56 transition count 104
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 56 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 50 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 50 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 48 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 46 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 46 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 46 transition count 78
Applied a total of 64 rules in 8 ms. Remains 46 /76 variables (removed 30) and now considering 78/142 (removed 64) transitions.
[2025-06-04 00:46:02] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
// Phase 1: matrix 77 rows 46 cols
[2025-06-04 00:46:02] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 00:46:02] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:46:02] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2025-06-04 00:46:02] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:46:02] [INFO ] Invariant cache hit.
[2025-06-04 00:46: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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:03] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 76/122 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 56 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3933 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:06] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:06] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:07] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 76/122 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 77/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 136 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10821ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 10822ms
Starting structural reductions in LTL mode, iteration 1 : 46/76 places, 78/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10977 ms. Remains : 46/76 places, 78/142 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-07
Product exploration explored 100000 steps with 16 reset in 308 ms.
Product exploration explored 100000 steps with 7 reset in 203 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p2)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 506 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 36 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 651 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 (NOT p0) (NOT p2)), false, (AND p1 (NOT p0) p2), false]
RANDOM walk for 40000 steps (3122 resets) in 1035 ms. (38 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40003 steps (441 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (465 resets) in 140 ms. (283 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (460 resets) in 85 ms. (465 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (456 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2025-06-04 00:46:15] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:46:15] [INFO ] Invariant cache hit.
[2025-06-04 00:46:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:15] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 5 ms to minimize.
Problem apf3 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 30/123 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/46 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p2)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 14 factoid took 1142 ms. Reduced automaton from 11 states, 36 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p2) p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p2) p1 (NOT p0)), false]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 78/78 transitions.
Graph (trivial) has 39 edges and 46 vertex of which 8 / 46 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 41 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 41 transition count 72
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 41 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 14 place count 36 transition count 98
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 15 place count 36 transition count 97
Applied a total of 15 rules in 28 ms. Remains 36 /46 variables (removed 10) and now considering 97/78 (removed -19) transitions.
[2025-06-04 00:46:17] [INFO ] Flow matrix only has 83 transitions (discarded 14 similar events)
// Phase 1: matrix 83 rows 36 cols
[2025-06-04 00:46:17] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 00:46:17] [INFO ] Flow matrix only has 83 transitions (discarded 14 similar events)
[2025-06-04 00:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-04 00:46:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:46:17] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-04 00:46:17] [INFO ] Flow matrix only has 83 transitions (discarded 14 similar events)
[2025-06-04 00:46:17] [INFO ] Invariant cache hit.
[2025-06-04 00:46:17] [INFO ] State equation strengthened by 12 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, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 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 00:46:18] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:18] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/118 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 57 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3883 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/9 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 00:46:22] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:22] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/118 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 81/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 140 constraints, problems are : Problem set: 0 solved, 81 unsolved in 9919 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13848ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 13849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/46 places, 97/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14075 ms. Remains : 36/46 places, 97/78 transitions.
Computed a total of 18 stabilizing places and 45 stable transitions
Computed a total of 18 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (OR p2 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 15 factoid took 324 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2) (NOT p0)), false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (5505 resets) in 173 ms. (229 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (990 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (983 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (993 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
[2025-06-04 00:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 14 similar events)
[2025-06-04 00:46:32] [INFO ] Invariant cache hit.
[2025-06-04 00:46:32] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:32] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem apf3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/36 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/118 variables, 36/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 11/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 56 constraints, problems are : Problem set: 1 solved, 2 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/36 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/118 variables, 36/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 11/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 2/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 58 constraints, problems are : Problem set: 1 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (OR p2 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p1)]
Knowledge based reduction with 16 factoid took 706 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2) (NOT p0)), false]
Product exploration explored 100000 steps with 12 reset in 78 ms.
Product exploration explored 100000 steps with 6 reset in 468 ms.
Built C files in :
/tmp/ltsmin5767177292566556673
[2025-06-04 00:46:35] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2025-06-04 00:46:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:46:35] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2025-06-04 00:46:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:46:35] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2025-06-04 00:46:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:46:35] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5767177292566556673
Running compilation step : cd /tmp/ltsmin5767177292566556673;'/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 707 ms.
Running link step : cd /tmp/ltsmin5767177292566556673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin5767177292566556673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12901138111047363545.hoa' '--buchi-type=spotba'
LTSmin run took 186 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLCardinality-07 finished in 34230 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(F(p0)))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 55 transition count 102
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 55 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 55 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 49 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 49 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 58 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 47 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 47 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 45 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 45 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 45 transition count 74
Applied a total of 68 rules in 8 ms. Remains 45 /76 variables (removed 31) and now considering 74/142 (removed 68) transitions.
[2025-06-04 00:46:36] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 45 cols
[2025-06-04 00:46:36] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 00:46:36] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:46:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-04 00:46:36] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:46:36] [INFO ] Invariant cache hit.
[2025-06-04 00:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:37] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:37] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 56 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4603 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:41] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:41] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 132 constraints, problems are : Problem set: 0 solved, 73 unsolved in 8521 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13143ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 13144ms
Starting structural reductions in LTL mode, iteration 1 : 45/76 places, 74/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13342 ms. Remains : 45/76 places, 74/142 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-08
Product exploration explored 100000 steps with 25000 reset in 418 ms.
Product exploration explored 100000 steps with 25000 reset in 389 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31111 steps (2422 resets) in 147 ms. (210 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2025-06-04 00:46:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 00:46:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:46:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:46:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-04 00:46:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:46:51] [INFO ] Invariant cache hit.
[2025-06-04 00:46: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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:52] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 56 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:56] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:56] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:46:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 132 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7897 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12186ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 12186ms
Finished structural reductions in LTL mode , in 1 iterations and 12335 ms. Remains : 45/45 places, 74/74 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3117 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (448 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14113 steps, run visited all 1 properties in 51 ms. (steps per millisecond=276 )
Probabilistic random walk after 14113 steps, saw 2841 distinct states, run finished after 58 ms. (steps per millisecond=243 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Product exploration explored 100000 steps with 25000 reset in 210 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 74/74 transitions.
Graph (trivial) has 40 edges and 45 vertex of which 8 / 45 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 40 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 40 transition count 68
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 40 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 40 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 15 ms. Remains 40 /45 variables (removed 5) and now considering 102/74 (removed -28) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:47:06] [INFO ] Redundant transitions in 4 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 00:47:06] [INFO ] Flow matrix only has 88 transitions (discarded 14 similar events)
// Phase 1: matrix 88 rows 40 cols
[2025-06-04 00:47:06] [INFO ] Computed 7 invariants in 1 ms
[2025-06-04 00:47:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:06] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:06] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 8/15 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 87/127 variables, 40/55 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 9/64 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/65 constraints. Problems are: Problem set: 10 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 65 constraints, problems are : Problem set: 10 solved, 76 unsolved in 4893 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 6/40 variables, 7/7 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 8/15 constraints. Problems are: Problem set: 10 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:11] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 87/127 variables, 40/56 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 9/65 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 76/141 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/141 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/142 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/142 constraints. Problems are: Problem set: 10 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/142 constraints. Problems are: Problem set: 10 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 142 constraints, problems are : Problem set: 10 solved, 76 unsolved in 10060 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 76/86 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14980ms problems are : Problem set: 10 solved, 76 unsolved
Search for dead transitions found 10 dead transitions in 14982ms
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 : 40/45 places, 92/74 transitions.
Graph (complete) has 142 edges and 40 vertex of which 35 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 35 /40 variables (removed 5) and now considering 92/92 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/45 places, 92/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15015 ms. Remains : 35/45 places, 92/74 transitions.
Built C files in :
/tmp/ltsmin13515547148154184416
[2025-06-04 00:47:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13515547148154184416
Running compilation step : cd /tmp/ltsmin13515547148154184416;'/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 204 ms.
Running link step : cd /tmp/ltsmin13515547148154184416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13515547148154184416;'/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/stateBased7038009554131235164.hoa' '--buchi-type=spotba'
LTSmin run took 169 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLCardinality-08 finished in 45047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)&&F(p1)))||G(p2))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Graph (trivial) has 83 edges and 76 vertex of which 6 / 76 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 58 transition count 111
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 58 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 53 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 53 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 43 place count 53 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 52 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 52 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 51 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 51 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 51 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 49 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 49 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 48 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 48 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 47 transition count 91
Applied a total of 58 rules in 34 ms. Remains 47 /76 variables (removed 29) and now considering 91/142 (removed 51) transitions.
[2025-06-04 00:47:21] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-04 00:47:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 00:47:21] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2025-06-04 00:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:47:21] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:47:21] [INFO ] Redundant transitions in 4 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-04 00:47:21] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2025-06-04 00:47:21] [INFO ] Invariant cache hit.
[2025-06-04 00:47:21] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:22] [INFO ] Deduced a trap composed of 19 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 00:47:22] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:22] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 5/47 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 85/132 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:25] [INFO ] Deduced a trap composed of 9 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 00:47:26] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 5/47 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 85/132 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 77/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 145 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9986ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/76 places, 91/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10210 ms. Remains : 47/76 places, 91/142 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-09
Product exploration explored 100000 steps with 33394 reset in 543 ms.
Product exploration explored 100000 steps with 33408 reset in 207 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 114 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4161 resets) in 403 ms. (99 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (548 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (553 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (552 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (545 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
[2025-06-04 00:47:33] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2025-06-04 00:47:33] [INFO ] Invariant cache hit.
[2025-06-04 00:47:33] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 85/132 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 62 constraints, problems are : Problem set: 0 solved, 4 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/30 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:33] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
Problem apf0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 17/47 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 85/132 variables, 47/57 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 7/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 66 constraints, problems are : Problem set: 2 solved, 2 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 91/91 transitions.
Graph (complete) has 164 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 46 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 45 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 45 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 44 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 43 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 43 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 42 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 42 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 41 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 41 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 40 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 40 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 40 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 22 place count 39 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 24 place count 38 transition count 70
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 38 transition count 64
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 32 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 32 transition count 120
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 31 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 41 place count 30 transition count 97
Iterating global reduction 5 with 1 rules applied. Total rules applied 42 place count 30 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 43 place count 29 transition count 95
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 29 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 50 place count 29 transition count 89
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 53 place count 29 transition count 89
Applied a total of 53 rules in 43 ms. Remains 29 /47 variables (removed 18) and now considering 89/91 (removed 2) transitions.
Running 74 sub problems to find dead transitions.
[2025-06-04 00:47:33] [INFO ] Flow matrix only has 68 transitions (discarded 21 similar events)
// Phase 1: matrix 68 rows 29 cols
[2025-06-04 00:47:33] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 00:47:33] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD87 is UNSAT
At refinement iteration 6 (OVERLAPS) 68/97 variables, 29/36 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 7/43 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 43 constraints, problems are : Problem set: 3 solved, 71 unsolved in 3065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 71 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 1/29 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 68/97 variables, 29/36 constraints. Problems are: Problem set: 3 solved, 71 unsolved
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 7/43 constraints. Problems are: Problem set: 5 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 69/112 constraints. Problems are: Problem set: 5 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 112 constraints, problems are : Problem set: 5 solved, 69 unsolved in 4050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 69/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7139ms problems are : Problem set: 5 solved, 69 unsolved
Search for dead transitions found 5 dead transitions in 7140ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 29/47 places, 84/91 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 29 transition count 84
Applied a total of 10 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7194 ms. Remains : 29/47 places, 84/91 transitions.
RANDOM walk for 1862 steps (164 resets) in 14 ms. (124 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p0)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 47 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-04 00:47:41] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-04 00:47:41] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 00:47:41] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2025-06-04 00:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:47:41] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:47:41] [INFO ] Redundant transitions in 3 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-04 00:47:41] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2025-06-04 00:47:41] [INFO ] Invariant cache hit.
[2025-06-04 00:47:41] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 5/47 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 85/132 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:46] [INFO ] Deduced a trap composed of 9 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 00:47:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:47] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 5/47 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 85/132 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 77/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 145 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10501ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 10503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10704 ms. Remains : 47/47 places, 91/91 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4140 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (542 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (543 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 12937 steps, run visited all 2 properties in 77 ms. (steps per millisecond=168 )
Probabilistic random walk after 12937 steps, saw 2609 distinct states, run finished after 78 ms. (steps per millisecond=165 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Built C files in :
/tmp/ltsmin16591086711726157377
[2025-06-04 00:47:53] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-06-04 00:47:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:47:53] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-06-04 00:47:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:47:53] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-06-04 00:47:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:47:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16591086711726157377
Running compilation step : cd /tmp/ltsmin16591086711726157377;'/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 362 ms.
Running link step : cd /tmp/ltsmin16591086711726157377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16591086711726157377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7338338611601464982.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLCardinality-09 finished in 32845 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 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Graph (trivial) has 92 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 53 transition count 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 53 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 44 place count 46 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 51 place count 46 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 55 place count 46 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 44 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 44 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 42 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 42 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 42 transition count 73
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 2 with 2 rules applied. Total rules applied 67 place count 41 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 40 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 40 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 39 transition count 76
Applied a total of 72 rules in 17 ms. Remains 39 /76 variables (removed 37) and now considering 76/142 (removed 66) transitions.
[2025-06-04 00:47:54] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
// Phase 1: matrix 72 rows 39 cols
[2025-06-04 00:47:54] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-04 00:47:54] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-04 00:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:47:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-04 00:47:54] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:47:54] [INFO ] Redundant transitions in 2 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-04 00:47:54] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-04 00:47:54] [INFO ] Invariant cache hit.
[2025-06-04 00:47:54] [INFO ] State equation strengthened by 8 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, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:55] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:55] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:55] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 71/110 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 58 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:47:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 71/110 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 62/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 121 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6021ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/76 places, 76/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6158 ms. Remains : 39/76 places, 76/142 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-11
Product exploration explored 100000 steps with 19 reset in 93 ms.
Product exploration explored 100000 steps with 1 reset in 108 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4138 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (547 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12871 steps, run visited all 1 properties in 28 ms. (steps per millisecond=459 )
Probabilistic random walk after 12871 steps, saw 2526 distinct states, run finished after 28 ms. (steps per millisecond=459 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2025-06-04 00:48:01] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-04 00:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 00:48:01] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-04 00:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-04 00:48:01] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:48:01] [INFO ] Redundant transitions in 2 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-04 00:48:01] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-04 00:48:01] [INFO ] Invariant cache hit.
[2025-06-04 00:48:01] [INFO ] State equation strengthened by 8 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, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:02] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:02] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:02] [INFO ] Deduced a trap composed of 11 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 00:48:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 71/110 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 58 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2702 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:04] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 71/110 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 62/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 121 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3966 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6685ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6868 ms. Remains : 39/39 places, 76/76 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4148 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (550 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12871 steps, run visited all 1 properties in 25 ms. (steps per millisecond=514 )
Probabilistic random walk after 12871 steps, saw 2526 distinct states, run finished after 26 ms. (steps per millisecond=495 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 86 ms.
Product exploration explored 100000 steps with 27 reset in 78 ms.
Built C files in :
/tmp/ltsmin18165462509806258259
[2025-06-04 00:48:09] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2025-06-04 00:48:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:09] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2025-06-04 00:48:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:09] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2025-06-04 00:48:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18165462509806258259
Running compilation step : cd /tmp/ltsmin18165462509806258259;'/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 392 ms.
Running link step : cd /tmp/ltsmin18165462509806258259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin18165462509806258259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13750018991614290564.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLCardinality-11 finished in 15470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U p1)||F(!p0))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Graph (trivial) has 90 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 53 transition count 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 53 transition count 102
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 53 transition count 101
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 46 transition count 87
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 44 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 43 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 43 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 43 transition count 74
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 65 place count 42 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 67 place count 41 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 41 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 40 transition count 77
Applied a total of 70 rules in 17 ms. Remains 40 /76 variables (removed 36) and now considering 77/142 (removed 65) transitions.
[2025-06-04 00:48:09] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 40 cols
[2025-06-04 00:48:09] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 00:48:09] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-04 00:48:10] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:48:10] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-04 00:48:10] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:10] [INFO ] Invariant cache hit.
[2025-06-04 00:48:10] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:10] [INFO ] Deduced a trap composed of 16 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 00:48:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 5/40 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 71/111 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 58 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:13] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 5/40 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:13] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 71/111 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 63/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 124 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4939 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7698ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7699ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/76 places, 77/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7915 ms. Remains : 40/76 places, 77/142 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 95 ms.
Product exploration explored 100000 steps with 2 reset in 87 ms.
Computed a total of 9 stabilizing places and 15 stable transitions
Computed a total of 9 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4167 resets) in 125 ms. (317 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (547 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-06-04 00:48:18] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:18] [INFO ] Invariant cache hit.
[2025-06-04 00:48:18] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/40 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/40 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 77/77 transitions.
Graph (complete) has 134 edges and 40 vertex of which 27 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 27 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 21 place count 27 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 33 place count 19 transition count 45
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 42 place count 19 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 17 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 17 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 17 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 15 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 15 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 15 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 13 transition count 26
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 65 place count 13 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 13 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 13 transition count 24
Applied a total of 67 rules in 9 ms. Remains 13 /40 variables (removed 27) and now considering 24/77 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 13/40 places, 24/77 transitions.
RANDOM walk for 1027 steps (264 resets) in 6 ms. (146 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2025-06-04 00:48:18] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 00:48:18] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-04 00:48:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:48:19] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-04 00:48:19] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:19] [INFO ] Invariant cache hit.
[2025-06-04 00:48:19] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 5/40 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 71/111 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 58 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:22] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 5/40 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 71/111 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 63/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 124 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7626ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7768 ms. Remains : 40/40 places, 77/77 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Computed a total of 9 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4164 resets) in 132 ms. (300 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (552 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-06-04 00:48:26] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2025-06-04 00:48:26] [INFO ] Invariant cache hit.
[2025-06-04 00:48:26] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/40 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/40 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/111 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 77/77 transitions.
Graph (complete) has 134 edges and 40 vertex of which 27 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 27 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 21 place count 27 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 33 place count 19 transition count 45
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 42 place count 19 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 17 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 17 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 17 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 15 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 15 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 15 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 13 transition count 26
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 65 place count 13 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 13 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 13 transition count 24
Applied a total of 67 rules in 8 ms. Remains 13 /40 variables (removed 27) and now considering 24/77 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 13/40 places, 24/77 transitions.
RANDOM walk for 165 steps (35 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 7 reset in 116 ms.
Product exploration explored 100000 steps with 4 reset in 128 ms.
Built C files in :
/tmp/ltsmin13916868526588934576
[2025-06-04 00:48:28] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2025-06-04 00:48:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:28] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2025-06-04 00:48:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:28] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2025-06-04 00:48:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:48:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13916868526588934576
Running compilation step : cd /tmp/ltsmin13916868526588934576;'/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 381 ms.
Running link step : cd /tmp/ltsmin13916868526588934576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin13916868526588934576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7212621687586880178.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA HealthRecord-PT-04-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLCardinality-12 finished in 18823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U !p2)))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 142/142 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 57 transition count 106
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 57 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 57 transition count 105
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 51 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 49 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 47 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 47 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 47 transition count 78
Applied a total of 64 rules in 6 ms. Remains 47 /76 variables (removed 29) and now considering 78/142 (removed 64) transitions.
[2025-06-04 00:48:28] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
// Phase 1: matrix 77 rows 47 cols
[2025-06-04 00:48:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 00:48:28] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:48:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:48:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2025-06-04 00:48:28] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:48:28] [INFO ] Invariant cache hit.
[2025-06-04 00:48:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:29] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 76/123 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 57 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:33] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:48:33] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 76/123 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 77/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 136 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7545 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12020ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12020ms
Starting structural reductions in LTL mode, iteration 1 : 47/76 places, 78/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12218 ms. Remains : 47/76 places, 78/142 transitions.
Stuttering acceptance computed with spot in 156 ms :[p2, p2, true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-04-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X p0), (X p1), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-04-LTLCardinality-13 finished in 12787 ms.
All properties solved by simple procedures.
Total runtime 258890 ms.

BK_STOP 1748998121482

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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