MCC'2024- Execution of r579-smll-171734921300148

About the Execution of LTSMin+red for MedleyA-PT-19

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1811.695	988180.00	1123711.00	3480.30	FFFFFFFFFFTFFTFF	normal

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-171734921300148.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300148
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME MedleyA-PT-19-LTLFireability-01
FORMULA_NAME MedleyA-PT-19-LTLFireability-02
FORMULA_NAME MedleyA-PT-19-LTLFireability-03
FORMULA_NAME MedleyA-PT-19-LTLFireability-04
FORMULA_NAME MedleyA-PT-19-LTLFireability-05
FORMULA_NAME MedleyA-PT-19-LTLFireability-06
FORMULA_NAME MedleyA-PT-19-LTLFireability-07
FORMULA_NAME MedleyA-PT-19-LTLFireability-08
FORMULA_NAME MedleyA-PT-19-LTLFireability-09
FORMULA_NAME MedleyA-PT-19-LTLFireability-10
FORMULA_NAME MedleyA-PT-19-LTLFireability-11
FORMULA_NAME MedleyA-PT-19-LTLFireability-12
FORMULA_NAME MedleyA-PT-19-LTLFireability-13
FORMULA_NAME MedleyA-PT-19-LTLFireability-14
FORMULA_NAME MedleyA-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362085943

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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 21:01:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:01:29] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2024-06-02 21:01:29] [INFO ] Transformed 272 places.
[2024-06-02 21:01:29] [INFO ] Transformed 586 transitions.
[2024-06-02 21:01:29] [INFO ] Found NUPN structural information;
[2024-06-02 21:01:29] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3 places in 23 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 77 place count 192 transition count 496
Iterating global reduction 1 with 75 rules applied. Total rules applied 152 place count 192 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 189 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 189 transition count 490
Applied a total of 158 rules in 134 ms. Remains 189 /269 variables (removed 80) and now considering 490/583 (removed 93) transitions.
// Phase 1: matrix 490 rows 189 cols
[2024-06-02 21:01:29] [INFO ] Computed 22 invariants in 44 ms
[2024-06-02 21:01:30] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-06-02 21:01:30] [INFO ] Invariant cache hit.
[2024-06-02 21:01:31] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-06-02 21:01:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-02 21:01:41] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 33 ms to minimize.
[2024-06-02 21:01:41] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2024-06-02 21:01:42] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 3 ms to minimize.
[2024-06-02 21:01:42] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 3 ms to minimize.
[2024-06-02 21:01:42] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-06-02 21:01:42] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:01:43] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:01:43] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:01:43] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:01:44] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:01:44] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:01:44] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 5 ms to minimize.
[2024-06-02 21:01:44] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 13/35 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/35 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 490/679 variables, 189/224 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-02 21:01:53] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 5 ms to minimize.
[2024-06-02 21:01:53] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-02 21:01:54] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
[2024-06-02 21:01:54] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 3 ms to minimize.
[2024-06-02 21:01:54] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:01:55] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:01:55] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:01:55] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 8/232 constraints. Problems are: Problem set: 120 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/679 variables, and 232 constraints, problems are : Problem set: 120 solved, 369 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 120 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 21/43 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/43 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 490/679 variables, 189/232 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 369/601 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-02 21:02:19] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 1/602 constraints. Problems are: Problem set: 120 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 602 constraints, problems are : Problem set: 120 solved, 369 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 369/489 constraints, Known Traps: 22/22 constraints]
After SMT, in 62090ms problems are : Problem set: 120 solved, 369 unsolved
Search for dead transitions found 120 dead transitions in 62156ms
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 : 189/269 places, 370/583 transitions.
Applied a total of 0 rules in 17 ms. Remains 189 /189 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63856 ms. Remains : 189/269 places, 370/583 transitions.
Support contains 40 out of 189 places after structural reductions.
[2024-06-02 21:02:33] [INFO ] Flatten gal took : 129 ms
[2024-06-02 21:02:33] [INFO ] Flatten gal took : 43 ms
[2024-06-02 21:02:34] [INFO ] Input system was already deterministic with 370 transitions.
RANDOM walk for 40000 steps (22 resets) in 2687 ms. (14 steps per ms) remains 22/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (11 resets) in 47 ms. (83 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (14 resets) in 22 ms. (173 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
// Phase 1: matrix 370 rows 189 cols
[2024-06-02 21:02:35] [INFO ] Computed 22 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 60/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 3 (OVERLAPS) 77/169 variables, 14/20 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 360/529 variables, 169/189 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 19/548 variables, 13/202 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/549 variables, 2/204 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 9/558 variables, 5/210 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-02 21:02:37] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/559 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/559 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 212 constraints, problems are : Problem set: 3 solved, 17 unsolved in 2261 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 17 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/88 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 78/166 variables, 13/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/20 constraints. Problems are: Problem set: 4 solved, 16 unsolved
[2024-06-02 21:02:37] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/22 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 3/169 variables, 1/23 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 360/529 variables, 169/192 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 7/199 constraints. Problems are: Problem set: 4 solved, 16 unsolved
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 2/201 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/201 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 19/548 variables, 13/214 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 9/223 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 0/223 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 1/549 variables, 2/225 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/226 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 9/558 variables, 5/231 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/558 variables, 0/231 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 1/559 variables, 1/232 constraints. Problems are: Problem set: 4 solved, 16 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 Int declared 559/559 variables, and 232 constraints, problems are : Problem set: 4 solved, 16 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 16/20 constraints, Known Traps: 5/5 constraints]
After SMT, in 7360ms problems are : Problem set: 4 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 187 transition count 345
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 164 transition count 343
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 163 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 162 transition count 342
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 52 place count 162 transition count 332
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 72 place count 152 transition count 332
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 77 place count 147 transition count 324
Iterating global reduction 4 with 5 rules applied. Total rules applied 82 place count 147 transition count 324
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 45 rules applied. Total rules applied 127 place count 124 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 124 transition count 301
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 138 place count 119 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 160 place count 119 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 119 transition count 306
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 164 place count 117 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 166 place count 116 transition count 316
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 172 place count 116 transition count 310
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 178 place count 110 transition count 310
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 189 place count 110 transition count 357
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 210 place count 99 transition count 347
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 222 place count 99 transition count 347
Applied a total of 222 rules in 250 ms. Remains 99 /189 variables (removed 90) and now considering 347/370 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 99/189 places, 347/370 transitions.
RANDOM walk for 40000 steps (178 resets) in 792 ms. (50 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40003 steps (36 resets) in 606 ms. (65 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40002 steps (163 resets) in 286 ms. (139 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40001 steps (87 resets) in 222 ms. (179 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (45 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (95 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (96 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (67 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
// Phase 1: matrix 347 rows 99 cols
[2024-06-02 21:02:43] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:02:43] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 30/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 31/83 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 339/422 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 23/445 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/446 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/446 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 128 constraints, problems are : Problem set: 0 solved, 7 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 99/99 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 30/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:02:44] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 31/83 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 339/422 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 23/445 variables, 15/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/446 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/446 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/446 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/446 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 136 constraints, problems are : Problem set: 0 solved, 7 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 99/99 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 3855 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 347/347 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 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 344
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 96 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 96 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 95 transition count 343
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 93 transition count 341
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 93 transition count 341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 93 transition count 340
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 92 transition count 340
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 33 place count 82 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 82 transition count 330
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 82 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 42 place count 78 transition count 326
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 48 place count 78 transition count 504
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 87 place count 72 transition count 471
Applied a total of 87 rules in 83 ms. Remains 72 /99 variables (removed 27) and now considering 471/347 (removed -124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 72/99 places, 471/347 transitions.
RANDOM walk for 40000 steps (5020 resets) in 355 ms. (112 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (808 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
// Phase 1: matrix 471 rows 72 cols
[2024-06-02 21:02:49] [INFO ] Computed 20 invariants in 7 ms
[2024-06-02 21:02:49] [INFO ] State equation strengthened by 170 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/84 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 416/500 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 130/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/519 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/529 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/531 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/543 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/543 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/84 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 416/500 variables, 34/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 130/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/519 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/529 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/531 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/543 variables, 22/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 471/471 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 470
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 67 transition count 467
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 67 transition count 489
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 23 place count 66 transition count 477
Applied a total of 23 rules in 66 ms. Remains 66 /72 variables (removed 6) and now considering 477/471 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 66/72 places, 477/471 transitions.
RANDOM walk for 29587 steps (5003 resets) in 693 ms. (42 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U p1))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 9 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-02 21:02:51] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:02:51] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-02 21:02:51] [INFO ] Invariant cache hit.
[2024-06-02 21:02:52] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-02 21:02:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 4 ms to minimize.
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 17 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:03:00] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:03:00] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:03:00] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:03:00] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:03:08] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 3 ms to minimize.
[2024-06-02 21:03:09] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-06-02 21:03:09] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2024-06-02 21:03:09] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:03:10] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-06-02 21:03:10] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:03:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:03:11] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:03:49] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 4 ms to minimize.
[2024-06-02 21:03:49] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60673ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61649 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 487 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 465 ms.
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-00 finished in 62720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 12 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:03:53] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:03:53] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-02 21:03:53] [INFO ] Invariant cache hit.
[2024-06-02 21:03:54] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 21:03:54] [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:04:00] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 11 ms to minimize.
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 7 ms to minimize.
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:04:02] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:04:02] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:04:06] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/551 variables, 185/219 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:04:17] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 4 ms to minimize.
[2024-06-02 21:04:17] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-06-02 21:04:17] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 3 ms to minimize.
[2024-06-02 21:04:17] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:04:18] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:04:18] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:04:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 226 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 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: 19/19 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, 19/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/591 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:04:36] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:04:39] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/593 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 Int declared 551/551 variables, and 593 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 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: 21/21 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61061 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 248 ms.
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-01 finished in 61492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 186 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 67 place count 156 transition count 331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 153 transition count 331
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 153 transition count 320
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 134 transition count 309
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 134 transition count 308
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 110 place count 133 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 173 place count 100 transition count 278
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 183 place count 95 transition count 307
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 203 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Applied a total of 205 rules in 102 ms. Remains 94 /189 variables (removed 95) and now considering 297/370 (removed 73) transitions.
[2024-06-02 21:04:55] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
// Phase 1: matrix 296 rows 94 cols
[2024-06-02 21:04:55] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:04:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 21:04:55] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-02 21:04:55] [INFO ] Invariant cache hit.
[2024-06-02 21:04:55] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 21:04:55] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-06-02 21:04:55] [INFO ] Redundant transitions in 113 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:04:55] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-02 21:04:55] [INFO ] Invariant cache hit.
[2024-06-02 21:04:55] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 216 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23913 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 288/502 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 504 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 54669ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54675ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55368 ms. Remains : 94/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-02
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-02 finished in 55455 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||X(p1))))&&F(p0)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 5 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:05:50] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:05:50] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-02 21:05:50] [INFO ] Invariant cache hit.
[2024-06-02 21:05:51] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 21:05:51] [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:05:56] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:05:56] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:05:56] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:05:56] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:05:56] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:05:57] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:05:57] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:05:57] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:05:57] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
[2024-06-02 21:05:57] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 3 ms to minimize.
[2024-06-02 21:05:58] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:05:58] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:05:58] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-06-02 21:05:59] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:05:59] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/222 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:06:06] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 3 ms to minimize.
[2024-06-02 21:06:06] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-02 21:06:06] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-06-02 21:06:07] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 230 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30014 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: 23/23 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, 23/45 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/230 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:06:37] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:06:49] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 597 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 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]
After SMT, in 60470ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61072 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-03
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-03 finished in 61325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 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 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 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 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
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 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
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 182 place count 96 transition count 307
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 202 place count 96 transition count 287
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 204 place count 95 transition count 297
Applied a total of 204 rules in 82 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-02 21:06:52] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:06:52] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-02 21:06:52] [INFO ] Invariant cache hit.
[2024-06-02 21:06:52] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:06:52] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-06-02 21:06:52] [INFO ] Redundant transitions in 76 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:06:52] [INFO ] Invariant cache hit.
[2024-06-02 21:06:52] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23319 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 54002ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54007ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54709 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-04 finished in 54799 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)))) U (p2 U p3)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 186 transition count 339
Reduce places removed 28 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 34 rules applied. Total rules applied 63 place count 158 transition count 333
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 67 place count 155 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 154 transition count 332
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 68 place count 154 transition count 320
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 99 place count 135 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 135 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 106 place count 135 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 134 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 173 place count 100 transition count 278
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 4 with 10 rules applied. Total rules applied 183 place count 95 transition count 307
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 203 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 94 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 93 transition count 296
Applied a total of 207 rules in 86 ms. Remains 93 /189 variables (removed 96) and now considering 296/370 (removed 74) transitions.
[2024-06-02 21:07:46] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 93 cols
[2024-06-02 21:07:46] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:07:47] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 21:07:47] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-02 21:07:47] [INFO ] Invariant cache hit.
[2024-06-02 21:07:47] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:07:47] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-06-02 21:07:47] [INFO ] Redundant transitions in 71 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:07:47] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-02 21:07:47] [INFO ] Invariant cache hit.
[2024-06-02 21:07:47] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-02 21:07:51] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:07:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 294/387 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 135/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 250 constraints, problems are : Problem set: 0 solved, 288 unsolved in 17080 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 294/387 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 135/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 288/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/388 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 538 constraints, problems are : Problem set: 0 solved, 288 unsolved in 29455 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints]
After SMT, in 47068ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 47074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 296/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47818 ms. Remains : 93/189 places, 296/370 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p3), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-05
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-05 finished in 48065 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((G(F(p0)) U p1)))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 186 transition count 338
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 33 rules applied. Total rules applied 63 place count 157 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 155 transition count 334
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 65 place count 155 transition count 322
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 89 place count 143 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 97 place count 135 transition count 311
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 135 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 135 transition count 310
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 107 place count 134 transition count 310
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 163 place count 105 transition count 283
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 173 place count 100 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 194 place count 100 transition count 291
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 100 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 99 transition count 290
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 5 with 2 rules applied. Total rules applied 198 place count 98 transition count 300
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 98 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 97 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 97 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 96 transition count 298
Applied a total of 203 rules in 77 ms. Remains 96 /189 variables (removed 93) and now considering 298/370 (removed 72) transitions.
[2024-06-02 21:08:34] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
// Phase 1: matrix 297 rows 96 cols
[2024-06-02 21:08:34] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:08:35] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 21:08:35] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-02 21:08:35] [INFO ] Invariant cache hit.
[2024-06-02 21:08:35] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 21:08:35] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-02 21:08:35] [INFO ] Redundant transitions in 69 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 21:08:35] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-02 21:08:35] [INFO ] Invariant cache hit.
[2024-06-02 21:08:35] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 296/392 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 96/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 213 constraints, problems are : Problem set: 0 solved, 290 unsolved in 23113 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 296/392 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 96/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 290/502 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 503 constraints, problems are : Problem set: 0 solved, 290 unsolved in 26242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 49992ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 49998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 298/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50666 ms. Remains : 96/189 places, 298/370 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-06 finished in 50852 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 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 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 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 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 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
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 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
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 182 place count 96 transition count 307
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 202 place count 96 transition count 287
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 204 place count 95 transition count 297
Applied a total of 204 rules in 45 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-02 21:09:25] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:09:25] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 21:09:25] [INFO ] Invariant cache hit.
[2024-06-02 21:09:26] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:09:26] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-06-02 21:09:26] [INFO ] Redundant transitions in 74 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:09:26] [INFO ] Invariant cache hit.
[2024-06-02 21:09:26] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 21253 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 51836ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 51846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52564 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 2 reset in 215 ms.
Product exploration explored 100000 steps with 6 reset in 603 ms.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 20204 steps (22 resets) in 163 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 297/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 21:10:19] [INFO ] Invariant cache hit.
[2024-06-02 21:10:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:10:19] [INFO ] Invariant cache hit.
[2024-06-02 21:10:19] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:10:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 21:10:20] [INFO ] Redundant transitions in 55 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:10:20] [INFO ] Invariant cache hit.
[2024-06-02 21:10:20] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23857 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 54449ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54876 ms. Remains : 95/95 places, 297/297 transitions.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 10691 steps (75 resets) in 22 ms. (464 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 21:11:15] [INFO ] Invariant cache hit.
[2024-06-02 21:11:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:11:15] [INFO ] Invariant cache hit.
[2024-06-02 21:11:15] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:11:15] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-06-02 21:11:15] [INFO ] Redundant transitions in 76 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 21:11:15] [INFO ] Invariant cache hit.
[2024-06-02 21:11:15] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23470 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 54076ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54081ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54554 ms. Remains : 95/95 places, 297/297 transitions.
Treatment of property MedleyA-PT-19-LTLFireability-07 finished in 164059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||F(p1)))&&G(p2))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 4 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-02 21:12:09] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:12:10] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-02 21:12:10] [INFO ] Invariant cache hit.
[2024-06-02 21:12:10] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-02 21:12:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:12:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:12:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
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.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)timeout

