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.r579-smll-171734921400155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 130K Jun 2 16:33 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 MedleyA-PT-20-LTLCardinality-00
FORMULA_NAME MedleyA-PT-20-LTLCardinality-01
FORMULA_NAME MedleyA-PT-20-LTLCardinality-02
FORMULA_NAME MedleyA-PT-20-LTLCardinality-03
FORMULA_NAME MedleyA-PT-20-LTLCardinality-04
FORMULA_NAME MedleyA-PT-20-LTLCardinality-05
FORMULA_NAME MedleyA-PT-20-LTLCardinality-06
FORMULA_NAME MedleyA-PT-20-LTLCardinality-07
FORMULA_NAME MedleyA-PT-20-LTLCardinality-08
FORMULA_NAME MedleyA-PT-20-LTLCardinality-09
FORMULA_NAME MedleyA-PT-20-LTLCardinality-10
FORMULA_NAME MedleyA-PT-20-LTLCardinality-11
FORMULA_NAME MedleyA-PT-20-LTLCardinality-12
FORMULA_NAME MedleyA-PT-20-LTLCardinality-13
FORMULA_NAME MedleyA-PT-20-LTLCardinality-14
FORMULA_NAME MedleyA-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363095295

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:18:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:18:18] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-02 21:18:18] [INFO ] Transformed 273 places.
[2024-06-02 21:18:18] [INFO ] Transformed 518 transitions.
[2024-06-02 21:18:18] [INFO ] Found NUPN structural information;
[2024-06-02 21:18:18] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 183 transition count 428
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 183 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 184 place count 183 transition count 424
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 215 place count 152 transition count 333
Iterating global reduction 1 with 31 rules applied. Total rules applied 246 place count 152 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 248 place count 152 transition count 331
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 258 place count 142 transition count 311
Iterating global reduction 2 with 10 rules applied. Total rules applied 268 place count 142 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 142 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 272 place count 140 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 140 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 276 place count 140 transition count 301
Applied a total of 276 rules in 172 ms. Remains 140 /273 variables (removed 133) and now considering 301/518 (removed 217) transitions.
// Phase 1: matrix 301 rows 140 cols
[2024-06-02 21:18:18] [INFO ] Computed 11 invariants in 33 ms
[2024-06-02 21:18:19] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-02 21:18:19] [INFO ] Invariant cache hit.
[2024-06-02 21:18:19] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-02 21:18:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:23] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 35 ms to minimize.
[2024-06-02 21:18:23] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 11 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 4 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 3 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 3 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 4 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/441 variables, 140/161 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:18:32] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-06-02 21:18:32] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:18:32] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2024-06-02 21:18:32] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:18:33] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:18:33] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:18:33] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 10/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:38] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:18:38] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:42] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:18:42] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:47] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 183 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/441 variables, 140/183 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 300/483 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:18:58] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:18:58] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 4 ms to minimize.
[2024-06-02 21:18:58] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 4 ms to minimize.
[2024-06-02 21:18:58] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:19:07] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:19:07] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 490 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 39/39 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Starting structural reductions in LTL mode, iteration 1 : 140/273 places, 301/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61936 ms. Remains : 140/273 places, 301/518 transitions.
Support contains 23 out of 140 places after structural reductions.
[2024-06-02 21:19:20] [INFO ] Flatten gal took : 73 ms
[2024-06-02 21:19:20] [INFO ] Flatten gal took : 31 ms
[2024-06-02 21:19:21] [INFO ] Input system was already deterministic with 301 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (21 resets) in 1734 ms. (23 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40002 steps (31 resets) in 520 ms. (76 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38212 steps (19 resets) in 297 ms. (128 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 20 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' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 109 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 3 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 112 transition count 261
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 42 place count 101 transition count 244
Iterating global reduction 2 with 11 rules applied. Total rules applied 53 place count 101 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 101 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 100 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 100 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 98 transition count 236
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 98 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 98 transition count 235
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 87 place count 86 transition count 223
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 94 place count 79 transition count 202
Iterating global reduction 5 with 7 rules applied. Total rules applied 101 place count 79 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 105 place count 79 transition count 198
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 117 place count 73 transition count 208
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 120 place count 73 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 121 place count 72 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 72 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 72 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 125 place count 70 transition count 199
Applied a total of 125 rules in 109 ms. Remains 70 /140 variables (removed 70) and now considering 199/301 (removed 102) transitions.
[2024-06-02 21:19:22] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
// Phase 1: matrix 189 rows 70 cols
[2024-06-02 21:19:22] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:19:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:19:22] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2024-06-02 21:19:22] [INFO ] Invariant cache hit.
[2024-06-02 21:19:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:19:22] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-02 21:19:22] [INFO ] Redundant transitions in 10 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 21:19:22] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2024-06-02 21:19:22] [INFO ] Invariant cache hit.
[2024-06-02 21:19:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:19:24] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 188/258 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 83 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6862 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 188/258 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 172/255 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 255 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7146 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 1/1 constraints]
After SMT, in 14173ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 14177ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/140 places, 199/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14577 ms. Remains : 70/140 places, 199/301 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 3 reset in 527 ms.
Stuttering criterion allowed to conclude after 211 steps with 11 reset in 2 ms.
FORMULA MedleyA-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-01 finished in 15525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 111 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 112 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 43 place count 100 transition count 241
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 100 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 99 transition count 236
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 98 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 98 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 98 transition count 232
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 90 place count 85 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 78 transition count 198
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 78 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 108 place count 78 transition count 194
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 122 place count 71 transition count 207
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 125 place count 71 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 70 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 70 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 70 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 129 place count 69 transition count 199
Applied a total of 129 rules in 109 ms. Remains 69 /140 variables (removed 71) and now considering 199/301 (removed 102) transitions.
[2024-06-02 21:19:37] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
// Phase 1: matrix 190 rows 69 cols
[2024-06-02 21:19:37] [INFO ] Computed 11 invariants in 8 ms
[2024-06-02 21:19:37] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 21:19:37] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 21:19:37] [INFO ] Invariant cache hit.
[2024-06-02 21:19:37] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:19:38] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 21:19:38] [INFO ] Redundant transitions in 13 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-02 21:19:38] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 21:19:38] [INFO ] Invariant cache hit.
[2024-06-02 21:19:38] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:19:40] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 118 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13747 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 198/315 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/259 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 316 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12837 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints]
After SMT, in 26732ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 26736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/140 places, 199/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27259 ms. Remains : 69/140 places, 199/301 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 282 ms.
Product exploration explored 100000 steps with 5 reset in 301 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20238 steps (26 resets) in 172 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 199/199 transitions.
Applied a total of 0 rules in 12 ms. Remains 69 /69 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-06-02 21:20:06] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 21:20:06] [INFO ] Invariant cache hit.
[2024-06-02 21:20:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 21:20:06] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 21:20:06] [INFO ] Invariant cache hit.
[2024-06-02 21:20:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:20:06] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-06-02 21:20:06] [INFO ] Redundant transitions in 4 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-02 21:20:06] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 21:20:06] [INFO ] Invariant cache hit.
[2024-06-02 21:20:06] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:20:09] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 3 ms to minimize.
[2024-06-02 21:20:09] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:20:09] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:20:09] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 118 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 198/315 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/259 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 316 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11184 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints]
After SMT, in 25364ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 25369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25851 ms. Remains : 69/69 places, 199/199 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20055 steps (12 resets) in 53 ms. (371 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-02 finished in 55378 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((p0||X(p1)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 126 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 119 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 119 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 118 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 118 transition count 254
Applied a total of 49 rules in 30 ms. Remains 118 /140 variables (removed 22) and now considering 254/301 (removed 47) transitions.
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 21:20:33] [INFO ] Computed 11 invariants in 4 ms
[2024-06-02 21:20:33] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 21:20:33] [INFO ] Invariant cache hit.
[2024-06-02 21:20:33] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-02 21:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:20:37] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:20:37] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:20:37] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:20:39] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:20:39] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:20:40] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:20:40] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:20:40] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:20:40] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:20:41] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/372 variables, 118/145 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:20:46] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:20:46] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:20:48] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 148 constraints, problems are : Problem set: 0 solved, 253 unsolved in 24256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:00] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/372 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 253/403 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 2 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:13] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:19] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:21:24] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 410 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 28/28 constraints]
After SMT, in 54429ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 54435ms
Starting structural reductions in LTL mode, iteration 1 : 118/140 places, 254/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54959 ms. Remains : 118/140 places, 254/301 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-03 finished in 55210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 111 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 112 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 43 place count 100 transition count 241
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 100 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 99 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 99 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 98 transition count 235
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 97 transition count 232
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 97 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 97 transition count 231
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 90 place count 85 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 96 place count 79 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 79 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 106 place count 79 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 120 place count 72 transition count 210
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 123 place count 72 transition count 207
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 71 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 71 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 71 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 70 transition count 202
Applied a total of 127 rules in 78 ms. Remains 70 /140 variables (removed 70) and now considering 202/301 (removed 99) transitions.
[2024-06-02 21:21:28] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
// Phase 1: matrix 192 rows 70 cols
[2024-06-02 21:21:28] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:21:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 21:21:28] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2024-06-02 21:21:28] [INFO ] Invariant cache hit.
[2024-06-02 21:21:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:21:28] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-02 21:21:28] [INFO ] Redundant transitions in 4 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-02 21:21:28] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2024-06-02 21:21:28] [INFO ] Invariant cache hit.
[2024-06-02 21:21:28] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 21:21:31] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:21:31] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:21:31] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:21:31] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 191/261 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 28/113 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 1/262 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 114 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10508 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 191/261 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 28/113 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 201/314 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/262 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 315 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11977 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 4/4 constraints]
After SMT, in 22621ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/140 places, 202/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23093 ms. Remains : 70/140 places, 202/301 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-06 finished in 23155 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&&G(p1)))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 129 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 124 transition count 271
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 124 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 123 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 123 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 123 transition count 267
Applied a total of 37 rules in 4 ms. Remains 123 /140 variables (removed 17) and now considering 267/301 (removed 34) transitions.
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 21:21:51] [INFO ] Computed 11 invariants in 5 ms
[2024-06-02 21:21:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:21:51] [INFO ] Invariant cache hit.
[2024-06-02 21:21:51] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 21:21:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:21:54] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:21:54] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:21:57] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:01] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:22:01] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:22:02] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:22:04] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-06-02 21:22:04] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:22:04] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-06-02 21:22:04] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 3 ms to minimize.
[2024-06-02 21:22:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:22:07] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:22:08] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:22:08] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 267/390 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:16] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/390 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 168 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:24] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:22:24] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 267/390 variables, 123/170 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 266/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:30] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:22:30] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:22:30] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:22:31] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:22:31] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 441 constraints, problems are : Problem set: 0 solved, 266 unsolved in 29901 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 41/41 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 267/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60431 ms. Remains : 123/140 places, 267/301 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 4 reset in 167 ms.
Product exploration explored 100000 steps with 15 reset in 304 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (42 resets) in 129 ms. (307 steps per ms) remains 1/3 properties
BEST_FIRST walk for 15473 steps (45 resets) in 41 ms. (368 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-02 21:22:53] [INFO ] Invariant cache hit.
[2024-06-02 21:22:53] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-02 21:22:53] [INFO ] Invariant cache hit.
[2024-06-02 21:22:53] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 21:22:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 3 ms to minimize.
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 3 ms to minimize.
[2024-06-02 21:22:57] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 2 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:04] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:23:04] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:23:04] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:06] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:23:06] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:23:06] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:23:07] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:23:07] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:23:07] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:09] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 267/390 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:18] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/390 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 168 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:26] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:23:26] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 267/390 variables, 123/170 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 266/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:23:32] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:23:32] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:23:32] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:23:32] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:23:32] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 441 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 41/41 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 123/123 places, 267/267 transitions.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (19 resets) in 161 ms. (246 steps per ms) remains 1/3 properties
BEST_FIRST walk for 24741 steps (25 resets) in 33 ms. (727 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 285 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 233 ms.
Product exploration explored 100000 steps with 2 reset in 225 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 267/267 transitions.
Graph (trivial) has 92 edges and 123 vertex of which 15 / 123 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 111 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 111 transition count 243
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 111 transition count 246
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 111 transition count 246
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 111 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 107 transition count 236
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 107 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 107 transition count 233
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 107 transition count 263
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 48 rules in 44 ms. Remains 107 /123 variables (removed 16) and now considering 263/267 (removed 4) transitions.
[2024-06-02 21:23:56] [INFO ] Redundant transitions in 3 ms returned []
Running 262 sub problems to find dead transitions.
[2024-06-02 21:23:56] [INFO ] Flow matrix only has 253 transitions (discarded 10 similar events)
// Phase 1: matrix 253 rows 107 cols
[2024-06-02 21:23:56] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:23:56] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 21:24:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-02 21:24:00] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 21:24:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 21:24:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-02 21:24:00] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD169 is UNSAT
[2024-06-02 21:24:01] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 11/22 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/22 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 252/359 variables, 107/129 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 28/157 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/157 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/158 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/158 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/158 constraints. Problems are: Problem set: 45 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 158 constraints, problems are : Problem set: 45 solved, 217 unsolved in 17496 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 45 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 30/104 variables, 9/9 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 11/21 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 3/107 variables, 1/22 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/22 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 252/359 variables, 107/129 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 28/157 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 217/374 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/374 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/375 constraints. Problems are: Problem set: 45 solved, 217 unsolved
[2024-06-02 21:24:26] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/376 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/376 constraints. Problems are: Problem set: 45 solved, 217 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/376 constraints. Problems are: Problem set: 45 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 376 constraints, problems are : Problem set: 45 solved, 217 unsolved in 23373 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 217/262 constraints, Known Traps: 12/12 constraints]
After SMT, in 41061ms problems are : Problem set: 45 solved, 217 unsolved
Search for dead transitions found 45 dead transitions in 41066ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/123 places, 218/267 transitions.
Graph (complete) has 442 edges and 107 vertex of which 75 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 75 /107 variables (removed 32) and now considering 218/218 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/123 places, 218/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41168 ms. Remains : 75/123 places, 218/267 transitions.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 267/267 (removed 0) transitions.
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 21:24:37] [INFO ] Computed 11 invariants in 15 ms
[2024-06-02 21:24:37] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 21:24:37] [INFO ] Invariant cache hit.
[2024-06-02 21:24:37] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 21:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:24:40] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:24:40] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:24:40] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:24:40] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 2 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:24:41] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:24:42] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:24:42] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:24:42] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:24:42] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:24:45] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:24:45] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:24:45] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 2 ms to minimize.
[2024-06-02 21:24:45] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:24:45] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:24:47] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:24:47] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:24:47] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:24:49] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
[2024-06-02 21:24:49] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:24:49] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:24:50] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:24:50] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 3 ms to minimize.
[2024-06-02 21:24:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:24:53] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:24:53] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 3 ms to minimize.
[2024-06-02 21:24:53] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:24:53] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 3 ms to minimize.
[2024-06-02 21:24:53] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 267/390 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:25:00] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/390 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 168 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:25:10] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:25:10] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 267/390 variables, 123/170 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 266/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 21:25:16] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:25:16] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:25:16] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:25:17] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:25:17] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 441 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 41/41 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 123/123 places, 267/267 transitions.
Treatment of property MedleyA-PT-20-LTLCardinality-10 finished in 226729 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((G(p0)||X((X(G(p2))||p1)))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 128 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 128 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 128 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 122 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 122 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 122 transition count 261
Applied a total of 41 rules in 12 ms. Remains 122 /140 variables (removed 18) and now considering 261/301 (removed 40) transitions.
// Phase 1: matrix 261 rows 122 cols
[2024-06-02 21:25:38] [INFO ] Computed 11 invariants in 7 ms
[2024-06-02 21:25:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-02 21:25:38] [INFO ] Invariant cache hit.
[2024-06-02 21:25:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-02 21:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:25:42] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:25:44] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:25:44] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:25:45] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-06-02 21:25:46] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 261/383 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:25:58] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (OVERLAPS) 0/383 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 147 constraints, problems are : Problem set: 0 solved, 260 unsolved in 29078 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:26:10] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:26:11] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:26:12] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 261/383 variables, 122/150 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 260/410 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 21:26:17] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:26:17] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
[2024-06-02 21:26:18] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:26:18] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:26:18] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 415 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 22/22 constraints]
After SMT, in 59177ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 59182ms
Starting structural reductions in LTL mode, iteration 1 : 122/140 places, 261/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59691 ms. Remains : 122/140 places, 261/301 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Computed a total of 12 stabilizing places and 17 stable transitions
Computed a total of 12 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-20-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLCardinality-11 finished in 60821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 107 edges and 140 vertex of which 15 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 127 transition count 276
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 123 transition count 274
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11 place count 123 transition count 265
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 29 place count 114 transition count 265
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 41 place count 102 transition count 245
Iterating global reduction 2 with 12 rules applied. Total rules applied 53 place count 102 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 102 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 101 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 101 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 100 transition count 239
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 99 transition count 236
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 99 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 99 transition count 235
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 90 place count 86 transition count 222
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 79 transition count 201
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 79 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 108 place count 79 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 122 place count 72 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 126 place count 72 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 71 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 71 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 129 place count 71 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 131 place count 69 transition count 200
Applied a total of 131 rules in 65 ms. Remains 69 /140 variables (removed 71) and now considering 200/301 (removed 101) transitions.
[2024-06-02 21:26:38] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
// Phase 1: matrix 190 rows 69 cols
[2024-06-02 21:26:38] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:26:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 21:26:39] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-06-02 21:26:39] [INFO ] Invariant cache hit.
[2024-06-02 21:26:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:26:39] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-02 21:26:39] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 21:26:39] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-06-02 21:26:39] [INFO ] Invariant cache hit.
[2024-06-02 21:26:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 21:26:42] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 21:26:45] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 83 constraints, problems are : Problem set: 0 solved, 182 unsolved in 9721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 182/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 265 constraints, problems are : Problem set: 0 solved, 182 unsolved in 8461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 2/2 constraints]
After SMT, in 18263ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18266ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/140 places, 200/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18784 ms. Remains : 69/140 places, 200/301 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-14
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-14 finished in 18845 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(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 277
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 125 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 117 transition count 255
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 116 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 116 transition count 249
Applied a total of 54 rules in 9 ms. Remains 116 /140 variables (removed 24) and now considering 249/301 (removed 52) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-02 21:26:57] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:26:57] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-02 21:26:57] [INFO ] Invariant cache hit.
[2024-06-02 21:26:58] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-02 21:26:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:00] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:27:00] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 3 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 2 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 3 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 5 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:27:02] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-06-02 21:27:02] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:04] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 2 ms to minimize.
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:06] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:09] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2024-06-02 21:27:09] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:13] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:20] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:27:32] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 22017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 52124ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 52127ms
Starting structural reductions in LTL mode, iteration 1 : 116/140 places, 249/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52487 ms. Remains : 116/140 places, 249/301 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 477 steps with 12 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-15 finished in 52598 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&&G(p1)))))'
Found a Shortening insensitive property : MedleyA-PT-20-LTLCardinality-10
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 108 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 112 transition count 261
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 103 transition count 246
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 103 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 103 transition count 243
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 102 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 54 place count 102 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 101 transition count 241
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 82 place count 88 transition count 228
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 87 place count 83 transition count 213
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 83 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 95 place count 83 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 107 place count 77 transition count 226
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 75 transition count 224
Applied a total of 109 rules in 57 ms. Remains 75 /140 variables (removed 65) and now considering 224/301 (removed 77) transitions.
[2024-06-02 21:27:50] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 75 cols
[2024-06-02 21:27:50] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:27:50] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-02 21:27:50] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:27:50] [INFO ] Invariant cache hit.
[2024-06-02 21:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:27:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-02 21:27:51] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:27:51] [INFO ] Invariant cache hit.
[2024-06-02 21:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:27:54] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:27:54] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:27:56] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 5 ms to minimize.
[2024-06-02 21:27:56] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/289 variables, and 91 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 198/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/289 variables, and 289 constraints, problems are : Problem set: 0 solved, 198 unsolved in 9873 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 22097ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 22099ms
Starting structural reductions in LI_LTL mode, iteration 1 : 75/140 places, 224/301 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 22746 ms. Remains : 75/140 places, 224/301 transitions.
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 1 reset in 216 ms.
Product exploration explored 100000 steps with 1 reset in 286 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (31 resets) in 132 ms. (300 steps per ms) remains 1/3 properties
BEST_FIRST walk for 36916 steps (32 resets) in 105 ms. (348 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 237 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 224/224 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-02 21:28:14] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:28:14] [INFO ] Invariant cache hit.
[2024-06-02 21:28:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 21:28:14] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:28:14] [INFO ] Invariant cache hit.
[2024-06-02 21:28:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:28:15] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-02 21:28:15] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:28:15] [INFO ] Invariant cache hit.
[2024-06-02 21:28:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:28:18] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:28:19] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:28:20] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:28:21] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/289 variables, and 91 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12179 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 198/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/289 variables, and 289 constraints, problems are : Problem set: 0 solved, 198 unsolved in 9584 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 21902ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 21906ms
Finished structural reductions in LTL mode , in 1 iterations and 22310 ms. Remains : 75/75 places, 224/224 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (30 resets) in 125 ms. (317 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 185 ms.
Product exploration explored 100000 steps with 4 reset in 307 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 224/224 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 74 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 74 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 74 transition count 217
Applied a total of 6 rules in 16 ms. Remains 74 /75 variables (removed 1) and now considering 217/224 (removed 7) transitions.
[2024-06-02 21:28:39] [INFO ] Redundant transitions in 2 ms returned []
Running 192 sub problems to find dead transitions.
[2024-06-02 21:28:39] [INFO ] Flow matrix only has 207 transitions (discarded 10 similar events)
// Phase 1: matrix 207 rows 74 cols
[2024-06-02 21:28:39] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-02 21:28:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:28:43] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 206/280 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-02 21:28:48] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/280 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 89 constraints, problems are : Problem set: 0 solved, 192 unsolved in 13826 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 206/280 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 192/281 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 281 constraints, problems are : Problem set: 0 solved, 192 unsolved in 9614 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 3/3 constraints]
After SMT, in 23573ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 23576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/75 places, 217/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23601 ms. Remains : 74/75 places, 217/224 transitions.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 224/224 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-02 21:29:02] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 75 cols
[2024-06-02 21:29:02] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:29:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:29:02] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:29:02] [INFO ] Invariant cache hit.
[2024-06-02 21:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:29:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-02 21:29:03] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2024-06-02 21:29:03] [INFO ] Invariant cache hit.
[2024-06-02 21:29:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:29:06] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:29:07] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/289 variables, and 91 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12461 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 213/288 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 198/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/289 variables, and 289 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10480 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 23089ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 23094ms
Finished structural reductions in LTL mode , in 1 iterations and 23406 ms. Remains : 75/75 places, 224/224 transitions.
Treatment of property MedleyA-PT-20-LTLCardinality-10 finished in 95842 ms.
[2024-06-02 21:29:26] [INFO ] Flatten gal took : 38 ms
[2024-06-02 21:29:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 21:29:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 301 transitions and 1043 arcs took 12 ms.
Total runtime 668393 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-20-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717363766717

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-20-LTLCardinality-10
ltl formula formula --ltl=/tmp/2212/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 301 transitions and 1043 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2212/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2212/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2212/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2212/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 141 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 141, there are 320 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~299!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 715
pnml2lts-mc( 0/ 4): unique states count: 2906
pnml2lts-mc( 0/ 4): unique transitions count: 10840
pnml2lts-mc( 0/ 4): - self-loop count: 101
pnml2lts-mc( 0/ 4): - claim dead count: 1239
pnml2lts-mc( 0/ 4): - claim found count: 1982
pnml2lts-mc( 0/ 4): - claim success count: 2917
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1484
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2917 states 10866 transitions, fanout: 3.725
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36462, Transitions per second: 135825
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 12.8 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-20, 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 r579-smll-171734921400155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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