Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604100739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is HealthRecord-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201034263

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:17:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:17:15] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 00:17:15] [INFO ] Transformed 154 places.
[2024-06-01 00:17:15] [INFO ] Transformed 319 transitions.
[2024-06-01 00:17:15] [INFO ] Found NUPN structural information;
[2024-06-01 00:17:15] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 82 transition count 157
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 82 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 150 place count 76 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 156 place count 76 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 158 place count 76 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 75 transition count 140
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 75 transition count 140
Applied a total of 160 rules in 33 ms. Remains 75 /154 variables (removed 79) and now considering 140/294 (removed 154) transitions.
[2024-06-01 00:17:15] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 75 cols
[2024-06-01 00:17:15] [INFO ] Computed 11 invariants in 13 ms
[2024-06-01 00:17:15] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 00:17:15] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-06-01 00:17:15] [INFO ] Invariant cache hit.
[2024-06-01 00:17:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:17:16] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-06-01 00:17:16] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-06-01 00:17:16] [INFO ] Invariant cache hit.
[2024-06-01 00:17:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-06-01 00:17:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 9 ms to minimize.
[2024-06-01 00:17:16] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-06-01 00:17:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 134/209 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-06-01 00:17:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 96 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4682 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 134/209 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 139/234 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-06-01 00:17:23] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 236 constraints, problems are : Problem set: 0 solved, 139 unsolved in 5574 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 10/10 constraints]
After SMT, in 10359ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 10373ms
Starting structural reductions in LTL mode, iteration 1 : 75/154 places, 140/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10761 ms. Remains : 75/154 places, 140/294 transitions.
Support contains 24 out of 75 places after structural reductions.
[2024-06-01 00:17:26] [INFO ] Flatten gal took : 31 ms
[2024-06-01 00:17:26] [INFO ] Flatten gal took : 20 ms
[2024-06-01 00:17:26] [INFO ] Input system was already deterministic with 140 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (1985 resets) in 1182 ms. (33 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40002 steps (269 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (271 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
[2024-06-01 00:17:27] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-06-01 00:17:27] [INFO ] Invariant cache hit.
[2024-06-01 00:17:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/75 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/209 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/210 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:17:27] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 29/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:17:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:17:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:17:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:17:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/209 variables, 75/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 93 constraints, problems are : Problem set: 1 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 396ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 84 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 282 edges and 68 vertex of which 46 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 46 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 38 place count 46 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 45 transition count 72
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 34 transition count 61
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 34 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 62 place count 34 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 33 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 28 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 28 transition count 55
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 28 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 26 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 26 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 26 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 25 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 25 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 25 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 21 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 21 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 20 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 105 place count 19 transition count 31
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 5 with 2 rules applied. Total rules applied 107 place count 18 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 17 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 17 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 17 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 113 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 16 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 16 transition count 25
Applied a total of 115 rules in 56 ms. Remains 16 /75 variables (removed 59) and now considering 25/140 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 16/75 places, 25/140 transitions.
RANDOM walk for 30595 steps (3070 resets) in 545 ms. (56 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA HealthRecord-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p1)))))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 58 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 53 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 53 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 51 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 50 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 50 transition count 77
Applied a total of 63 rules in 9 ms. Remains 50 /75 variables (removed 25) and now considering 77/140 (removed 63) transitions.
[2024-06-01 00:17:28] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-06-01 00:17:28] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:17:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 00:17:28] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:28] [INFO ] Invariant cache hit.
[2024-06-01 00:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:17:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 00:17:28] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:28] [INFO ] Invariant cache hit.
[2024-06-01 00:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:17:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:17:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:17:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3273ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3275ms
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 77/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3369 ms. Remains : 50/75 places, 77/140 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 1 reset in 150 ms.
Product exploration explored 100000 steps with 1 reset in 103 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2001 resets) in 244 ms. (163 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (270 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
[2024-06-01 00:17:32] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:32] [INFO ] Invariant cache hit.
[2024-06-01 00:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 1/124 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/50 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 00:17:33] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:33] [INFO ] Invariant cache hit.
[2024-06-01 00:17:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 00:17:33] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:33] [INFO ] Invariant cache hit.
[2024-06-01 00:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:17:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 00:17:33] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:33] [INFO ] Invariant cache hit.
[2024-06-01 00:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:17:33] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:17:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:17:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3266ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3267ms
Finished structural reductions in LTL mode , in 1 iterations and 3374 ms. Remains : 50/50 places, 77/77 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 6824 steps (349 resets) in 42 ms. (158 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 77/77 transitions.
Graph (trivial) has 48 edges and 50 vertex of which 14 / 50 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 42 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 42 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 42 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 42 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 42 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 19 ms. Remains 42 /50 variables (removed 8) and now considering 113/77 (removed -36) transitions.
[2024-06-01 00:17:38] [INFO ] Redundant transitions in 24 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 00:17:38] [INFO ] Flow matrix only has 100 transitions (discarded 13 similar events)
// Phase 1: matrix 100 rows 42 cols
[2024-06-01 00:17:38] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 00:17:38] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:17:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 00:17:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 00:17:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/15 constraints. Problems are: Problem set: 6 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 91 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 99/141 variables, 42/57 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 24/81 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/81 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/82 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 82 constraints, problems are : Problem set: 10 solved, 87 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 10 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 6/42 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/15 constraints. Problems are: Problem set: 10 solved, 87 unsolved
[2024-06-01 00:17:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 99/141 variables, 42/58 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 24/82 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 87/169 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/142 variables, 1/170 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/170 constraints. Problems are: Problem set: 10 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/170 constraints. Problems are: Problem set: 10 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 170 constraints, problems are : Problem set: 10 solved, 87 unsolved in 2785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 87/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 4854ms problems are : Problem set: 10 solved, 87 unsolved
Search for dead transitions found 10 dead transitions in 4856ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 42/50 places, 103/77 transitions.
Graph (complete) has 171 edges and 42 vertex of which 37 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 37 /42 variables (removed 5) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/50 places, 103/77 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4909 ms. Remains : 37/50 places, 103/77 transitions.
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 00:17:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-06-01 00:17:43] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:17:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:17:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:43] [INFO ] Invariant cache hit.
[2024-06-01 00:17:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:17:43] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 00:17:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-06-01 00:17:43] [INFO ] Invariant cache hit.
[2024-06-01 00:17:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:17:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:17:44] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
[2024-06-01 00:17:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:17:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3116ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3117ms
Finished structural reductions in LTL mode , in 1 iterations and 3205 ms. Remains : 50/50 places, 77/77 transitions.
Treatment of property HealthRecord-PT-06-LTLCardinality-00 finished in 18665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 52 transition count 104
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 52 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 37 place count 46 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 46 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 52 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 44 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 44 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 44 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 43 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 43 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 43 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 3 with 4 rules applied. Total rules applied 68 place count 41 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 41 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
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 73 place count 39 transition count 78
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 75 place count 39 transition count 76
Applied a total of 75 rules in 15 ms. Remains 39 /75 variables (removed 36) and now considering 76/140 (removed 64) transitions.
[2024-06-01 00:17:46] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
// Phase 1: matrix 65 rows 39 cols
[2024-06-01 00:17:46] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:17:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 00:17:46] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
[2024-06-01 00:17:46] [INFO ] Invariant cache hit.
[2024-06-01 00:17:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 00:17:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 00:17:46] [INFO ] Redundant transitions in 21 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 00:17:46] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
[2024-06-01 00:17:46] [INFO ] Invariant cache hit.
[2024-06-01 00:17:46] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 00:17:47] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 00:17:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 00:17:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 63 constraints, problems are : Problem set: 0 solved, 60 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 60/123 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 123 constraints, problems are : Problem set: 0 solved, 60 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
After SMT, in 1725ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1726ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/75 places, 76/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1855 ms. Remains : 39/75 places, 76/140 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 5 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-02 finished in 1968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(!p1&&X(G(p1))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 52 transition count 103
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 52 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 32 place count 52 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 46 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 46 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 46 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 44 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 44 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 43 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 43 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 43 transition count 67
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 69 place count 41 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 41 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 39 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 77 place count 39 transition count 75
Applied a total of 77 rules in 30 ms. Remains 39 /75 variables (removed 36) and now considering 75/140 (removed 65) transitions.
[2024-06-01 00:17:48] [INFO ] Flow matrix only has 63 transitions (discarded 12 similar events)
// Phase 1: matrix 63 rows 39 cols
[2024-06-01 00:17:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 00:17:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 00:17:48] [INFO ] Flow matrix only has 63 transitions (discarded 12 similar events)
[2024-06-01 00:17:48] [INFO ] Invariant cache hit.
[2024-06-01 00:17:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:17:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 00:17:48] [INFO ] Redundant transitions in 17 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 00:17:48] [INFO ] Flow matrix only has 63 transitions (discarded 12 similar events)
[2024-06-01 00:17:48] [INFO ] Invariant cache hit.
[2024-06-01 00:17:48] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 00:17:48] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 6/39 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 62/101 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/102 variables, and 65 constraints, problems are : Problem set: 0 solved, 59 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 00:17:49] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 6/39 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 62/101 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/101 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/102 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 7/7 constraints]
After SMT, in 2103ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/75 places, 75/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2229 ms. Remains : 39/75 places, 75/140 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-03 finished in 2340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 51 transition count 102
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 51 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 51 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 46 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 46 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 46 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 45 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 45 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 43 transition count 74
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 43 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 41 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 41 transition count 89
Applied a total of 70 rules in 22 ms. Remains 41 /75 variables (removed 34) and now considering 89/140 (removed 51) transitions.
[2024-06-01 00:17:51] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
// Phase 1: matrix 77 rows 41 cols
[2024-06-01 00:17:51] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:17:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:17:51] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:17:51] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 00:17:51] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 00:17:51] [INFO ] Redundant transitions in 25 ms returned []
Running 73 sub problems to find dead transitions.
[2024-06-01 00:17:51] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:17:51] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 00:17:51] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:17:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:17:51] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 00:17:51] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 71 constraints, problems are : Problem set: 0 solved, 73 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 00:17:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:17:52] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 76/117 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 73/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 146 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 6/6 constraints]
After SMT, in 2332ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2334ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/75 places, 89/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2467 ms. Remains : 41/75 places, 89/140 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-08 finished in 2524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 85 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 105
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 48 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 48 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 48 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 46 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 46 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 45 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 45 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 45 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 44 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 42 transition count 87
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 42 transition count 85
Applied a total of 66 rules in 20 ms. Remains 42 /75 variables (removed 33) and now considering 85/140 (removed 55) transitions.
[2024-06-01 00:17:53] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
// Phase 1: matrix 72 rows 42 cols
[2024-06-01 00:17:53] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 00:17:53] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 00:17:53] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:53] [INFO ] Invariant cache hit.
[2024-06-01 00:17:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:17:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 00:17:53] [INFO ] Redundant transitions in 20 ms returned []
Running 69 sub problems to find dead transitions.
[2024-06-01 00:17:53] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:53] [INFO ] Invariant cache hit.
[2024-06-01 00:17:53] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:17:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:17:53] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:17:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:17:53] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 00:17:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 70 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 139 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/75 places, 85/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2415 ms. Remains : 42/75 places, 85/140 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36063 steps (3436 resets) in 69 ms. (515 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 00:17:56] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:56] [INFO ] Invariant cache hit.
[2024-06-01 00:17:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 00:17:56] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:56] [INFO ] Invariant cache hit.
[2024-06-01 00:17:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:17:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 00:17:56] [INFO ] Redundant transitions in 22 ms returned []
Running 69 sub problems to find dead transitions.
[2024-06-01 00:17:56] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:56] [INFO ] Invariant cache hit.
[2024-06-01 00:17:56] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:17:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:17:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:17:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:17:57] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 00:17:57] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 70 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 139 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
After SMT, in 2347ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2347ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2464 ms. Remains : 42/42 places, 85/85 transitions.
Computed a total of 17 stabilizing places and 24 stable transitions
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8505 steps (806 resets) in 21 ms. (386 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 3 reset in 53 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 00:17:59] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:59] [INFO ] Invariant cache hit.
[2024-06-01 00:17:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:17:59] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:59] [INFO ] Invariant cache hit.
[2024-06-01 00:17:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:17:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 00:17:59] [INFO ] Redundant transitions in 21 ms returned []
Running 69 sub problems to find dead transitions.
[2024-06-01 00:17:59] [INFO ] Flow matrix only has 72 transitions (discarded 13 similar events)
[2024-06-01 00:17:59] [INFO ] Invariant cache hit.
[2024-06-01 00:17:59] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:18:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:18:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:18:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:18:00] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:18:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 70 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 6/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 71/113 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 139 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
After SMT, in 2345ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2458 ms. Remains : 42/42 places, 85/85 transitions.
Treatment of property HealthRecord-PT-06-LTLCardinality-09 finished in 8738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||X(p2)||p0))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 60 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 60 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 60 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 55 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 55 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 53 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 52 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 52 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 52 transition count 83
Applied a total of 57 rules in 3 ms. Remains 52 /75 variables (removed 23) and now considering 83/140 (removed 57) transitions.
[2024-06-01 00:18:02] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 52 cols
[2024-06-01 00:18:02] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 00:18:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 00:18:02] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:02] [INFO ] Invariant cache hit.
[2024-06-01 00:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 00:18:02] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:02] [INFO ] Invariant cache hit.
[2024-06-01 00:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:02] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 64 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:18:04] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 148 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
After SMT, in 3475ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3476ms
Starting structural reductions in LTL mode, iteration 1 : 52/75 places, 83/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3611 ms. Remains : 52/75 places, 83/140 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 1 reset in 167 ms.
Product exploration explored 100000 steps with 1 reset in 121 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 267 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 5
RANDOM walk for 40000 steps (2014 resets) in 116 ms. (341 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
[2024-06-01 00:18:06] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:06] [INFO ] Invariant cache hit.
[2024-06-01 00:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/132 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/52 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p2) p0 p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 491 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 00:18:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:07] [INFO ] Invariant cache hit.
[2024-06-01 00:18:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 00:18:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:07] [INFO ] Invariant cache hit.
[2024-06-01 00:18:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:07] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 00:18:07] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:07] [INFO ] Invariant cache hit.
[2024-06-01 00:18:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 64 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 148 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
After SMT, in 3314ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3316ms
Finished structural reductions in LTL mode , in 1 iterations and 3407 ms. Remains : 52/52 places, 83/83 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 8 factoid took 142 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 22834 steps (1145 resets) in 41 ms. (543 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 8 factoid took 348 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 00:18:12] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:12] [INFO ] Invariant cache hit.
[2024-06-01 00:18:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 00:18:12] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:12] [INFO ] Invariant cache hit.
[2024-06-01 00:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:12] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 00:18:12] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-06-01 00:18:12] [INFO ] Invariant cache hit.
[2024-06-01 00:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:18:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 64 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 148 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
After SMT, in 3674ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3675ms
Finished structural reductions in LTL mode , in 1 iterations and 3789 ms. Remains : 52/52 places, 83/83 transitions.
Treatment of property HealthRecord-PT-06-LTLCardinality-10 finished in 13760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 90 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 50 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 50 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 50 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 44 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 44 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 57 place count 44 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 42 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 42 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 42 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 41 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 41 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 41 transition count 64
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 73 place count 39 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 39 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 78 place count 37 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 81 place count 37 transition count 72
Applied a total of 81 rules in 22 ms. Remains 37 /75 variables (removed 38) and now considering 72/140 (removed 68) transitions.
[2024-06-01 00:18:16] [INFO ] Flow matrix only has 61 transitions (discarded 11 similar events)
// Phase 1: matrix 61 rows 37 cols
[2024-06-01 00:18:16] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:18:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 00:18:16] [INFO ] Flow matrix only has 61 transitions (discarded 11 similar events)
[2024-06-01 00:18:16] [INFO ] Invariant cache hit.
[2024-06-01 00:18:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:18:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-01 00:18:16] [INFO ] Redundant transitions in 24 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 00:18:16] [INFO ] Flow matrix only has 61 transitions (discarded 11 similar events)
[2024-06-01 00:18:16] [INFO ] Invariant cache hit.
[2024-06-01 00:18:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/37 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 00:18:16] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 00:18:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 00:18:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:18:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/97 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 63 constraints, problems are : Problem set: 0 solved, 56 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/37 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/97 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 56/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 119 constraints, problems are : Problem set: 0 solved, 56 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/75 places, 72/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1624 ms. Remains : 37/75 places, 72/140 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-11 finished in 1807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p1)))))))'
Found a Lengthening insensitive property : HealthRecord-PT-06-LTLCardinality-00
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 90 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 51 transition count 102
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 51 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 51 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 46 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 46 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 46 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 44 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 44 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 44 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 43 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 43 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 43 transition count 71
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 66 place count 41 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 41 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 39 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 39 transition count 83
Applied a total of 72 rules in 10 ms. Remains 39 /75 variables (removed 36) and now considering 83/140 (removed 57) transitions.
[2024-06-01 00:18:18] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 39 cols
[2024-06-01 00:18:18] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:18:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 00:18:18] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:18] [INFO ] Invariant cache hit.
[2024-06-01 00:18:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-06-01 00:18:18] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:18] [INFO ] Invariant cache hit.
[2024-06-01 00:18:18] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 65 constraints, problems are : Problem set: 0 solved, 67 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 67/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 132 constraints, problems are : Problem set: 0 solved, 67 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
After SMT, in 1927ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1928ms
Starting structural reductions in LI_LTL mode, iteration 1 : 39/75 places, 83/140 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2072 ms. Remains : 39/75 places, 83/140 transitions.
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 2 reset in 55 ms.
Computed a total of 17 stabilizing places and 32 stable transitions
Computed a total of 17 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3809 resets) in 64 ms. (615 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (536 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-01 00:18:20] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:20] [INFO ] Invariant cache hit.
[2024-06-01 00:18:20] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 1/110 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/39 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 83/83 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 00:18:21] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:21] [INFO ] Invariant cache hit.
[2024-06-01 00:18:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 00:18:21] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:21] [INFO ] Invariant cache hit.
[2024-06-01 00:18:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-06-01 00:18:21] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:21] [INFO ] Invariant cache hit.
[2024-06-01 00:18:21] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 00:18:21] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 00:18:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 00:18:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 65 constraints, problems are : Problem set: 0 solved, 67 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 67/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 132 constraints, problems are : Problem set: 0 solved, 67 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
After SMT, in 1901ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1903ms
Finished structural reductions in LTL mode , in 1 iterations and 1998 ms. Remains : 39/39 places, 83/83 transitions.
Computed a total of 17 stabilizing places and 32 stable transitions
Computed a total of 17 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4010 steps (379 resets) in 36 ms. (108 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 51 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 83/83 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 81
Applied a total of 2 rules in 10 ms. Remains 39 /39 variables (removed 0) and now considering 81/83 (removed 2) transitions.
[2024-06-01 00:18:24] [INFO ] Redundant transitions in 19 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 00:18:24] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 39 cols
[2024-06-01 00:18:24] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:18:24] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 00:18:25] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:18:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:18:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 68/107 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/108 variables, and 65 constraints, problems are : Problem set: 0 solved, 65 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 00:18:25] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 68/107 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 65/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/108 variables, and 131 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 1877ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1878ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 81/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1917 ms. Remains : 39/39 places, 81/83 transitions.
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 00:18:26] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 39 cols
[2024-06-01 00:18:26] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:18:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 00:18:26] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:26] [INFO ] Invariant cache hit.
[2024-06-01 00:18:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-06-01 00:18:26] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
[2024-06-01 00:18:26] [INFO ] Invariant cache hit.
[2024-06-01 00:18:26] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 00:18:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:18:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 00:18:27] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 65 constraints, problems are : Problem set: 0 solved, 67 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 70/109 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 67/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 132 constraints, problems are : Problem set: 0 solved, 67 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
After SMT, in 1908ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1910ms
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 39/39 places, 83/83 transitions.
Treatment of property HealthRecord-PT-06-LTLCardinality-00 finished in 11022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||X(p2)||p0))))'
Found a Lengthening insensitive property : HealthRecord-PT-06-LTLCardinality-10
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 140/140 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 106
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 53 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 48 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 48 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 44 place count 48 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 46 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 46 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 46 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 45 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 45 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 45 transition count 77
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 60 place count 43 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 43 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 65 place count 41 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 41 transition count 89
Applied a total of 66 rules in 14 ms. Remains 41 /75 variables (removed 34) and now considering 89/140 (removed 51) transitions.
[2024-06-01 00:18:29] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
// Phase 1: matrix 77 rows 41 cols
[2024-06-01 00:18:29] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:18:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 00:18:29] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:29] [INFO ] Invariant cache hit.
[2024-06-01 00:18:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:29] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-06-01 00:18:29] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:29] [INFO ] Invariant cache hit.
[2024-06-01 00:18:29] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 68 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 73/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
After SMT, in 2244ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2245ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/75 places, 89/140 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2346 ms. Remains : 41/75 places, 89/140 transitions.
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 5 reset in 73 ms.
Product exploration explored 100000 steps with 1 reset in 76 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 15 factoid took 344 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 40000 steps (3810 resets) in 105 ms. (377 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (529 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (538 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-06-01 00:18:32] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:32] [INFO ] Invariant cache hit.
[2024-06-01 00:18:32] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/118 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/41 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p0) p1 p2)), (G (OR p0 p1 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 537 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-06-01 00:18:33] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:33] [INFO ] Invariant cache hit.
[2024-06-01 00:18:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:18:33] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:33] [INFO ] Invariant cache hit.
[2024-06-01 00:18:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-06-01 00:18:33] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:33] [INFO ] Invariant cache hit.
[2024-06-01 00:18:33] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 68 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 73/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
After SMT, in 2254ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2255ms
Finished structural reductions in LTL mode , in 1 iterations and 2341 ms. Remains : 41/41 places, 89/89 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 28107 steps (2672 resets) in 82 ms. (338 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 2 reset in 72 ms.
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-06-01 00:18:36] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:36] [INFO ] Invariant cache hit.
[2024-06-01 00:18:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:18:36] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:36] [INFO ] Invariant cache hit.
[2024-06-01 00:18:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 00:18:36] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-06-01 00:18:36] [INFO ] Flow matrix only has 77 transitions (discarded 12 similar events)
[2024-06-01 00:18:36] [INFO ] Invariant cache hit.
[2024-06-01 00:18:36] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 00:18:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:18:37] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 00:18:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:18:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 68 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1320 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 73/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
After SMT, in 2555ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2556ms
Finished structural reductions in LTL mode , in 1 iterations and 2689 ms. Remains : 41/41 places, 89/89 transitions.
Treatment of property HealthRecord-PT-06-LTLCardinality-10 finished in 10400 ms.
[2024-06-01 00:18:39] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:18:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:18:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 140 transitions and 435 arcs took 4 ms.
Total runtime 84008 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HealthRecord-PT-06-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717201120117

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HealthRecord-PT-06-LTLCardinality-00
ltl formula formula --ltl=/tmp/2171/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 75 places, 140 transitions and 435 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2171/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2171/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2171/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2171/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 76, there are 152 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~51!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 644
pnml2lts-mc( 0/ 4): unique states count: 1853
pnml2lts-mc( 0/ 4): unique transitions count: 9227
pnml2lts-mc( 0/ 4): - self-loop count: 751
pnml2lts-mc( 0/ 4): - claim dead count: 3761
pnml2lts-mc( 0/ 4): - claim found count: 2153
pnml2lts-mc( 0/ 4): - claim success count: 1862
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1862 states 9300 transitions, fanout: 4.995
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.022 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62067, Transitions per second: 310000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 12.8 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 140 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-06-LTLCardinality-09
ltl formula formula --ltl=/tmp/2171/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 75 places, 140 transitions and 435 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2171/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2171/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2171/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2171/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 76, there are 173 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~43!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 517
pnml2lts-mc( 0/ 4): unique states count: 1413
pnml2lts-mc( 0/ 4): unique transitions count: 6630
pnml2lts-mc( 0/ 4): - self-loop count: 508
pnml2lts-mc( 0/ 4): - claim dead count: 2649
pnml2lts-mc( 0/ 4): - claim found count: 1589
pnml2lts-mc( 0/ 4): - claim success count: 1419
pnml2lts-mc( 0/ 4): - cum. max stack depth: 136
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1419 states 6685 transitions, fanout: 4.711
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 70950, Transitions per second: 334250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 12.7 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 140 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-06-LTLCardinality-10
ltl formula formula --ltl=/tmp/2171/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 75 places, 140 transitions and 435 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2171/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2171/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2171/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2171/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 76 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 76, there are 209 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~79 levels ~10000 states ~53828 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~86!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4403
pnml2lts-mc( 0/ 4): unique states count: 13771
pnml2lts-mc( 0/ 4): unique transitions count: 79141
pnml2lts-mc( 0/ 4): - self-loop count: 5960
pnml2lts-mc( 0/ 4): - claim dead count: 40234
pnml2lts-mc( 0/ 4): - claim found count: 17660
pnml2lts-mc( 0/ 4): - claim success count: 13783
pnml2lts-mc( 0/ 4): - cum. max stack depth: 649
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13783 states 79250 transitions, fanout: 5.750
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 76572, Transitions per second: 440278
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.3 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 140 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-06, 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 r496-tall-171640604100739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;