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.r180-tall-171640604100755.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 itstools
Input is HealthRecord-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100755
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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 68K 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-08-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716519933196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 03:05:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:05:34] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-24 03:05:34] [INFO ] Transformed 156 places.
[2024-05-24 03:05:34] [INFO ] Transformed 326 transitions.
[2024-05-24 03:05:34] [INFO ] Found NUPN structural information;
[2024-05-24 03:05:34] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 166 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 7 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 300/300 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 73 transition count 143
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 73 transition count 143
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 175 place count 64 transition count 125
Iterating global reduction 0 with 9 rules applied. Total rules applied 184 place count 64 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 189 place count 64 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 62 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 62 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 195 place count 60 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 197 place count 60 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 202 place count 60 transition count 105
Applied a total of 202 rules in 30 ms. Remains 60 /156 variables (removed 96) and now considering 105/300 (removed 195) transitions.
[2024-05-24 03:05:34] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
// Phase 1: matrix 102 rows 60 cols
[2024-05-24 03:05:34] [INFO ] Computed 9 invariants in 10 ms
[2024-05-24 03:05:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-24 03:05:34] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2024-05-24 03:05:34] [INFO ] Invariant cache hit.
[2024-05-24 03:05:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-24 03:05:35] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2024-05-24 03:05:35] [INFO ] Invariant cache hit.
[2024-05-24 03:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:05:35] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 18 ms to minimize.
[2024-05-24 03:05:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:05:36] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:05:36] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:05:36] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:05:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 101/161 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:05:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 77 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:05:38] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:05:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:05:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:05:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:05:39] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:05:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 101/161 variables, 60/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 104/186 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 187 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4119 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 13/13 constraints]
After SMT, in 7399ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7421ms
Starting structural reductions in LTL mode, iteration 1 : 60/156 places, 105/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7790 ms. Remains : 60/156 places, 105/300 transitions.
Support contains 12 out of 60 places after structural reductions.
[2024-05-24 03:05:42] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:05:42] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:05:42] [INFO ] Input system was already deterministic with 105 transitions.
RANDOM walk for 40000 steps (2239 resets) in 907 ms. (44 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (300 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (299 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (299 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
[2024-05-24 03:05:43] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2024-05-24 03:05:43] [INFO ] Invariant cache hit.
[2024-05-24 03:05:43] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/60 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/161 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:05:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 71 constraints, problems are : Problem set: 0 solved, 3 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:05:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:05:43] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:05:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:05:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/60 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 101/161 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/162 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 78 constraints, problems are : Problem set: 0 solved, 3 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 38 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 105/105 transitions.
Graph (trivial) has 66 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 208 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 89
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 52 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 52 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 47 transition count 85
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 24 place count 38 transition count 67
Iterating global reduction 2 with 9 rules applied. Total rules applied 33 place count 38 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 38 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 36 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 36 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 35 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 47 place count 35 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 57 place count 30 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 58 place count 30 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 30 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 62 place count 28 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 64 place count 28 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 28 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 69 place count 26 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 72 place count 26 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 73 place count 25 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 74 place count 25 transition count 96
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 75 place count 24 transition count 93
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 24 transition count 93
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 86 place count 24 transition count 83
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 94 place count 24 transition count 83
Applied a total of 94 rules in 71 ms. Remains 24 /60 variables (removed 36) and now considering 83/105 (removed 22) transitions.
Running 67 sub problems to find dead transitions.
[2024-05-24 03:05:43] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 24 cols
[2024-05-24 03:05:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 03:05:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 8 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/50 constraints. Problems are: Problem set: 8 solved, 59 unsolved
[2024-05-24 03:05:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 51 constraints, problems are : Problem set: 9 solved, 58 unsolved in 880 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 71/95 variables, 24/31 constraints. Problems are: Problem set: 9 solved, 58 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 20/51 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 56/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 107 constraints, problems are : Problem set: 11 solved, 56 unsolved in 1084 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 56/67 constraints, Known Traps: 1/1 constraints]
After SMT, in 2047ms problems are : Problem set: 11 solved, 56 unsolved
Search for dead transitions found 11 dead transitions in 2050ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/60 places, 72/105 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 72
Applied a total of 1 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2137 ms. Remains : 24/60 places, 72/105 transitions.
RANDOM walk for 40000 steps (9230 resets) in 568 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1207 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 631 steps, run visited all 1 properties in 21 ms. (steps per millisecond=30 )
Probabilistic random walk after 631 steps, saw 255 distinct states, run finished after 24 ms. (steps per millisecond=26 ) properties seen :1
Computed a total of 4 stabilizing places and 5 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((G(F(p0)) U G(p1)))))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 53 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 51 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 51 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 51 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 50 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 50 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 28 place count 50 transition count 76
Applied a total of 28 rules in 4 ms. Remains 50 /60 variables (removed 10) and now considering 76/105 (removed 29) transitions.
[2024-05-24 03:05:46] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 50 cols
[2024-05-24 03:05:46] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:05:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:05:46] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:05:46] [INFO ] Invariant cache hit.
[2024-05-24 03:05:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 03:05:46] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:05:46] [INFO ] Invariant cache hit.
[2024-05-24 03:05:46] [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, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:05:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:05:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/122 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 62 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:05:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 72/122 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 75/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 138 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
After SMT, in 2849ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2857ms
Starting structural reductions in LTL mode, iteration 1 : 50/60 places, 76/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2951 ms. Remains : 50/60 places, 76/105 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-00
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 2 ms.
FORMULA HealthRecord-PT-08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLCardinality-00 finished in 3453 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(p0))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 52 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 52 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 50 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 50 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 50 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 49 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 49 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 49 transition count 75
Applied a total of 29 rules in 7 ms. Remains 49 /60 variables (removed 11) and now considering 75/105 (removed 30) transitions.
[2024-05-24 03:05:49] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
// Phase 1: matrix 72 rows 49 cols
[2024-05-24 03:05:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:05:49] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2024-05-24 03:05:49] [INFO ] Invariant cache hit.
[2024-05-24 03:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-24 03:05:49] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2024-05-24 03:05:49] [INFO ] Invariant cache hit.
[2024-05-24 03:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:05:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:05:50] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 71/120 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 61 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:05:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:05:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 71/120 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 74/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 137 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1868 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
After SMT, in 3020ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3022ms
Starting structural reductions in LTL mode, iteration 1 : 49/60 places, 75/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3115 ms. Remains : 49/60 places, 75/105 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 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 : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-08-LTLCardinality-01 finished in 3533 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(F(p0)))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 53 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 52 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 51 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 51 transition count 81
Applied a total of 23 rules in 4 ms. Remains 51 /60 variables (removed 9) and now considering 81/105 (removed 24) transitions.
[2024-05-24 03:05:53] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2024-05-24 03:05:53] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:05:53] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 03:05:53] [INFO ] Invariant cache hit.
[2024-05-24 03:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:53] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-24 03:05:53] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 03:05:53] [INFO ] Invariant cache hit.
[2024-05-24 03:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:05:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
[2024-05-24 03:05:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:05:53] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 77/128 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 64 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 77/128 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 147 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
After SMT, in 3404ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3405ms
Starting structural reductions in LTL mode, iteration 1 : 51/60 places, 81/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3519 ms. Remains : 51/60 places, 81/105 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 78 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-08-LTLCardinality-04 finished in 3774 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 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Graph (trivial) has 66 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 44 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 44 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 44 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 42 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 42 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 42 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 41 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 41 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 41 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 39 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 39 transition count 76
Applied a total of 41 rules in 20 ms. Remains 39 /60 variables (removed 21) and now considering 76/105 (removed 29) transitions.
[2024-05-24 03:05:56] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
// Phase 1: matrix 67 rows 39 cols
[2024-05-24 03:05:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 03:05:56] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2024-05-24 03:05:56] [INFO ] Invariant cache hit.
[2024-05-24 03:05:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 03:05:56] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-24 03:05:57] [INFO ] Redundant transitions in 19 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 03:05:57] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2024-05-24 03:05:57] [INFO ] Invariant cache hit.
[2024-05-24 03:05:57] [INFO ] State equation strengthened by 13 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-05-24 03:05:57] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:05:57] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:05:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:05:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 66/105 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 65 constraints, problems are : Problem set: 0 solved, 60 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 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, 4/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 03:05:58] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 66/105 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 126 constraints, problems are : Problem set: 0 solved, 60 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
After SMT, in 1777ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1786ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/60 places, 76/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1900 ms. Remains : 39/60 places, 76/105 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-08-LTLCardinality-08 finished in 1992 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(G((p0||X(G(p1)))))))'
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 53 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 53 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 51 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 51 transition count 82
Applied a total of 22 rules in 21 ms. Remains 51 /60 variables (removed 9) and now considering 82/105 (removed 23) transitions.
[2024-05-24 03:05:58] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 51 cols
[2024-05-24 03:05:58] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:05:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 03:05:58] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:05:58] [INFO ] Invariant cache hit.
[2024-05-24 03:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:05:59] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:05:59] [INFO ] Invariant cache hit.
[2024-05-24 03:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:05:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:05:59] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/129 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:06:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:06:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:06:00] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:06:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 81/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints]
After SMT, in 3537ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3539ms
Starting structural reductions in LTL mode, iteration 1 : 51/60 places, 82/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3656 ms. Remains : 51/60 places, 82/105 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 80 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2232 resets) in 222 ms. (179 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (296 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-24 03:06:03] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:06:03] [INFO ] Invariant cache hit.
[2024-05-24 03:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/51 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/129 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 10 / 51 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 165 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 66
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 43 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 36 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 35 transition count 55
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 25 place count 35 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 35 place count 30 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 30 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 30 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 40 place count 28 transition count 81
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 42 place count 28 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 28 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 47 place count 26 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 50 place count 26 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 51 place count 25 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 52 place count 25 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 53 place count 24 transition count 93
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 24 transition count 93
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 64 place count 24 transition count 83
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 72 place count 24 transition count 83
Applied a total of 72 rules in 34 ms. Remains 24 /51 variables (removed 27) and now considering 83/82 (removed -1) transitions.
Running 67 sub problems to find dead transitions.
[2024-05-24 03:06:03] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 24 cols
[2024-05-24 03:06:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 03:06:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 8 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/50 constraints. Problems are: Problem set: 8 solved, 59 unsolved
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 51 constraints, problems are : Problem set: 9 solved, 58 unsolved in 680 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 71/95 variables, 24/31 constraints. Problems are: Problem set: 9 solved, 58 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 20/51 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 56/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 107 constraints, problems are : Problem set: 11 solved, 56 unsolved in 942 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 56/67 constraints, Known Traps: 1/1 constraints]
After SMT, in 1669ms problems are : Problem set: 11 solved, 56 unsolved
Search for dead transitions found 11 dead transitions in 1669ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/51 places, 72/82 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 72
Applied a total of 1 rules in 12 ms. Remains 24 /24 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1717 ms. Remains : 24/51 places, 72/82 transitions.
RANDOM walk for 40000 steps (9243 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1171 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 631 steps, run visited all 1 properties in 5 ms. (steps per millisecond=126 )
Probabilistic random walk after 631 steps, saw 255 distinct states, run finished after 5 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-24 03:06:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 51 cols
[2024-05-24 03:06:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:06:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:06:05] [INFO ] Invariant cache hit.
[2024-05-24 03:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:06:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:06:05] [INFO ] Invariant cache hit.
[2024-05-24 03:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:06:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:06:06] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/129 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 81/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2117 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints]
After SMT, in 3366ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3366ms
Finished structural reductions in LTL mode , in 1 iterations and 3450 ms. Remains : 51/51 places, 82/82 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2229 resets) in 74 ms. (533 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (298 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-05-24 03:06:09] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:06:09] [INFO ] Invariant cache hit.
[2024-05-24 03:06:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:06:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:06:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/51 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/129 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 10 / 51 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 165 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 66
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 43 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 36 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 35 transition count 55
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 25 place count 35 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 35 place count 30 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 30 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 30 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 40 place count 28 transition count 81
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 42 place count 28 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 28 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 47 place count 26 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 50 place count 26 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 51 place count 25 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 52 place count 25 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 53 place count 24 transition count 93
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 24 transition count 93
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 64 place count 24 transition count 83
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 72 place count 24 transition count 83
Applied a total of 72 rules in 15 ms. Remains 24 /51 variables (removed 27) and now considering 83/82 (removed -1) transitions.
Running 67 sub problems to find dead transitions.
[2024-05-24 03:06:09] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 24 cols
[2024-05-24 03:06:09] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 03:06:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 8 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/50 constraints. Problems are: Problem set: 8 solved, 59 unsolved
[2024-05-24 03:06:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 51 constraints, problems are : Problem set: 9 solved, 58 unsolved in 701 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 71/95 variables, 24/31 constraints. Problems are: Problem set: 9 solved, 58 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 20/51 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 56/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 107 constraints, problems are : Problem set: 11 solved, 56 unsolved in 957 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 56/67 constraints, Known Traps: 1/1 constraints]
After SMT, in 1706ms problems are : Problem set: 11 solved, 56 unsolved
Search for dead transitions found 11 dead transitions in 1707ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/51 places, 72/82 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 72
Applied a total of 1 rules in 7 ms. Remains 24 /24 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1730 ms. Remains : 24/51 places, 72/82 transitions.
RANDOM walk for 40000 steps (9217 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1189 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 631 steps, run visited all 1 properties in 4 ms. (steps per millisecond=157 )
Probabilistic random walk after 631 steps, saw 255 distinct states, run finished after 4 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (trivial) has 45 edges and 51 vertex of which 10 / 51 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 75
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 45 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 45 transition count 118
Deduced a syphon composed of 5 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 45 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 17 ms. Remains 45 /51 variables (removed 6) and now considering 117/82 (removed -35) transitions.
[2024-05-24 03:06:12] [INFO ] Redundant transitions in 24 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-24 03:06:12] [INFO ] Flow matrix only has 103 transitions (discarded 14 similar events)
// Phase 1: matrix 103 rows 45 cols
[2024-05-24 03:06:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:12] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:06:12] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:06:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
[2024-05-24 03:06:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:06:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-24 03:06:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-24 03:06:13] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:06:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-24 03:06:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 8/17 constraints. Problems are: Problem set: 8 solved, 93 unsolved
[2024-05-24 03:06:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/18 constraints. Problems are: Problem set: 8 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 93 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 5 (OVERLAPS) 102/147 variables, 45/63 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 20/83 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/83 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/84 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 84 constraints, problems are : Problem set: 10 solved, 91 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 10 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 6/45 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/18 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 102/147 variables, 45/63 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 20/83 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 91/174 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/175 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/175 constraints. Problems are: Problem set: 10 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/175 constraints. Problems are: Problem set: 10 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 175 constraints, problems are : Problem set: 10 solved, 91 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 91/101 constraints, Known Traps: 9/9 constraints]
After SMT, in 4730ms problems are : Problem set: 10 solved, 91 unsolved
Search for dead transitions found 10 dead transitions in 4732ms
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 : 45/51 places, 107/82 transitions.
Graph (complete) has 178 edges and 45 vertex of which 40 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 8 ms. Remains 40 /45 variables (removed 5) and now considering 107/107 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/51 places, 107/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4789 ms. Remains : 40/51 places, 107/82 transitions.
Built C files in :
/tmp/ltsmin2232253206698233154
[2024-05-24 03:06:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2232253206698233154
Running compilation step : cd /tmp/ltsmin2232253206698233154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin2232253206698233154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2232253206698233154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1207504089553498995.hoa' '--buchi-type=spotba'
LTSmin run took 4822 ms.
FORMULA HealthRecord-PT-08-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-08-LTLCardinality-10 finished in 23677 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(F(p0))))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 53 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 52 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 52 transition count 84
Applied a total of 21 rules in 3 ms. Remains 52 /60 variables (removed 8) and now considering 84/105 (removed 21) transitions.
[2024-05-24 03:06:22] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 52 cols
[2024-05-24 03:06:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:06:22] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:06:22] [INFO ] Invariant cache hit.
[2024-05-24 03:06:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 03:06:22] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:06:22] [INFO ] Invariant cache hit.
[2024-05-24 03:06:22] [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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:06:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:06:22] [INFO ] Deduced a trap composed of 5 places in 26 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, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/132 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:06:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:06:23] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/133 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 66 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:06:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:06:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 80/132 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 83/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
After SMT, in 4125ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4126ms
Starting structural reductions in LTL mode, iteration 1 : 52/60 places, 84/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4212 ms. Remains : 52/60 places, 84/105 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-08-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Product exploration explored 100000 steps with 33333 reset in 159 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-08-LTLCardinality-11 finished in 4658 ms.
All properties solved by simple procedures.
Total runtime 52915 ms.

BK_STOP 1716519987299

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-08, 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 r180-tall-171640604100755"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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