About the Execution of ITS-Tools for HealthRecord-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 214947.00 | 0.00 | 0.00 | TTTFTFTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100571.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.3K 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 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 51K 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-05-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748998472382
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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 00:54:34] [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:54:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:54:35] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2025-06-04 00:54:35] [INFO ] Transformed 125 places.
[2025-06-04 00:54:35] [INFO ] Transformed 246 transitions.
[2025-06-04 00:54:35] [INFO ] Found NUPN structural information;
[2025-06-04 00:54:35] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 237/237 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 78 transition count 148
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 78 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 72 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 72 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 72 transition count 135
Applied a total of 107 rules in 58 ms. Remains 72 /125 variables (removed 53) and now considering 135/237 (removed 102) transitions.
[2025-06-04 00:54:35] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
// Phase 1: matrix 132 rows 72 cols
[2025-06-04 00:54:35] [INFO ] Computed 9 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:54:36] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-04 00:54:36] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
[2025-06-04 00:54:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:54:36] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-04 00:54:36] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
[2025-06-04 00:54:36] [INFO ] Invariant cache hit.
[2025-06-04 00:54: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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:39] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:40] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:40] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:40] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:40] [INFO ] Deduced a trap composed of 17 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:54:40] [INFO ] Deduced a trap composed of 25 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:54:40] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:40] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:41] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:54:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 131/203 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 13647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 131/203 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 134/234 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 24498 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38367ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38392ms
Starting structural reductions in LTL mode, iteration 1 : 72/125 places, 135/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39261 ms. Remains : 72/125 places, 135/237 transitions.
Support contains 32 out of 72 places after structural reductions.
[2025-06-04 00:55:15] [INFO ] Flatten gal took : 63 ms
[2025-06-04 00:55:15] [INFO ] Flatten gal took : 28 ms
[2025-06-04 00:55:15] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (3696 resets) in 1955 ms. (20 steps per ms) remains 5/21 properties
BEST_FIRST walk for 40003 steps (497 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (492 resets) in 154 ms. (258 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (496 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
[2025-06-04 00:55:16] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
[2025-06-04 00:55:16] [INFO ] Invariant cache hit.
[2025-06-04 00:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/72 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 131/203 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/204 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 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:55:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/72 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 131/203 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/204 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 86 constraints, problems are : Problem set: 0 solved, 3 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 34 ms.
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' '!(((((p0 U p1) U X(p2)) U X((p3&&F(p1))))||G(p0)))'
Support contains 7 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 55 transition count 103
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 55 transition count 103
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 55 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 53 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 53 transition count 96
Applied a total of 41 rules in 8 ms. Remains 53 /72 variables (removed 19) and now considering 96/135 (removed 39) transitions.
[2025-06-04 00:55:17] [INFO ] Flow matrix only has 95 transitions (discarded 1 similar events)
// Phase 1: matrix 95 rows 53 cols
[2025-06-04 00:55:17] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 00:55:17] [INFO ] Flow matrix only has 95 transitions (discarded 1 similar events)
[2025-06-04 00:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:55:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-04 00:55:17] [INFO ] Flow matrix only has 95 transitions (discarded 1 similar events)
[2025-06-04 00:55:17] [INFO ] Invariant cache hit.
[2025-06-04 00:55:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:18] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:18] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 94/147 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/148 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 65 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:24] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 94/147 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 95/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 161 constraints, problems are : Problem set: 0 solved, 95 unsolved in 10208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16897ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 16898ms
Starting structural reductions in LTL mode, iteration 1 : 53/72 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17037 ms. Remains : 53/72 places, 96/135 transitions.
Stuttering acceptance computed with spot in 1207 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Product exploration explored 100000 steps with 50000 reset in 390 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 (NOT p0) p2 p3), (X p2), (X (NOT (AND (NOT p1) p0 p3))), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 52 factoid took 46 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-05-LTLCardinality-01 finished in 19209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Graph (trivial) has 88 edges and 72 vertex of which 6 / 72 are part of one of the 3 SCC in 3 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 49 transition count 95
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 49 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 49 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 43 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 43 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 40 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 40 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 40 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 39 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 39 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 39 transition count 65
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 4 with 4 rules applied. Total rules applied 70 place count 37 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 72 place count 36 transition count 67
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 74 place count 36 transition count 65
Applied a total of 74 rules in 105 ms. Remains 36 /72 variables (removed 36) and now considering 65/135 (removed 70) transitions.
[2025-06-04 00:55:36] [INFO ] Flow matrix only has 62 transitions (discarded 3 similar events)
// Phase 1: matrix 62 rows 36 cols
[2025-06-04 00:55:36] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 00:55:36] [INFO ] Flow matrix only has 62 transitions (discarded 3 similar events)
[2025-06-04 00:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:55:36] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:55:36] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-04 00:55:36] [INFO ] Flow matrix only has 62 transitions (discarded 3 similar events)
[2025-06-04 00:55:36] [INFO ] Invariant cache hit.
[2025-06-04 00:55:36] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:37] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:37] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 61/97 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 1/98 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 53 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:39] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:40] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 61/97 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 51/106 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 1/98 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 107 constraints, problems are : Problem set: 0 solved, 51 unsolved in 4458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7158ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 7160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/72 places, 65/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7469 ms. Remains : 36/72 places, 65/135 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-05-LTLCardinality-03 finished in 7590 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(p0)) U G(p1)) U X(((G(p2) U p2)||X(p2)))))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 53 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 53 transition count 98
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 53 transition count 97
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 49 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 49 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 49 place count 49 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 48 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 48 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 48 transition count 82
Applied a total of 52 rules in 10 ms. Remains 48 /72 variables (removed 24) and now considering 82/135 (removed 53) transitions.
[2025-06-04 00:55:44] [INFO ] Flow matrix only has 80 transitions (discarded 2 similar events)
// Phase 1: matrix 80 rows 48 cols
[2025-06-04 00:55:44] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 00:55:44] [INFO ] Flow matrix only has 80 transitions (discarded 2 similar events)
[2025-06-04 00:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:55:44] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-06-04 00:55:44] [INFO ] Flow matrix only has 80 transitions (discarded 2 similar events)
[2025-06-04 00:55:44] [INFO ] Invariant cache hit.
[2025-06-04 00:55:44] [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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/8 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:55:45] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 79/127 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 59 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:50] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:50] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 79/127 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 81/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 142 constraints, problems are : Problem set: 0 solved, 81 unsolved in 8195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13399ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 13400ms
Starting structural reductions in LTL mode, iteration 1 : 48/72 places, 82/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13606 ms. Remains : 48/72 places, 82/135 transitions.
Stuttering acceptance computed with spot in 786 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 216 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 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 20 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-05-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-05-LTLCardinality-04 finished in 14855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Graph (trivial) has 86 edges and 72 vertex of which 6 / 72 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 50 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 50 transition count 97
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 50 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 44 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 44 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 44 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 42 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 42 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 42 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 41 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 41 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 41 transition count 70
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 4 with 4 rules applied. Total rules applied 65 place count 39 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 67 place count 38 transition count 73
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 69 place count 38 transition count 71
Applied a total of 69 rules in 36 ms. Remains 38 /72 variables (removed 34) and now considering 71/135 (removed 64) transitions.
[2025-06-04 00:55:59] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
// Phase 1: matrix 68 rows 38 cols
[2025-06-04 00:55:59] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 00:55:59] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2025-06-04 00:55:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:55:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:55:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:55:59] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-04 00:55:59] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2025-06-04 00:55:59] [INFO ] Invariant cache hit.
[2025-06-04 00:55:59] [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/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:59] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:59] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:55:59] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 67/105 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 55 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2788 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:02] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 67/105 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 57/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 113 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7366ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 7367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/72 places, 71/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7598 ms. Remains : 38/72 places, 71/135 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-05-LTLCardinality-05 finished in 7665 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(((p0 U G(p1))||G(p2)))))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 53 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 53 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 48 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 48 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 48 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 45 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 45 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 45 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 44 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 44 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 44 transition count 72
Applied a total of 61 rules in 15 ms. Remains 44 /72 variables (removed 28) and now considering 72/135 (removed 63) transitions.
[2025-06-04 00:56:06] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
// Phase 1: matrix 70 rows 44 cols
[2025-06-04 00:56:06] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 00:56:06] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:56:06] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2025-06-04 00:56:06] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:06] [INFO ] Invariant cache hit.
[2025-06-04 00:56:06] [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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:07] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 69/113 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/114 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 54 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:11] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:11] [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:56:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:11] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 69/113 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 71/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 129 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7569 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11628ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 11629ms
Starting structural reductions in LTL mode, iteration 1 : 44/72 places, 72/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11817 ms. Remains : 44/72 places, 72/135 transitions.
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 15 reset in 296 ms.
Product exploration explored 100000 steps with 19 reset in 319 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 p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 144 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (3691 resets) in 650 ms. (61 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (487 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (495 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (497 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (476 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
[2025-06-04 00:56:20] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:20] [INFO ] Invariant cache hit.
[2025-06-04 00:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 3 (OVERLAPS) 17/44 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/113 variables, 44/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/114 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 53 constraints, problems are : Problem set: 3 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/44 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 44/114 variables, and 9 constraints, problems are : Problem set: 4 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/44 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 14 factoid took 797 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-04 00:56:22] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 00:56:22] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:56:22] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2025-06-04 00:56:22] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2025-06-04 00:56:22] [INFO ] Invariant cache hit.
[2025-06-04 00:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:23] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 69/113 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/114 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 54 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:25] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:25] [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:56:26] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 69/113 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 71/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 129 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10640ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 10641ms
Finished structural reductions in LTL mode , in 1 iterations and 10827 ms. Remains : 44/44 places, 72/72 transitions.
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 p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 30872 steps (2859 resets) in 118 ms. (259 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 525 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 18 reset in 212 ms.
Entered a terminal (fully accepting) state of product in 158 steps with 14 reset in 1 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-05-LTLCardinality-11 finished in 28332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Graph (trivial) has 84 edges and 72 vertex of which 6 / 72 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 50 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 50 transition count 97
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 50 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 45 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 45 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 45 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 42 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 42 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 57 place count 42 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 41 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 41 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 41 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 4 with 2 rules applied. Total rules applied 62 place count 40 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 64 place count 39 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 39 transition count 73
Applied a total of 66 rules in 37 ms. Remains 39 /72 variables (removed 33) and now considering 73/135 (removed 62) transitions.
[2025-06-04 00:56:35] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
// Phase 1: matrix 70 rows 39 cols
[2025-06-04 00:56:35] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 00:56:35] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2025-06-04 00:56:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:56:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:56:35] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-04 00:56:35] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2025-06-04 00:56:35] [INFO ] Invariant cache hit.
[2025-06-04 00:56:35] [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/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:35] [INFO ] Deduced a trap composed of 12 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:56:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 69/108 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 56 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:38] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:38] [INFO ] Deduced a trap composed of 12 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:56:38] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 69/108 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 59/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 1/109 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 119 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4601 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7369ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7370ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/72 places, 73/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7594 ms. Remains : 39/72 places, 73/135 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 14 reset in 138 ms.
Product exploration explored 100000 steps with 6 reset in 161 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 145 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 :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30707 steps (3172 resets) in 95 ms. (319 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 331 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 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-06-04 00:56:43] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2025-06-04 00:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-04 00:56:43] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2025-06-04 00:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:56:44] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:56:44] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-04 00:56:44] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2025-06-04 00:56:44] [INFO ] Invariant cache hit.
[2025-06-04 00:56:44] [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/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:44] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 69/108 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 56 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:47] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:47] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:47] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 69/108 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 59/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 1/109 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 119 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8284ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8478 ms. Remains : 39/39 places, 73/73 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 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 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4139 resets) in 237 ms. (168 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 335 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 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6 reset in 131 ms.
Product exploration explored 100000 steps with 9 reset in 147 ms.
Built C files in :
/tmp/ltsmin7546115375739905474
[2025-06-04 00:56:53] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2025-06-04 00:56:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:56:53] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2025-06-04 00:56:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:56:53] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2025-06-04 00:56:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:56:53] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7546115375739905474
Running compilation step : cd /tmp/ltsmin7546115375739905474;'/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 471 ms.
Running link step : cd /tmp/ltsmin7546115375739905474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7546115375739905474;'/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/stateBased2654943128965122194.hoa' '--buchi-type=spotba'
LTSmin run took 281 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-05-LTLCardinality-12 finished in 19525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Graph (trivial) has 88 edges and 72 vertex of which 6 / 72 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 48 transition count 93
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 48 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 48 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 43 transition count 81
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 43 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 43 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 41 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 41 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 41 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 40 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 40 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 40 transition count 69
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 4 with 4 rules applied. Total rules applied 67 place count 38 transition count 67
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 69 place count 37 transition count 73
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 71 place count 37 transition count 71
Applied a total of 71 rules in 30 ms. Remains 37 /72 variables (removed 35) and now considering 71/135 (removed 64) transitions.
[2025-06-04 00:56:54] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
// Phase 1: matrix 68 rows 37 cols
[2025-06-04 00:56: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:56:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 00:56:54] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2025-06-04 00:56:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:56:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-04 00:56:54] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:56:54] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-04 00:56:54] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2025-06-04 00:56:54] [INFO ] Invariant cache hit.
[2025-06-04 00:56: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/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:55] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 67/104 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 54 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:57] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:56:58] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 67/104 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 57/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 1/105 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (OVERLAPS) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 113 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7390ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 7392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/72 places, 71/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7591 ms. Remains : 37/72 places, 71/135 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-05-LTLCardinality-13 finished in 7658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)||G(p2)))'
Support contains 7 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 53 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 53 transition count 99
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 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 50 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 50 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 49 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 49 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 48 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 48 transition count 84
Applied a total of 52 rules in 7 ms. Remains 48 /72 variables (removed 24) and now considering 84/135 (removed 51) transitions.
[2025-06-04 00:57:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 48 cols
[2025-06-04 00:57:02] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:57:02] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 00:57:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:57:02] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-04 00:57:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:02] [INFO ] Invariant cache hit.
[2025-06-04 00:57: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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:03] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:03] [INFO ] Deduced a trap composed of 6 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:57:03] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:03] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:04] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:04] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6311 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:09] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:09] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 83/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 148 constraints, problems are : Problem set: 0 solved, 83 unsolved in 11081 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17409ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 17410ms
Starting structural reductions in LTL mode, iteration 1 : 48/72 places, 84/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17597 ms. Remains : 48/72 places, 84/135 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-14
Product exploration explored 100000 steps with 22 reset in 159 ms.
Product exploration explored 100000 steps with 58 reset in 177 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 : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 173 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 31222 steps (2870 resets) in 145 ms. (213 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 11 factoid took 413 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-04 00:57:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:57:21] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 00:57:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:57:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:57:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-04 00:57:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:21] [INFO ] Invariant cache hit.
[2025-06-04 00:57:21] [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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:22] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:22] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:23] [INFO ] Deduced a trap composed of 10 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:57:23] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:23] [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:57:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:28] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:28] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 83/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 148 constraints, problems are : Problem set: 0 solved, 83 unsolved in 11358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17590ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 17591ms
Finished structural reductions in LTL mode , in 1 iterations and 17778 ms. Remains : 48/48 places, 84/84 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 : [(AND (NOT p0) p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (3660 resets) in 226 ms. (176 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (494 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (494 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
[2025-06-04 00:57:39] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2025-06-04 00:57:39] [INFO ] Invariant cache hit.
[2025-06-04 00:57:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/48 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 56 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/48 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/57 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:57:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 59 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 27 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 156 ms.
Product exploration explored 100000 steps with 25 reset in 174 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Graph (trivial) has 44 edges and 48 vertex of which 6 / 48 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 41 transition count 72
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 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 10 place count 41 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 40 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 40 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 40 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 40 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 12 ms. Remains 40 /48 variables (removed 8) and now considering 95/84 (removed -11) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:57:42] [INFO ] Redundant transitions in 4 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-04 00:57:42] [INFO ] Flow matrix only has 83 transitions (discarded 12 similar events)
// Phase 1: matrix 83 rows 40 cols
[2025-06-04 00:57:42] [INFO ] Computed 7 invariants in 1 ms
[2025-06-04 00:57:42] [INFO ] State equation strengthened by 4 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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:42] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/13 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/53 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/56 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/56 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/57 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/57 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/57 constraints. Problems are: Problem set: 8 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 57 constraints, problems are : Problem set: 8 solved, 71 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 5/40 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/13 constraints. Problems are: Problem set: 8 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:46] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 82/122 variables, 40/54 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/57 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 71/128 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/129 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/129 constraints. Problems are: Problem set: 8 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/129 constraints. Problems are: Problem set: 8 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 129 constraints, problems are : Problem set: 8 solved, 71 unsolved in 7380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/79 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11694ms problems are : Problem set: 8 solved, 71 unsolved
Search for dead transitions found 8 dead transitions in 11695ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 87/84 transitions.
Graph (complete) has 140 edges and 40 vertex of which 36 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 36 /40 variables (removed 4) and now considering 87/87 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/48 places, 87/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11740 ms. Remains : 36/48 places, 87/84 transitions.
Built C files in :
/tmp/ltsmin18270112766111904186
[2025-06-04 00:57:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18270112766111904186
Running compilation step : cd /tmp/ltsmin18270112766111904186;'/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 281 ms.
Running link step : cd /tmp/ltsmin18270112766111904186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin18270112766111904186;'/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/stateBased3363574325953571905.hoa' '--buchi-type=spotba'
LTSmin run took 462 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-05-LTLCardinality-14 finished in 52564 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(F(p0)) U (p1&&X(p2)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 53 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 53 transition count 99
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 53 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 49 transition count 88
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 49 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 49 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 46 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 46 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 56 place count 46 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 45 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 45 transition count 75
Applied a total of 59 rules in 16 ms. Remains 45 /72 variables (removed 27) and now considering 75/135 (removed 60) transitions.
[2025-06-04 00:57:54] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
// Phase 1: matrix 74 rows 45 cols
[2025-06-04 00:57: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:57:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 00:57:54] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2025-06-04 00:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:57:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:57:54] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 00:57:54] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2025-06-04 00:57:54] [INFO ] Invariant cache hit.
[2025-06-04 00:57:54] [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, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:55] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:56] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 73/118 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:57:57] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 58 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4849 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 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, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 73/118 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 74/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 133 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7187 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12052ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 12052ms
Starting structural reductions in LTL mode, iteration 1 : 45/72 places, 75/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12265 ms. Remains : 45/72 places, 75/135 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-05-LTLCardinality-15
Stuttering criterion allowed to conclude after 42 steps with 7 reset in 0 ms.
FORMULA HealthRecord-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-05-LTLCardinality-15 finished in 12517 ms.
All properties solved by simple procedures.
Total runtime 212358 ms.
BK_STOP 1748998687329
--------------------
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-05"
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-05, 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-174867008100571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-05.tgz
mv HealthRecord-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;