(s134 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60647ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61262 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 2 reset in 372 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
RANDOM walk for 40000 steps (19 resets) in 82 ms. (481 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2024-06-02 21:13:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/155 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/516 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/536 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/537 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/548 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/549 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/549 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/155 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/516 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:13:12] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/536 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/537 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/548 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/549 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 365/365 transitions.
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 33 place count 182 transition count 331
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 70 place count 151 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 148 transition count 325
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 73 place count 148 transition count 314
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 95 place count 137 transition count 314
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 134 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 134 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 163 place count 102 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 102 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 4 with 10 rules applied. Total rules applied 174 place count 97 transition count 306
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 194 place count 97 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 4 with 2 rules applied. Total rules applied 196 place count 96 transition count 296
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 96 transition count 290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 208 place count 90 transition count 290
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 226 place count 90 transition count 494
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 298 place count 72 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 72 transition count 440
Applied a total of 300 rules in 78 ms. Remains 72 /184 variables (removed 112) and now considering 440/365 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 72/184 places, 440/365 transitions.
RANDOM walk for 40000 steps (17 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (25 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 444364 steps, run visited all 1 properties in 1558 ms. (steps per millisecond=285 )
Probabilistic random walk after 444364 steps, saw 70095 distinct states, run finished after 1570 ms. (steps per millisecond=283 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-08 finished in 65626 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(F(p0))||(F(p0)&&F(p1)))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 5 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
[2024-06-02 21:13:15] [INFO ] Invariant cache hit.
[2024-06-02 21:13:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 21:13:15] [INFO ] Invariant cache hit.
[2024-06-02 21:13:15] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-02 21:13:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:13:24] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:13:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 4 ms to minimize.
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 3 ms to minimize.
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 3 ms to minimize.
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:13:33] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:13:33] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:13:33] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 21:14:09] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:14:09] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
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 Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60678ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61127 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-09
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-09 finished in 61517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 6 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:14:16] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:14:17] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-02 21:14:17] [INFO ] Invariant cache hit.
[2024-06-02 21:14:17] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 21:14:17] [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:14:22] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-06-02 21:14:22] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:14:22] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-06-02 21:14:22] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:14:23] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 4 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:14:32] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:14:32] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:14:32] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:14:33] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
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.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)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 227 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 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: 20/20 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, 20/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/592 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 21:15:00] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:15:01] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/594 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 Int declared 551/551 variables, and 594 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30014 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: 22/22 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61323 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-11 finished in 61546 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 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 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 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
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 114 place count 131 transition count 306
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 181 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 3 with 10 rules applied. Total rules applied 191 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 3 with 20 rules applied. Total rules applied 211 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 3 with 2 rules applied. Total rules applied 213 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 89 transition count 292
Applied a total of 214 rules in 35 ms. Remains 89 /189 variables (removed 100) and now considering 292/370 (removed 78) transitions.
[2024-06-02 21:15:18] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2024-06-02 21:15:18] [INFO ] Computed 19 invariants in 6 ms
[2024-06-02 21:15:18] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:15:18] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:15:18] [INFO ] Invariant cache hit.
[2024-06-02 21:15:18] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:15:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 21:15:18] [INFO ] Redundant transitions in 44 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 21:15:18] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:15:18] [INFO ] Invariant cache hit.
[2024-06-02 21:15:18] [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 21143 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 26916 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 48365ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 48369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/189 places, 292/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48768 ms. Remains : 89/189 places, 292/370 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 5 reset in 177 ms.
Product exploration explored 100000 steps with 4 reset in 199 ms.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 576 steps (57 resets) in 5 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 292/292 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-06-02 21:16:08] [INFO ] Redundant transitions in 52 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [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 19764 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 29462 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 49705ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 49710ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50181 ms. Remains : 89/89 places, 292/292 transitions.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 544 steps (56 resets) in 6 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 81 ms.
Product exploration explored 100000 steps with 2 reset in 118 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 292/292 transitions.
Applied a total of 0 rules in 9 ms. Remains 89 /89 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-06-02 21:16:58] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:58] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:16:59] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-06-02 21:16:59] [INFO ] Redundant transitions in 44 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:16:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [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 22167 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 28733 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 51257ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 51262ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51793 ms. Remains : 89/89 places, 292/292 transitions.
Treatment of property MedleyA-PT-19-LTLFireability-15 finished in 152320 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)))'
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)))'
[2024-06-02 21:17:51] [INFO ] Flatten gal took : 56 ms
[2024-06-02 21:17:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 21:17:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 370 transitions and 1767 arcs took 26 ms.
Total runtime 983079 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-19-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-19-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717363074123

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-19-LTLFireability-07
ltl formula formula --ltl=/tmp/1753/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 189 places, 370 transitions and 1767 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1753/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1753/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1753/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1753/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 410 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~35!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 164
pnml2lts-mc( 0/ 4): unique states count: 320
pnml2lts-mc( 0/ 4): unique transitions count: 2795
pnml2lts-mc( 0/ 4): - self-loop count: 19
pnml2lts-mc( 0/ 4): - claim dead count: 968
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 329
pnml2lts-mc( 0/ 4): - cum. max stack depth: 180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 329 states 2856 transitions, fanout: 8.681
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.000 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10967, Transitions per second: 95200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.5 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 373 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-19-LTLFireability-15
ltl formula formula --ltl=/tmp/1753/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 189 places, 370 transitions and 1767 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1753/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1753/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1753/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1753/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 376 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~169 levels ~10000 states ~30632 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~20000 states ~68276 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~40000 states ~150376 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~80000 states ~339224 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~71!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 49836
pnml2lts-mc( 0/ 4): unique states count: 92117
pnml2lts-mc( 0/ 4): unique transitions count: 412955
pnml2lts-mc( 0/ 4): - self-loop count: 70
pnml2lts-mc( 0/ 4): - claim dead count: 283440
pnml2lts-mc( 0/ 4): - claim found count: 36508
pnml2lts-mc( 0/ 4): - claim success count: 92126
pnml2lts-mc( 0/ 4): - cum. max stack depth: 550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92126 states 412977 transitions, fanout: 4.483
pnml2lts-mc( 0/ 4): Total exploration time 1.410 sec (1.410 sec minimum, 1.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65338, Transitions per second: 292892
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 9.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 373 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
export BK_EXAMINATION="LTLFireability"
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 LTLFireability"
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-171734921300148"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;