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-171734921300147.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-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-LTLCardinality-00
FORMULA_NAME MedleyA-PT-19-LTLCardinality-01
FORMULA_NAME MedleyA-PT-19-LTLCardinality-02
FORMULA_NAME MedleyA-PT-19-LTLCardinality-03
FORMULA_NAME MedleyA-PT-19-LTLCardinality-04
FORMULA_NAME MedleyA-PT-19-LTLCardinality-05
FORMULA_NAME MedleyA-PT-19-LTLCardinality-06
FORMULA_NAME MedleyA-PT-19-LTLCardinality-07
FORMULA_NAME MedleyA-PT-19-LTLCardinality-08
FORMULA_NAME MedleyA-PT-19-LTLCardinality-09
FORMULA_NAME MedleyA-PT-19-LTLCardinality-10
FORMULA_NAME MedleyA-PT-19-LTLCardinality-11
FORMULA_NAME MedleyA-PT-19-LTLCardinality-12
FORMULA_NAME MedleyA-PT-19-LTLCardinality-13
FORMULA_NAME MedleyA-PT-19-LTLCardinality-14
FORMULA_NAME MedleyA-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717361975818

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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:59:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:59:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:59:38] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-06-02 20:59:38] [INFO ] Transformed 272 places.
[2024-06-02 20:59:38] [INFO ] Transformed 586 transitions.
[2024-06-02 20:59:38] [INFO ] Found NUPN structural information;
[2024-06-02 20:59:38] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3 places in 22 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 70 place count 199 transition count 503
Iterating global reduction 1 with 68 rules applied. Total rules applied 138 place count 199 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 198 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 198 transition count 501
Applied a total of 140 rules in 123 ms. Remains 198 /269 variables (removed 71) and now considering 501/583 (removed 82) transitions.
// Phase 1: matrix 501 rows 198 cols
[2024-06-02 20:59:39] [INFO ] Computed 22 invariants in 46 ms
[2024-06-02 20:59:40] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-02 20:59:40] [INFO ] Invariant cache hit.
[2024-06-02 20:59:40] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-02 20:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/198 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 380 unsolved
[2024-06-02 20:59:51] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 47 ms to minimize.
[2024-06-02 20:59:51] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:59:51] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-02 20:59:52] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:59:52] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:59:52] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:59:54] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:59:54] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:59:54] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:59:54] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-06-02 20:59:55] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:59:55] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 17/39 constraints. Problems are: Problem set: 120 solved, 380 unsolved
[2024-06-02 21:00:00] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:00:01] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:00:01] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:00:01] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 4/43 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/43 constraints. Problems are: Problem set: 120 solved, 380 unsolved
(s10 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 501/699 variables, 198/241 constraints. Problems are: Problem set: 120 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/699 variables, and 241 constraints, problems are : Problem set: 120 solved, 380 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 120 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 21/43 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/43 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 501/699 variables, 198/241 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 380/621 constraints. Problems are: Problem set: 120 solved, 380 unsolved
[2024-06-02 21:00:27] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-06-02 21:00:27] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-06-02 21:00:27] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 3 ms to minimize.
[2024-06-02 21:00:28] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-06-02 21:00:28] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2024-06-02 21:00:30] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-06-02 21:00:30] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 2 ms to minimize.
[2024-06-02 21:00:30] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-06-02 21:00:30] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-06-02 21:00:31] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 3 ms to minimize.
[2024-06-02 21:00:33] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 3 ms to minimize.
[2024-06-02 21:00:33] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 2 ms to minimize.
[2024-06-02 21:00:33] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:00:33] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 7 ms to minimize.
[2024-06-02 21:00:33] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 2 ms to minimize.
[2024-06-02 21:00:34] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-06-02 21:00:34] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:00:35] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:00:36] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 640 constraints, problems are : Problem set: 120 solved, 380 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 380/500 constraints, Known Traps: 40/40 constraints]
After SMT, in 62043ms problems are : Problem set: 120 solved, 380 unsolved
Search for dead transitions found 120 dead transitions in 62096ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/269 places, 381/583 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63580 ms. Remains : 198/269 places, 381/583 transitions.
Support contains 35 out of 198 places after structural reductions.
[2024-06-02 21:00:43] [INFO ] Flatten gal took : 139 ms
[2024-06-02 21:00:43] [INFO ] Flatten gal took : 70 ms
[2024-06-02 21:00:43] [INFO ] Input system was already deterministic with 381 transitions.
Support contains 33 out of 198 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 3094 ms. (12 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40002 steps (20 resets) in 421 ms. (94 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (27 resets) in 476 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (27 resets) in 293 ms. (136 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40000 steps (24 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (12 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (23 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (29 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (14 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
// Phase 1: matrix 381 rows 198 cols
[2024-06-02 21:00:45] [INFO ] Computed 22 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 68/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 3 (OVERLAPS) 89/176 variables, 13/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/179 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 370/549 variables, 179/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 19/568 variables, 13/212 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/569 variables, 2/214 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 1/215 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/569 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/576 variables, 3/218 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/579 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/579 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/579 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 220 constraints, problems are : Problem set: 1 solved, 7 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 70/85 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 90/175 variables, 13/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 5/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/178 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 368/546 variables, 178/203 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 6/209 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 19/565 variables, 12/221 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 21:00:47] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/566 variables, 2/225 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 10/576 variables, 5/231 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/576 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 3/579 variables, 2/233 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 21:00:48] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:00:48] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:00:48] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 3/236 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/579 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/579 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 236 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 3799ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 5 properties in 3220 ms.
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 381/381 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 198 transition count 348
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 166 transition count 342
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 163 transition count 342
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 74 place count 163 transition count 333
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 92 place count 154 transition count 333
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 104 place count 142 transition count 318
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 142 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 116 place count 142 transition count 316
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 140 transition count 316
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 189 place count 105 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 105 transition count 280
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 104 transition count 278
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 104 transition count 278
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 205 place count 98 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 229 place count 98 transition count 293
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 98 transition count 287
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 241 place count 92 transition count 287
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 257 place count 92 transition count 420
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 310 place count 76 transition count 383
Applied a total of 310 rules in 192 ms. Remains 76 /198 variables (removed 122) and now considering 383/381 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 76/198 places, 383/381 transitions.
RANDOM walk for 40000 steps (3984 resets) in 436 ms. (91 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (607 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
// Phase 1: matrix 383 rows 76 cols
[2024-06-02 21:00:52] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:00:52] [INFO ] State equation strengthened by 203 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/44 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/69 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 381/454 variables, 73/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 203/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/457 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/459 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/459 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 76/76 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/44 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:00:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/69 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/73 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:00:53] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 12 ms to minimize.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 73/459 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/76 constraints, ReadFeed: 0/203 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 614ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyA-PT-19-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 21 stabilizing places and 23 stable transitions
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 163 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 74 place count 160 transition count 330
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 3 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 195 place count 98 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 97 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 97 transition count 275
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 92 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 227 place count 92 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 91 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 90 transition count 293
Applied a total of 230 rules in 80 ms. Remains 90 /198 variables (removed 108) and now considering 293/381 (removed 88) transitions.
[2024-06-02 21:00:53] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
// Phase 1: matrix 292 rows 90 cols
[2024-06-02 21:00:53] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:00:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:00:53] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
[2024-06-02 21:00:53] [INFO ] Invariant cache hit.
[2024-06-02 21:00:53] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:00:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 21:00:54] [INFO ] Redundant transitions in 103 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 21:00:54] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
[2024-06-02 21:00:54] [INFO ] Invariant cache hit.
[2024-06-02 21:00:54] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 291/381 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 135/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 245 constraints, problems are : Problem set: 0 solved, 285 unsolved in 16842 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 291/381 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 135/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 285/529 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 530 constraints, problems are : Problem set: 0 solved, 285 unsolved in 27375 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
After SMT, in 44678ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 44683ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/198 places, 293/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45233 ms. Remains : 90/198 places, 293/381 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-02
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 6 ms.
FORMULA MedleyA-PT-19-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-02 finished in 45564 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(((X((X(G(p2)) U G(p2)))||p1)&&p0))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 163 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 74 place count 160 transition count 332
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 90 place count 152 transition count 332
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 104 place count 138 transition count 315
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 138 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 118 place count 138 transition count 313
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 136 transition count 313
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 193 place count 99 transition count 279
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 94 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 221 place count 94 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 93 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 92 transition count 292
Applied a total of 224 rules in 67 ms. Remains 92 /198 variables (removed 106) and now considering 292/381 (removed 89) transitions.
[2024-06-02 21:01:39] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 92 cols
[2024-06-02 21:01:39] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:01:39] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 21:01:39] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:01:39] [INFO ] Invariant cache hit.
[2024-06-02 21:01:39] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-02 21:01:39] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-06-02 21:01:39] [INFO ] Redundant transitions in 65 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 21:01:39] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:01:39] [INFO ] Invariant cache hit.
[2024-06-02 21:01:39] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/382 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 133/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 245 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/382 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 133/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 284/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/383 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 529 constraints, problems are : Problem set: 0 solved, 284 unsolved in 24941 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 45813ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 45818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/198 places, 292/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46501 ms. Remains : 92/198 places, 292/381 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-04
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-04 finished in 46695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 163 transition count 341
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 161 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 74 place count 160 transition count 330
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 4 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 69 rules applied. Total rules applied 197 place count 97 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 96 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 96 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 209 place count 91 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 229 place count 91 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 231 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 89 transition count 292
Applied a total of 232 rules in 58 ms. Remains 89 /198 variables (removed 109) and now considering 292/381 (removed 89) transitions.
[2024-06-02 21:02:25] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2024-06-02 21:02:25] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:02:25] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:02:25] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:02:25] [INFO ] Invariant cache hit.
[2024-06-02 21:02:26] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:02:26] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-02 21:02:26] [INFO ] Redundant transitions in 77 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 21:02:26] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:02:26] [INFO ] Invariant cache hit.
[2024-06-02 21:02:26] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 244 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20746 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 284/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 29951 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 51283ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 51289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/198 places, 292/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51890 ms. Remains : 89/198 places, 292/381 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-05 finished in 51986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(p1)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 187 transition count 368
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 187 transition count 368
Applied a total of 22 rules in 7 ms. Remains 187 /198 variables (removed 11) and now considering 368/381 (removed 13) transitions.
// Phase 1: matrix 368 rows 187 cols
[2024-06-02 21:03:17] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:03:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 21:03:17] [INFO ] Invariant cache hit.
[2024-06-02 21:03:18] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-06-02 21:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 4 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:03:27] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:03:27] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:03:27] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/555 variables, 187/223 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:03:42] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 3 ms to minimize.
[2024-06-02 21:03:43] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 3 ms to minimize.
[2024-06-02 21:03:43] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 3 ms to minimize.
[2024-06-02 21:03:43] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:03:43] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:03:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:03:44] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:03:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:03:44] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 9/232 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:03:48] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 233 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/555 variables, 187/233 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 367/600 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:04:02] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 603 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 27/27 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 368/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61393 ms. Remains : 187/198 places, 368/381 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 547 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 655 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 121 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-07 finished in 62580 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) U G(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 186 transition count 368
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 186 transition count 368
Applied a total of 24 rules in 15 ms. Remains 186 /198 variables (removed 12) and now considering 368/381 (removed 13) transitions.
// Phase 1: matrix 368 rows 186 cols
[2024-06-02 21:04:20] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:04:20] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 21:04:20] [INFO ] Invariant cache hit.
[2024-06-02 21:04:20] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-06-02 21:04:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:04:27] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:04:27] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:04:27] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/216 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:04:37] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 4 ms to minimize.
[2024-06-02 21:04:38] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 3 ms to minimize.
[2024-06-02 21:04:38] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2024-06-02 21:04:38] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:04:39] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:04:39] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 222 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:04:58] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/554 variables, 186/225 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 367/592 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 21:05:11] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:05:11] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:05:12] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 595 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 20/20 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60684ms
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 368/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61267 ms. Remains : 186/198 places, 368/381 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-09
Product exploration explored 100000 steps with 7 reset in 205 ms.
Product exploration explored 100000 steps with 4 reset in 472 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 652 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 208 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 40000 steps (17 resets) in 362 ms. (110 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (13 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (23 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (19 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
[2024-06-02 21:05:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/73 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 77/150 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 9/159 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 352/511 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/535 variables, 16/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/537 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/548 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/554 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/554 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/29 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/73 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/150 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/159 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 352/511 variables, 159/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 2/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 24/535 variables, 16/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/537 variables, 4/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 11/548 variables, 5/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/554 variables, 4/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/554 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/554 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 210 constraints, problems are : Problem set: 1 solved, 2 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1068ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 486 ms.
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 368/368 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 72 place count 152 transition count 317
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 139 transition count 317
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 136 transition count 311
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 136 transition count 311
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 172 place count 101 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 101 transition count 276
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 186 place count 95 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 210 place count 95 transition count 291
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 216 place count 95 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 222 place count 89 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 238 place count 89 transition count 418
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 291 place count 73 transition count 381
Applied a total of 291 rules in 105 ms. Remains 73 /186 variables (removed 113) and now considering 381/368 (removed -13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 73/186 places, 381/368 transitions.
RANDOM walk for 8865 steps (926 resets) in 181 ms. (48 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 429 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 368/368 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 185 transition count 337
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 155 transition count 331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 152 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 69 place count 152 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 97 place count 138 transition count 317
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 135 transition count 311
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 135 transition count 311
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 167 place count 102 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 179 place count 96 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 203 place count 96 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 95 transition count 294
Applied a total of 204 rules in 65 ms. Remains 95 /186 variables (removed 91) and now considering 294/368 (removed 74) transitions.
[2024-06-02 21:05:25] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
// Phase 1: matrix 293 rows 95 cols
[2024-06-02 21:05:25] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:05:26] [INFO ] Implicit Places using invariants in 127 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/186 places, 294/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 94 /94 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 94/186 places, 294/368 transitions.
Computed a total of 14 stabilizing places and 145 stable transitions
Graph (complete) has 512 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 145 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 40000 steps (3229 resets) in 570 ms. (70 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (604 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (453 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (537 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2024-06-02 21:05:26] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
// Phase 1: matrix 293 rows 94 cols
[2024-06-02 21:05:26] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:05:26] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 277/357 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 121/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 29/386 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 12/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/387 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 247 constraints, problems are : Problem set: 0 solved, 3 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 277/357 variables, 80/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 121/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 2/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 29/386 variables, 14/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 4/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 12/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/387 variables, 1/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 249 constraints, problems are : Problem set: 1 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 291
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 94 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 88 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 88 transition count 418
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 84 place count 72 transition count 381
Applied a total of 84 rules in 24 ms. Remains 72 /94 variables (removed 22) and now considering 381/294 (removed -87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 72/94 places, 381/294 transitions.
RANDOM walk for 7357 steps (770 resets) in 147 ms. (49 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 666 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 406 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 286 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-02 21:05:29] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:05:29] [INFO ] Invariant cache hit.
[2024-06-02 21:05:29] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 21:05:29] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:05:29] [INFO ] Invariant cache hit.
[2024-06-02 21:05:29] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-02 21:05:30] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-02 21:05:30] [INFO ] Redundant transitions in 3 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 21:05:30] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:05:30] [INFO ] Invariant cache hit.
[2024-06-02 21:05:30] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 21:05:33] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:05:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 292/386 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 133/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 249 constraints, problems are : Problem set: 0 solved, 290 unsolved in 18490 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 292/386 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 133/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 290/538 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 1/387 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 21:06:04] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 21:06:10] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:06:10] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 542 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
After SMT, in 49103ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 49110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49530 ms. Remains : 94/94 places, 294/294 transitions.
Treatment of property MedleyA-PT-19-LTLCardinality-09 finished in 119033 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)&&F(G(p1)))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 195 transition count 347
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 164 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 161 transition count 341
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 161 transition count 331
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 151 transition count 331
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 106 place count 137 transition count 313
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 137 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 120 place count 137 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 136 transition count 312
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 191 place count 100 transition count 279
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 99 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 99 transition count 277
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 94 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 223 place count 94 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 93 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 92 transition count 295
Applied a total of 226 rules in 77 ms. Remains 92 /198 variables (removed 106) and now considering 295/381 (removed 86) transitions.
[2024-06-02 21:06:19] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
// Phase 1: matrix 294 rows 92 cols
[2024-06-02 21:06:19] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:06:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:06:19] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
[2024-06-02 21:06:19] [INFO ] Invariant cache hit.
[2024-06-02 21:06:19] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-02 21:06:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-06-02 21:06:19] [INFO ] Redundant transitions in 45 ms returned []
Running 287 sub problems to find dead transitions.
[2024-06-02 21:06:20] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
[2024-06-02 21:06:20] [INFO ] Invariant cache hit.
[2024-06-02 21:06:20] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 21:06:22] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 293/385 variables, 92/112 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 219 constraints, problems are : Problem set: 0 solved, 287 unsolved in 17844 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 293/385 variables, 92/112 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 287/505 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 506 constraints, problems are : Problem set: 0 solved, 287 unsolved in 25179 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 1/1 constraints]
After SMT, in 43407ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 43411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/198 places, 295/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44001 ms. Remains : 92/198 places, 295/381 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-10
Stuttering criterion allowed to conclude after 54 steps with 4 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-10 finished in 44179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(X(p1)))&&F(p0))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 185 transition count 366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 185 transition count 366
Applied a total of 26 rules in 6 ms. Remains 185 /198 variables (removed 13) and now considering 366/381 (removed 15) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:07:03] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:07:03] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 21:07:03] [INFO ] Invariant cache hit.
[2024-06-02 21:07:04] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 21:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:07:10] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:07:10] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:07:10] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:07:11] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:07:11] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:07:11] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:07:11] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 3 ms to minimize.
[2024-06-02 21:07:12] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-06-02 21:07:12] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 2 ms to minimize.
[2024-06-02 21:07:12] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:07:12] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:07:13] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:07:13] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:07:13] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:07:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:07:13] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:07:21] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-06-02 21:07:22] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 3 ms to minimize.
[2024-06-02 21:07:22] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 ms to minimize.
[2024-06-02 21:07:22] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:07:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:07:23] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:07:23] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:07:23] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 8/231 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:07:32] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 365 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 551/551 variables, and 232 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/232 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/597 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:07:48] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-06-02 21:07:49] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 599 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 27/27 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60705ms
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 366/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61302 ms. Remains : 185/198 places, 366/381 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Product exploration explored 100000 steps with 33333 reset in 342 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 23 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-13 finished in 62366 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)||(p1&&F(p0)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 186 transition count 367
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 186 transition count 367
Applied a total of 24 rules in 4 ms. Remains 186 /198 variables (removed 12) and now considering 367/381 (removed 14) transitions.
// Phase 1: matrix 367 rows 186 cols
[2024-06-02 21:08:05] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:08:06] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 21:08:06] [INFO ] Invariant cache hit.
[2024-06-02 21:08:06] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-02 21:08:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:08:13] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:08:13] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:08:13] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:08:13] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-06-02 21:08:13] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:08:14] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:08:14] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:08:14] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 21:08:21] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 4 ms to minimize.
[2024-06-02 21:08:21] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 4 ms to minimize.
[2024-06-02 21:08:21] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2024-06-02 21:08:21] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:08:22] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:08:22] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:08:23] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 230 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 366/596 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 21:08:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-06-02 21:08:49] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-06-02 21:08:50] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:08:50] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-06-02 21:08:52] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-06-02 21:08:52] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 6/602 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 602 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 28/28 constraints]
After SMT, in 60661ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 367/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61115 ms. Remains : 186/198 places, 367/381 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 654 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-14 finished in 61771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 195 transition count 348
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 165 transition count 342
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 162 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 161 transition count 341
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 72 place count 161 transition count 330
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 4 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 193 place count 99 transition count 278
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 98 transition count 276
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 98 transition count 276
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 207 place count 92 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 231 place count 92 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 91 transition count 291
Applied a total of 232 rules in 60 ms. Remains 91 /198 variables (removed 107) and now considering 291/381 (removed 90) transitions.
[2024-06-02 21:09:07] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
// Phase 1: matrix 290 rows 91 cols
[2024-06-02 21:09:07] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:09:07] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 21:09:07] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:09:07] [INFO ] Invariant cache hit.
[2024-06-02 21:09:08] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:09:08] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 21:09:08] [INFO ] Redundant transitions in 56 ms returned []
Running 287 sub problems to find dead transitions.
[2024-06-02 21:09:08] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:09:08] [INFO ] Invariant cache hit.
[2024-06-02 21:09:08] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 21:09:11] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 289/380 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 135/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/381 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 247 constraints, problems are : Problem set: 0 solved, 287 unsolved in 14867 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 289/380 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 135/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 287/533 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 21:09:32] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 12 (OVERLAPS) 0/381 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 535 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 2/2 constraints]
After SMT, in 45425ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 45430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/198 places, 291/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45968 ms. Remains : 91/198 places, 291/381 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-15
Product exploration explored 100000 steps with 10 reset in 54 ms.
Product exploration explored 100000 steps with 4 reset in 63 ms.
Computed a total of 13 stabilizing places and 143 stable transitions
Computed a total of 13 stabilizing places and 143 stable transitions
Detected a total of 13/91 stabilizing places and 143/291 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 291/291 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 21:09:54] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:09:54] [INFO ] Invariant cache hit.
[2024-06-02 21:09:54] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 21:09:54] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:09:54] [INFO ] Invariant cache hit.
[2024-06-02 21:09:54] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:09:54] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-02 21:09:54] [INFO ] Redundant transitions in 47 ms returned []
Running 287 sub problems to find dead transitions.
[2024-06-02 21:09:54] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:09:54] [INFO ] Invariant cache hit.
[2024-06-02 21:09:54] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 21:09:58] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 289/380 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 135/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/381 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 247 constraints, problems are : Problem set: 0 solved, 287 unsolved in 18740 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 289/380 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 135/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 287/533 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 21:10:24] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 535 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 2/2 constraints]
After SMT, in 49113ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 49116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49676 ms. Remains : 91/91 places, 291/291 transitions.
Computed a total of 13 stabilizing places and 143 stable transitions
Computed a total of 13 stabilizing places and 143 stable transitions
Detected a total of 13/91 stabilizing places and 143/291 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 198 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 221 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-15 finished in 97223 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) U G(p1))))'
Found a Lengthening insensitive property : MedleyA-PT-19-LTLCardinality-09
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 197 transition count 349
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 68 place count 166 transition count 343
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 163 transition count 343
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 71 place count 163 transition count 332
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 93 place count 152 transition count 332
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 106 place count 139 transition count 316
Iterating global reduction 3 with 13 rules applied. Total rules applied 119 place count 139 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 119 place count 139 transition count 314
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 137 transition count 314
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 189 place count 103 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 102 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 102 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 203 place count 96 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 95 transition count 318
Applied a total of 204 rules in 50 ms. Remains 95 /198 variables (removed 103) and now considering 318/381 (removed 63) transitions.
[2024-06-02 21:10:45] [INFO ] Flow matrix only has 317 transitions (discarded 1 similar events)
// Phase 1: matrix 317 rows 95 cols
[2024-06-02 21:10:45] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:10:45] [INFO ] Implicit Places using invariants in 146 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/198 places, 318/381 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 217 ms. Remains : 94/198 places, 318/381 transitions.
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 213 ms.
Product exploration explored 100000 steps with 3 reset in 200 ms.
Computed a total of 14 stabilizing places and 157 stable transitions
Graph (complete) has 521 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 157 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 440 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 40000 steps (3221 resets) in 242 ms. (164 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (629 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (426 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (541 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2024-06-02 21:10:47] [INFO ] Flow matrix only has 317 transitions (discarded 1 similar events)
// Phase 1: matrix 317 rows 94 cols
[2024-06-02 21:10:47] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:10:47] [INFO ] State equation strengthened by 146 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 301/381 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 133/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 29/410 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 12/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/411 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/411 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 301/381 variables, 80/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 133/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 2/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 29/410 variables, 14/244 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 4/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 12/260 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/411 variables, 1/261 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/411 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 261 constraints, problems are : Problem set: 1 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 830ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 318/318 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 27 place count 94 transition count 291
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 94 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 88 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 88 transition count 418
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 108 place count 72 transition count 381
Applied a total of 108 rules in 45 ms. Remains 72 /94 variables (removed 22) and now considering 381/318 (removed -63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 72/94 places, 381/318 transitions.
RANDOM walk for 9504 steps (984 resets) in 261 ms. (36 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 516 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 318/318 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 94 transition count 294
Applied a total of 24 rules in 18 ms. Remains 94 /94 variables (removed 0) and now considering 294/318 (removed 24) transitions.
[2024-06-02 21:10:48] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
// Phase 1: matrix 293 rows 94 cols
[2024-06-02 21:10:48] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:10:49] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 21:10:49] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:10:49] [INFO ] Invariant cache hit.
[2024-06-02 21:10:49] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-02 21:10:49] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-02 21:10:49] [INFO ] Redundant transitions in 2 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 21:10:49] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:10:49] [INFO ] Invariant cache hit.
[2024-06-02 21:10:49] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 292/386 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 133/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 249 constraints, problems are : Problem set: 0 solved, 290 unsolved in 18164 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 292/386 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 133/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 290/538 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 21:11:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:11:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 1/387 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 541 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 4/4 constraints]
After SMT, in 48544ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 48548ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/94 places, 294/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49111 ms. Remains : 94/94 places, 294/318 transitions.
Computed a total of 14 stabilizing places and 145 stable transitions
Graph (complete) has 512 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 145 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 497 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 40000 steps (3243 resets) in 777 ms. (51 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (577 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (457 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (535 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
[2024-06-02 21:11:39] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2024-06-02 21:11:39] [INFO ] Invariant cache hit.
[2024-06-02 21:11:39] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 277/357 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 121/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 29/386 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 12/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/387 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 247 constraints, problems are : Problem set: 0 solved, 3 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/71 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/80 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 277/357 variables, 80/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 121/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 2/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 29/386 variables, 14/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 4/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 12/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/387 variables, 1/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 249 constraints, problems are : Problem set: 1 solved, 2 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 291
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 94 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 88 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 88 transition count 418
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 84 place count 72 transition count 381
Applied a total of 84 rules in 34 ms. Remains 72 /94 variables (removed 22) and now considering 381/294 (removed -87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 72/94 places, 381/294 transitions.
RANDOM walk for 17037 steps (1763 resets) in 326 ms. (52 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 732 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
Treatment of property MedleyA-PT-19-LTLCardinality-09 finished in 56447 ms.
FORMULA MedleyA-PT-19-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 21:11:41] [INFO ] Flatten gal took : 54 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 723257 ms.
ITS solved all properties within timeout

BK_STOP 1717362701541

--------------------
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

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-19"
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-19, 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-171734921300147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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