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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717375913766

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 00:51:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 00:51:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:51:56] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-06-03 00:51:56] [INFO ] Transformed 248 places.
[2024-06-03 00:51:56] [INFO ] Transformed 591 transitions.
[2024-06-03 00:51:56] [INFO ] Found NUPN structural information;
[2024-06-03 00:51:56] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 199 transition count 509
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 199 transition count 509
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 132 place count 199 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 197 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 197 transition count 471
Applied a total of 136 rules in 140 ms. Remains 197 /248 variables (removed 51) and now considering 471/589 (removed 118) transitions.
// Phase 1: matrix 471 rows 197 cols
[2024-06-03 00:51:57] [INFO ] Computed 7 invariants in 45 ms
[2024-06-03 00:51:58] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-03 00:51:58] [INFO ] Invariant cache hit.
[2024-06-03 00:51:58] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-03 00:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:07] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 40 ms to minimize.
[2024-06-03 00:52:07] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 4 ms to minimize.
[2024-06-03 00:52:07] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 4 ms to minimize.
[2024-06-03 00:52:08] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 4 ms to minimize.
[2024-06-03 00:52:08] [INFO ] Deduced a trap composed of 114 places in 240 ms of which 4 ms to minimize.
[2024-06-03 00:52:08] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 4 ms to minimize.
[2024-06-03 00:52:08] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:52:08] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-06-03 00:52:09] [INFO ] Deduced a trap composed of 114 places in 195 ms of which 3 ms to minimize.
[2024-06-03 00:52:09] [INFO ] Deduced a trap composed of 115 places in 241 ms of which 4 ms to minimize.
[2024-06-03 00:52:09] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:52:09] [INFO ] Deduced a trap composed of 88 places in 239 ms of which 4 ms to minimize.
[2024-06-03 00:52:10] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 3 ms to minimize.
[2024-06-03 00:52:10] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-03 00:52:11] [INFO ] Deduced a trap composed of 122 places in 314 ms of which 4 ms to minimize.
[2024-06-03 00:52:12] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 3 ms to minimize.
[2024-06-03 00:52:12] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 3 ms to minimize.
[2024-06-03 00:52:12] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-03 00:52:13] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
[2024-06-03 00:52:13] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:14] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 4 ms to minimize.
[2024-06-03 00:52:14] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 4 ms to minimize.
[2024-06-03 00:52:14] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:52:14] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 4 ms to minimize.
[2024-06-03 00:52:15] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:52:15] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:52:17] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 4 ms to minimize.
[2024-06-03 00:52:17] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 3 ms to minimize.
[2024-06-03 00:52:17] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:52:18] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:52:18] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 3 ms to minimize.
[2024-06-03 00:52:18] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 3 ms to minimize.
[2024-06-03 00:52:19] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 4 ms to minimize.
[2024-06-03 00:52:19] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 6 ms to minimize.
[2024-06-03 00:52:19] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 3 ms to minimize.
[2024-06-03 00:52:20] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 4 ms to minimize.
[2024-06-03 00:52:20] [INFO ] Deduced a trap composed of 117 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:52:20] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 4 ms to minimize.
[2024-06-03 00:52:21] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:25] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:52:26] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 4 ms to minimize.
[2024-06-03 00:52:26] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 4 ms to minimize.
[2024-06-03 00:52:26] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-03 00:52:27] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 4 ms to minimize.
[2024-06-03 00:52:27] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 8 ms to minimize.
[2024-06-03 00:52:28] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 4 ms to minimize.
[2024-06-03 00:52:29] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 3 ms to minimize.
[2024-06-03 00:52:29] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/668 variables, and 56 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:35] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 4 ms to minimize.
[2024-06-03 00:52:37] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:38] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 2 ms to minimize.
[2024-06-03 00:52:39] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-06-03 00:52:40] [INFO ] Deduced a trap composed of 124 places in 298 ms of which 3 ms to minimize.
[2024-06-03 00:52:41] [INFO ] Deduced a trap composed of 118 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:52:41] [INFO ] Deduced a trap composed of 130 places in 229 ms of which 3 ms to minimize.
[2024-06-03 00:52:41] [INFO ] Deduced a trap composed of 123 places in 288 ms of which 4 ms to minimize.
[2024-06-03 00:52:41] [INFO ] Deduced a trap composed of 48 places in 283 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:44] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:52:46] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 4 ms to minimize.
[2024-06-03 00:52:46] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 3 ms to minimize.
[2024-06-03 00:52:46] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-06-03 00:52:47] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 3 ms to minimize.
[2024-06-03 00:52:47] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:52] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-03 00:52:55] [INFO ] Deduced a trap composed of 112 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:52:56] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/668 variables, and 74 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 67/67 constraints]
After SMT, in 61076ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Starting structural reductions in LTL mode, iteration 1 : 197/248 places, 471/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62594 ms. Remains : 197/248 places, 471/589 transitions.
Support contains 43 out of 197 places after structural reductions.
[2024-06-03 00:53:00] [INFO ] Flatten gal took : 132 ms
[2024-06-03 00:53:00] [INFO ] Flatten gal took : 62 ms
[2024-06-03 00:53:00] [INFO ] Input system was already deterministic with 471 transitions.
Support contains 39 out of 197 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (1376 resets) in 3368 ms. (11 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 345238 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :10 out of 23
Probabilistic random walk after 345238 steps, saw 63239 distinct states, run finished after 3018 ms. (steps per millisecond=114 ) properties seen :10
[2024-06-03 00:53:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-03 00:53:05] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:53:05] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
[2024-06-03 00:53:05] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-06-03 00:53:05] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-03 00:53:06] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:53:06] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-06-03 00:53:06] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2024-06-03 00:53:06] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 4 ms to minimize.
[2024-06-03 00:53:06] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 471/668 variables, 197/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 213 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 471/668 variables, 197/213 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 10/223 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-03 00:53:09] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 1/224 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-03 00:53:12] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 225 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 11/11 constraints]
After SMT, in 7815ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 144 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 193 transition count 440
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 168 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 166 transition count 438
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 166 transition count 423
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 151 transition count 423
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 147 transition count 415
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 147 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 146 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 146 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 137 place count 125 transition count 378
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
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 147 place count 120 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 158 place count 120 transition count 379
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 116 transition count 375
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 178 place count 110 transition count 415
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 205 place count 110 transition count 388
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 252 place count 83 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 257 place count 83 transition count 363
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 83 transition count 370
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 275 place count 78 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 77 transition count 361
Applied a total of 276 rules in 320 ms. Remains 77 /197 variables (removed 120) and now considering 361/471 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 77/197 places, 361/471 transitions.
RANDOM walk for 40000 steps (6414 resets) in 745 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1841 resets) in 308 ms. (129 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (1965 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (15 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2034 resets) in 371 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2061 resets) in 395 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1991 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
[2024-06-03 00:53:14] [INFO ] Flow matrix only has 318 transitions (discarded 43 similar events)
// Phase 1: matrix 318 rows 77 cols
[2024-06-03 00:53:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:53:14] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 58/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:53:14] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 318/395 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 37/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 122 constraints, problems are : Problem set: 0 solved, 8 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 58/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:53:15] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:53:15] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:53:15] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 318/395 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:53:16] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:53:17] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/395 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 135 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 3704ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 30072 ms.
Support contains 19 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 361/361 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 77 transition count 360
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 76 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 4 place count 75 transition count 374
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 75 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 73 transition count 372
Applied a total of 8 rules in 32 ms. Remains 73 /77 variables (removed 4) and now considering 372/361 (removed -11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 73/77 places, 372/361 transitions.
RANDOM walk for 40000 steps (6579 resets) in 1221 ms. (32 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2278 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2117 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (13 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2134 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
[2024-06-03 00:53:48] [INFO ] Flow matrix only has 324 transitions (discarded 48 similar events)
// Phase 1: matrix 324 rows 73 cols
[2024-06-03 00:53:48] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:53:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 61/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:53:48] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 324/397 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 42/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/397 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 123 constraints, problems are : Problem set: 0 solved, 5 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 61/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 324/397 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 42/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:53:49] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2024-06-03 00:53:49] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2024-06-03 00:53:49] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 131 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1604ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 2612 ms.
Support contains 8 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 372/372 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 71 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 71 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 70 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 364
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 67 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 67 transition count 359
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 67 transition count 352
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 42 place count 60 transition count 341
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 60 transition count 355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 59 transition count 355
Applied a total of 44 rules in 58 ms. Remains 59 /73 variables (removed 14) and now considering 355/372 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 59/73 places, 355/372 transitions.
RANDOM walk for 40000 steps (12 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (18 resets) in 406 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (24 resets) in 908 ms. (44 steps per ms) remains 2/3 properties
[2024-06-03 00:53:53] [INFO ] Flow matrix only has 281 transitions (discarded 74 similar events)
// Phase 1: matrix 281 rows 59 cols
[2024-06-03 00:53:53] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:53:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/272 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 67/339 variables, 25/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 28/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 108 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/272 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 67/339 variables, 25/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 28/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:53:53] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/340 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/340 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 866ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 355/355 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 354
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 56 transition count 352
Applied a total of 6 rules in 33 ms. Remains 56 /59 variables (removed 3) and now considering 352/355 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 56/59 places, 352/355 transitions.
RANDOM walk for 40000 steps (14 resets) in 418 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7837 steps, run visited all 2 properties in 52 ms. (steps per millisecond=150 )
Probabilistic random walk after 7837 steps, saw 1624 distinct states, run finished after 61 ms. (steps per millisecond=128 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 439
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 165 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 163 transition count 437
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 163 transition count 422
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 140 transition count 407
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 140 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 139 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 139 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 149 place count 116 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 115 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 115 transition count 356
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 197 place count 92 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 201 place count 92 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 90 transition count 424
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 90 transition count 424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 213 place count 90 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 89 transition count 431
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 237 place count 89 transition count 409
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 245 place count 85 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 84 transition count 404
Applied a total of 246 rules in 114 ms. Remains 84 /197 variables (removed 113) and now considering 404/471 (removed 67) transitions.
[2024-06-03 00:53:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
// Phase 1: matrix 372 rows 84 cols
[2024-06-03 00:53:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:53:55] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-03 00:53:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-03 00:53:55] [INFO ] Invariant cache hit.
[2024-06-03 00:53:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-03 00:53:55] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-06-03 00:53:55] [INFO ] Redundant transitions in 59 ms returned []
Running 395 sub problems to find dead transitions.
[2024-06-03 00:53:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-03 00:53:55] [INFO ] Invariant cache hit.
[2024-06-03 00:53:55] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-03 00:53:58] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2024-06-03 00:53:58] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 2 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:53:59] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:54:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:54:00] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:54:00] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-03 00:54:02] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 371/455 variables, 84/105 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 181 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 3 (OVERLAPS) 371/455 variables, 84/105 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 75/180 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 353/533 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/533 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/534 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/534 constraints. Problems are: Problem set: 42 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 534 constraints, problems are : Problem set: 42 solved, 353 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 353/395 constraints, Known Traps: 14/14 constraints]
After SMT, in 60831ms problems are : Problem set: 42 solved, 353 unsolved
Search for dead transitions found 42 dead transitions in 60841ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/197 places, 362/471 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 396
Applied a total of 6 rules in 22 ms. Remains 81 /84 variables (removed 3) and now considering 396/362 (removed -34) transitions.
[2024-06-03 00:54:56] [INFO ] Flow matrix only has 354 transitions (discarded 42 similar events)
// Phase 1: matrix 354 rows 81 cols
[2024-06-03 00:54:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:54:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-03 00:54:56] [INFO ] Flow matrix only has 354 transitions (discarded 42 similar events)
[2024-06-03 00:54:56] [INFO ] Invariant cache hit.
[2024-06-03 00:54:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-03 00:54:57] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/197 places, 396/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62069 ms. Remains : 81/197 places, 396/471 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-03 finished in 62436 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)||F(G((X(p1) U p2)))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 10 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-03 00:54:57] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:54:57] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-03 00:54:57] [INFO ] Invariant cache hit.
[2024-06-03 00:54:58] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 00:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:05] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 3 ms to minimize.
[2024-06-03 00:55:05] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-03 00:55:05] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 2 ms to minimize.
[2024-06-03 00:55:06] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 2 ms to minimize.
[2024-06-03 00:55:06] [INFO ] Deduced a trap composed of 112 places in 295 ms of which 3 ms to minimize.
[2024-06-03 00:55:06] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 3 ms to minimize.
[2024-06-03 00:55:07] [INFO ] Deduced a trap composed of 111 places in 315 ms of which 4 ms to minimize.
[2024-06-03 00:55:07] [INFO ] Deduced a trap composed of 112 places in 301 ms of which 3 ms to minimize.
[2024-06-03 00:55:07] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 3 ms to minimize.
[2024-06-03 00:55:07] [INFO ] Deduced a trap composed of 111 places in 224 ms of which 3 ms to minimize.
[2024-06-03 00:55:08] [INFO ] Deduced a trap composed of 111 places in 224 ms of which 3 ms to minimize.
[2024-06-03 00:55:08] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-06-03 00:55:08] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:55:09] [INFO ] Deduced a trap composed of 113 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:55:09] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 4 ms to minimize.
[2024-06-03 00:55:10] [INFO ] Deduced a trap composed of 39 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:55:10] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-03 00:55:11] [INFO ] Deduced a trap composed of 25 places in 314 ms of which 4 ms to minimize.
[2024-06-03 00:55:11] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 3 ms to minimize.
[2024-06-03 00:55:11] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:13] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-03 00:55:13] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 3 ms to minimize.
[2024-06-03 00:55:14] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 4 ms to minimize.
[2024-06-03 00:55:14] [INFO ] Deduced a trap composed of 115 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:55:15] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 4 ms to minimize.
[2024-06-03 00:55:15] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 3 ms to minimize.
[2024-06-03 00:55:15] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-03 00:55:16] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-03 00:55:16] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-03 00:55:16] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 2 ms to minimize.
[2024-06-03 00:55:17] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2024-06-03 00:55:18] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 4 ms to minimize.
[2024-06-03 00:55:18] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:23] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 4 ms to minimize.
[2024-06-03 00:55:24] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-03 00:55:24] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 3 ms to minimize.
[2024-06-03 00:55:24] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 3 ms to minimize.
[2024-06-03 00:55:25] [INFO ] Deduced a trap composed of 114 places in 260 ms of which 3 ms to minimize.
[2024-06-03 00:55:25] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:55:25] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:55:27] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 48 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:32] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 3 ms to minimize.
[2024-06-03 00:55:34] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:38] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:55:39] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 4 ms to minimize.
[2024-06-03 00:55:39] [INFO ] Deduced a trap composed of 112 places in 299 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:43] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:55:48] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:55:48] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/648 variables, 190/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 49/49 constraints]
After SMT, in 60384ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60394ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/471 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61141 ms. Remains : 190/197 places, 408/471 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-05 finished in 61350 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' '!(((!p0 U (p1||G(!p0))) U (F(p2) U p3)))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 175 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 439
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 439
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 165 transition count 422
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 148 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 142 transition count 411
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 142 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 141 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 141 transition count 395
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 149 place count 118 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 117 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 117 transition count 359
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -53
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 176 place count 105 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 105 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 180 place count 104 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 197 place count 104 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 100 transition count 404
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 209 place count 98 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 97 transition count 412
Applied a total of 210 rules in 124 ms. Remains 97 /197 variables (removed 100) and now considering 412/471 (removed 59) transitions.
[2024-06-03 00:55:59] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
// Phase 1: matrix 397 rows 97 cols
[2024-06-03 00:55:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:55:59] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-03 00:55:59] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-03 00:55:59] [INFO ] Invariant cache hit.
[2024-06-03 00:55:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-03 00:55:59] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-06-03 00:55:59] [INFO ] Redundant transitions in 12 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-03 00:55:59] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-03 00:55:59] [INFO ] Invariant cache hit.
[2024-06-03 00:55:59] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 2 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 2 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 2 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:56:04] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:56:04] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-06-03 00:56:04] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-03 00:56:05] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-03 00:56:07] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 2 ms to minimize.
[2024-06-03 00:56:07] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 396/493 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 1/494 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 133 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 3 (OVERLAPS) 396/493 variables, 97/119 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 13/132 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 361/493 constraints. Problems are: Problem set: 42 solved, 361 unsolved
[2024-06-03 00:56:43] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 1/494 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/494 constraints. Problems are: Problem set: 42 solved, 361 unsolved
SMT process timed out in 60634ms, After SMT, problems are : Problem set: 42 solved, 361 unsolved
Search for dead transitions found 42 dead transitions in 60641ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 97/197 places, 370/471 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 393
Applied a total of 4 rules in 13 ms. Remains 95 /97 variables (removed 2) and now considering 393/370 (removed -23) transitions.
[2024-06-03 00:57:00] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
// Phase 1: matrix 371 rows 95 cols
[2024-06-03 00:57:00] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:57:00] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-03 00:57:00] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
[2024-06-03 00:57:00] [INFO ] Invariant cache hit.
[2024-06-03 00:57:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-03 00:57:00] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/197 places, 393/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61922 ms. Remains : 95/197 places, 393/471 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-07 finished in 62208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 189 transition count 456
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 189 transition count 456
Applied a total of 16 rules in 10 ms. Remains 189 /197 variables (removed 8) and now considering 456/471 (removed 15) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-03 00:57:01] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:57:01] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-03 00:57:01] [INFO ] Invariant cache hit.
[2024-06-03 00:57:01] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-06-03 00:57:07] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:57:09] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-06-03 00:57:09] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 2 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-06-03 00:57:10] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:57:11] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-06-03 00:57:11] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-06-03 00:57:14] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:57:14] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 115 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:57:16] [INFO ] Deduced a trap composed of 125 places in 241 ms of which 2 ms to minimize.
[2024-06-03 00:57:16] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-06-03 00:57:16] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:57:20] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:57:20] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 2 ms to minimize.
[2024-06-03 00:57:20] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 3 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 2 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 2 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2024-06-03 00:57:24] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-03 00:57:25] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:57:27] [INFO ] Deduced a trap composed of 112 places in 235 ms of which 4 ms to minimize.
[2024-06-03 00:57:27] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:57:27] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:57:28] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:57:28] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:57:32] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
SMT process timed out in 30539ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30548ms
Starting structural reductions in LTL mode, iteration 1 : 189/197 places, 456/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31310 ms. Remains : 189/197 places, 456/471 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-09 finished in 31424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 191 transition count 459
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 191 transition count 459
Applied a total of 12 rules in 11 ms. Remains 191 /197 variables (removed 6) and now considering 459/471 (removed 12) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-03 00:57:32] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:57:32] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-03 00:57:32] [INFO ] Invariant cache hit.
[2024-06-03 00:57:33] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-03 00:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-03 00:57:39] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:57:39] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-06-03 00:57:39] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 2 ms to minimize.
[2024-06-03 00:57:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:57:40] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-06-03 00:57:40] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 4 ms to minimize.
[2024-06-03 00:57:40] [INFO ] Deduced a trap composed of 112 places in 222 ms of which 3 ms to minimize.
[2024-06-03 00:57:41] [INFO ] Deduced a trap composed of 112 places in 227 ms of which 3 ms to minimize.
[2024-06-03 00:57:41] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2024-06-03 00:57:41] [INFO ] Deduced a trap composed of 112 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:57:41] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 3 ms to minimize.
[2024-06-03 00:57:42] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:57:42] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 3 ms to minimize.
[2024-06-03 00:57:42] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 3 ms to minimize.
[2024-06-03 00:57:44] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 4 ms to minimize.
[2024-06-03 00:57:44] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 4 ms to minimize.
[2024-06-03 00:57:44] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 4 ms to minimize.
[2024-06-03 00:57:45] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 3 ms to minimize.
[2024-06-03 00:57:45] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 3 ms to minimize.
[2024-06-03 00:57:45] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-03 00:57:46] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 4 ms to minimize.
[2024-06-03 00:57:47] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-06-03 00:57:47] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 3 ms to minimize.
[2024-06-03 00:57:48] [INFO ] Deduced a trap composed of 85 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:57:48] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 4 ms to minimize.
[2024-06-03 00:57:48] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 4 ms to minimize.
[2024-06-03 00:57:49] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 5 ms to minimize.
[2024-06-03 00:57:49] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 4 ms to minimize.
[2024-06-03 00:57:49] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-06-03 00:57:50] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
[2024-06-03 00:57:50] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 3 ms to minimize.
[2024-06-03 00:57:50] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-03 00:57:51] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 4 ms to minimize.
[2024-06-03 00:57:51] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 4 ms to minimize.
[2024-06-03 00:57:52] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2024-06-03 00:57:52] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 2 ms to minimize.
[2024-06-03 00:57:53] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:57:53] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:57:53] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 2 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
SMT process timed out in 30468ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 30477ms
Starting structural reductions in LTL mode, iteration 1 : 191/197 places, 459/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31126 ms. Remains : 191/197 places, 459/471 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 3448 reset in 476 ms.
Product exploration explored 100000 steps with 3448 reset in 452 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 150 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1376 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (298 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (296 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (299 resets) in 259 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (301 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (301 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 427014 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :1 out of 5
Probabilistic random walk after 427014 steps, saw 79398 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :1
[2024-06-03 00:58:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:58:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 459/650 variables, 191/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:58:09] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-06-03 00:58:09] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/650 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 201 constraints, problems are : Problem set: 0 solved, 4 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:58:10] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-06-03 00:58:10] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 459/650 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/650 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 207 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 2601ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4255 ms.
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 185 transition count 423
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 158 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 157 transition count 422
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 157 transition count 408
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 143 transition count 408
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 133 place count 119 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 117 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 117 transition count 356
Performed 24 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 185 place count 93 transition count 473
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 203 place count 93 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 91 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 91 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 91 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 91 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 223 place count 87 transition count 427
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 253 place count 87 transition count 397
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 335 place count 57 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 369 place count 57 transition count 311
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 57 transition count 307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 377 place count 53 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 409 place count 53 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 413 place count 51 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 416 place count 51 transition count 302
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 51 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 420 place count 49 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 48 transition count 329
Applied a total of 421 rules in 143 ms. Remains 48 /191 variables (removed 143) and now considering 329/459 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 48/191 places, 329/459 transitions.
RANDOM walk for 40000 steps (1442 resets) in 173 ms. (229 steps per ms) remains 1/4 properties
BEST_FIRST walk for 23812 steps (236 resets) in 55 ms. (425 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 325 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 184 transition count 426
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 158 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 157 transition count 425
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 55 place count 157 transition count 411
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 143 transition count 411
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 131 place count 119 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 117 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 117 transition count 359
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 179 place count 95 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 95 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 93 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 93 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 93 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 91 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 221 place count 91 transition count 422
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 229 place count 87 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 86 transition count 417
Applied a total of 230 rules in 74 ms. Remains 86 /191 variables (removed 105) and now considering 417/459 (removed 42) transitions.
[2024-06-03 00:58:16] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
// Phase 1: matrix 389 rows 86 cols
[2024-06-03 00:58:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:58:16] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 00:58:16] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-03 00:58:16] [INFO ] Invariant cache hit.
[2024-06-03 00:58:16] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-03 00:58:17] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-03 00:58:17] [INFO ] Redundant transitions in 34 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-03 00:58:17] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-03 00:58:17] [INFO ] Invariant cache hit.
[2024-06-03 00:58:17] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 2 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 388/474 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 78/185 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 1/475 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 0/475 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 186 constraints, problems are : Problem set: 0 solved, 408 unsolved in 27023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-03 00:58:45] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (OVERLAPS) 388/474 variables, 86/108 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 78/186 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 366/552 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/552 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 8 (OVERLAPS) 1/475 variables, 1/553 constraints. Problems are: Problem set: 42 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 553 constraints, problems are : Problem set: 42 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 366/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 57458ms problems are : Problem set: 42 solved, 366 unsolved
Search for dead transitions found 42 dead transitions in 57463ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/191 places, 375/459 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 385
Applied a total of 2 rules in 11 ms. Remains 85 /86 variables (removed 1) and now considering 385/375 (removed -10) transitions.
[2024-06-03 00:59:14] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
// Phase 1: matrix 357 rows 85 cols
[2024-06-03 00:59:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:59:14] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-03 00:59:14] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-03 00:59:14] [INFO ] Invariant cache hit.
[2024-06-03 00:59:14] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-03 00:59:15] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/191 places, 385/459 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58516 ms. Remains : 85/191 places, 385/459 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 191 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7428 resets) in 641 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1376 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1359 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1392 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1393 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1363 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 272136 steps, run visited all 5 properties in 2031 ms. (steps per millisecond=133 )
Probabilistic random walk after 272136 steps, saw 61491 distinct states, run finished after 2031 ms. (steps per millisecond=133 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18170 reset in 435 ms.
Product exploration explored 100000 steps with 18197 reset in 526 ms.
Built C files in :
/tmp/ltsmin16008018309136210270
[2024-06-03 00:59:20] [INFO ] Computing symmetric may disable matrix : 385 transitions.
[2024-06-03 00:59:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:59:20] [INFO ] Computing symmetric may enable matrix : 385 transitions.
[2024-06-03 00:59:20] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:59:20] [INFO ] Computing Do-Not-Accords matrix : 385 transitions.
[2024-06-03 00:59:20] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:59:20] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16008018309136210270
Running compilation step : cd /tmp/ltsmin16008018309136210270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2304 ms.
Running link step : cd /tmp/ltsmin16008018309136210270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin16008018309136210270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12765433648229395563.hoa' '--buchi-type=spotba'
LTSmin run took 1369 ms.
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 111492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 6 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-03 00:59:24] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:59:24] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-03 00:59:24] [INFO ] Invariant cache hit.
[2024-06-03 00:59:24] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 00:59:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:59:30] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 2 ms to minimize.
[2024-06-03 00:59:31] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-03 00:59:31] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:59:31] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:59:31] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-06-03 00:59:32] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 3 ms to minimize.
[2024-06-03 00:59:32] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 3 ms to minimize.
[2024-06-03 00:59:33] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 4 ms to minimize.
[2024-06-03 00:59:33] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-03 00:59:33] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 3 ms to minimize.
[2024-06-03 00:59:33] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:59:34] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-03 00:59:34] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2024-06-03 00:59:34] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2024-06-03 00:59:34] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-06-03 00:59:35] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 4 ms to minimize.
[2024-06-03 00:59:35] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:59:35] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 4 ms to minimize.
[2024-06-03 00:59:36] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:59:36] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:59:36] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 3 ms to minimize.
[2024-06-03 00:59:37] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 3 ms to minimize.
[2024-06-03 00:59:37] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:59:37] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:59:37] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:59:38] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:59:38] [INFO ] Deduced a trap composed of 131 places in 234 ms of which 3 ms to minimize.
[2024-06-03 00:59:38] [INFO ] Deduced a trap composed of 118 places in 204 ms of which 2 ms to minimize.
[2024-06-03 00:59:39] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 3 ms to minimize.
[2024-06-03 00:59:40] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 3 ms to minimize.
[2024-06-03 00:59:40] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-06-03 00:59:40] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2024-06-03 00:59:41] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 3 ms to minimize.
[2024-06-03 00:59:41] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2024-06-03 00:59:41] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 3 ms to minimize.
[2024-06-03 00:59:42] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 3 ms to minimize.
[2024-06-03 00:59:42] [INFO ] Deduced a trap composed of 122 places in 226 ms of which 3 ms to minimize.
[2024-06-03 00:59:42] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 3 ms to minimize.
[2024-06-03 00:59:43] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 2 ms to minimize.
[2024-06-03 00:59:43] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:59:45] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:59:46] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:59:46] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 4 ms to minimize.
[2024-06-03 00:59:47] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 3 ms to minimize.
[2024-06-03 00:59:47] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-03 00:59:48] [INFO ] Deduced a trap composed of 112 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:59:48] [INFO ] Deduced a trap composed of 115 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:59:49] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-03 00:59:49] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:59:51] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 2 ms to minimize.
[2024-06-03 00:59:51] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:59:55] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 2 ms to minimize.
SMT process timed out in 30591ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30599ms
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 458/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31365 ms. Remains : 190/197 places, 458/471 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 31601 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((p0||(F(p1)&&X(X(G(p0)))))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 4 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-03 00:59:55] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:59:55] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-03 00:59:55] [INFO ] Invariant cache hit.
[2024-06-03 00:59:56] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 00:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:00:02] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-06-03 01:00:02] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:00:03] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:00:03] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:00:03] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:00:03] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 3 ms to minimize.
[2024-06-03 01:00:04] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 3 ms to minimize.
[2024-06-03 01:00:04] [INFO ] Deduced a trap composed of 112 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:00:04] [INFO ] Deduced a trap composed of 113 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:00:05] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 2 ms to minimize.
[2024-06-03 01:00:05] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 2 ms to minimize.
[2024-06-03 01:00:05] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:00:06] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:00:06] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-06-03 01:00:06] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-03 01:00:06] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:00:06] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-06-03 01:00:07] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 4 ms to minimize.
[2024-06-03 01:00:07] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-06-03 01:00:07] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:00:08] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 2 ms to minimize.
[2024-06-03 01:00:09] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-06-03 01:00:09] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-06-03 01:00:09] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 4 ms to minimize.
[2024-06-03 01:00:10] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-06-03 01:00:10] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2024-06-03 01:00:10] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 2 ms to minimize.
[2024-06-03 01:00:10] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:00:11] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-06-03 01:00:11] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-06-03 01:00:11] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 2 ms to minimize.
[2024-06-03 01:00:11] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:00:12] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:00:13] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 2 ms to minimize.
[2024-06-03 01:00:13] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-06-03 01:00:14] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:00:16] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:00:17] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 2 ms to minimize.
[2024-06-03 01:00:17] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-06-03 01:00:18] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2024-06-03 01:00:18] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-06-03 01:00:18] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:00:18] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:00:18] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-06-03 01:00:19] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
[2024-06-03 01:00:19] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-03 01:00:19] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-06-03 01:00:20] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:00:20] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:00:22] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 57 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:00:30] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-06-03 01:00:31] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:00:32] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/250 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 407/657 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 657 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 53/53 constraints]
After SMT, in 60525ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60531ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61243 ms. Remains : 190/197 places, 408/471 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 3447 reset in 209 ms.
Product exploration explored 100000 steps with 3447 reset in 267 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (301 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (299 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (299 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 1266 ms. (steps per millisecond=129 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 1267 ms. (steps per millisecond=129 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-03 01:01:00] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 01:01:00] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-03 01:01:00] [INFO ] Invariant cache hit.
[2024-06-03 01:01:00] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-03 01:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 01:01:07] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 4 ms to minimize.
[2024-06-03 01:01:07] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:01:07] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 3 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 122 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 112 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:01:09] [INFO ] Deduced a trap composed of 112 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:01:09] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-06-03 01:01:09] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:01:09] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:01:10] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:01:10] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:01:10] [INFO ] Deduced a trap composed of 95 places in 210 ms of which 3 ms to minimize.
[2024-06-03 01:01:10] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 3 ms to minimize.
[2024-06-03 01:01:11] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:01:11] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 3 ms to minimize.
[2024-06-03 01:01:12] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:01:12] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:01:13] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 01:01:14] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:01:15] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:01:15] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:01:15] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:01:16] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:01:16] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:01:16] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:01:16] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-03 01:01:17] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:01:17] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-03 01:01:17] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-03 01:01:17] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 3 ms to minimize.
[2024-06-03 01:01:18] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:01:18] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 2 ms to minimize.
[2024-06-03 01:01:18] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:01:19] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 3 ms to minimize.
[2024-06-03 01:01:19] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:01:19] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:01:19] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:01:20] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 01:01:24] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:01:24] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:01:25] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:01:25] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-06-03 01:01:25] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:01:25] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-06-03 01:01:26] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:01:26] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:01:26] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:01:27] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 4 ms to minimize.
[2024-06-03 01:01:27] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:01:27] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:01:27] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-06-03 01:01:28] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 2 ms to minimize.
[2024-06-03 01:01:28] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:01:28] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:01:29] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 3 ms to minimize.
[2024-06-03 01:01:29] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 3 ms to minimize.
[2024-06-03 01:01:29] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:01:30] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 01:01:30] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 2 ms to minimize.
[2024-06-03 01:01:30] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:01:31] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 3 ms to minimize.
SMT process timed out in 30382ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 30389ms
Finished structural reductions in LTL mode , in 1 iterations and 31151 ms. Remains : 190/190 places, 408/408 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (299 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (296 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (299 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 692 ms. (steps per millisecond=236 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 692 ms. (steps per millisecond=236 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3448 reset in 226 ms.
Product exploration explored 100000 steps with 3446 reset in 196 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 187 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 184 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 28 place count 184 transition count 405
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 184 transition count 405
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 64 place count 184 transition count 409
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 81 place count 167 transition count 380
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 98 place count 167 transition count 380
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 126 place count 167 transition count 575
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 167 transition count 569
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 144 place count 155 transition count 535
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 156 place count 155 transition count 535
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 155 transition count 530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 200 place count 152 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 149 transition count 487
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 149 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 149 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 146 transition count 484
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 146 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 146 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 145 transition count 497
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 218 rules in 138 ms. Remains 145 /190 variables (removed 45) and now considering 497/408 (removed -89) transitions.
[2024-06-03 01:01:34] [INFO ] Redundant transitions in 9 ms returned []
Running 496 sub problems to find dead transitions.
[2024-06-03 01:01:34] [INFO ] Flow matrix only has 463 transitions (discarded 34 similar events)
// Phase 1: matrix 463 rows 145 cols
[2024-06-03 01:01:34] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:01:34] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-06-03 01:01:41] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-03 01:01:41] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-03 01:01:41] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-03 01:01:41] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:01:41] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 2 ms to minimize.
[2024-06-03 01:01:42] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:01:42] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-03 01:01:42] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 2 ms to minimize.
[2024-06-03 01:01:42] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-03 01:01:42] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-06-03 01:01:44] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:01:44] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:01:44] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 2 ms to minimize.
[2024-06-03 01:01:44] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 2 ms to minimize.
[2024-06-03 01:01:44] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-03 01:01:45] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-03 01:01:45] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 2 ms to minimize.
[2024-06-03 01:01:45] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:01:46] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:01:46] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:01:46] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-06-03 01:01:46] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:01:46] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-03 01:01:49] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:01:49] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 10/37 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-03 01:01:52] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:01:52] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/39 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-03 01:01:56] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/40 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-03 01:01:59] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:02:00] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/608 variables, and 42 constraints, problems are : Problem set: 96 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/145 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 96 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 60/145 variables, 7/7 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 35/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-03 01:02:08] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:02:08] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2024-06-03 01:02:08] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:02:09] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 2 ms to minimize.
[2024-06-03 01:02:09] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/47 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/47 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 462/607 variables, 145/192 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 94/286 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 400/686 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 686 constraints, problems are : Problem set: 96 solved, 400 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 400/496 constraints, Known Traps: 40/40 constraints]
After SMT, in 60786ms problems are : Problem set: 96 solved, 400 unsolved
Search for dead transitions found 96 dead transitions in 60794ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 145/190 places, 401/408 transitions.
Graph (complete) has 726 edges and 145 vertex of which 86 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.3 ms
Discarding 59 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 86 /145 variables (removed 59) and now considering 401/401 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/190 places, 401/408 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60970 ms. Remains : 86/190 places, 401/408 transitions.
Built C files in :
/tmp/ltsmin13646362022249091949
[2024-06-03 01:02:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13646362022249091949
Running compilation step : cd /tmp/ltsmin13646362022249091949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1360 ms.
Running link step : cd /tmp/ltsmin13646362022249091949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13646362022249091949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased113577510680874100.hoa' '--buchi-type=spotba'
LTSmin run took 10634 ms.
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 171907 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&&(F(p1)||G(!p2))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 200 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 438
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 422
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 141 transition count 409
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 141 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 140 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 140 transition count 393
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 145 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 117 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 117 transition count 359
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 193 place count 94 transition count 449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 197 place count 94 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 92 transition count 429
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 209 place count 92 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 90 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 228 place count 90 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 236 place count 86 transition count 432
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 86 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 249 place count 86 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 85 transition count 420
Applied a total of 250 rules in 79 ms. Remains 85 /197 variables (removed 112) and now considering 420/471 (removed 51) transitions.
[2024-06-03 01:02:47] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 85 cols
[2024-06-03 01:02:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 01:02:47] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 01:02:47] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-03 01:02:47] [INFO ] Invariant cache hit.
[2024-06-03 01:02:47] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-03 01:02:48] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-03 01:02:48] [INFO ] Redundant transitions in 4 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-03 01:02:48] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-03 01:02:48] [INFO ] Invariant cache hit.
[2024-06-03 01:02:48] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-03 01:02:50] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:02:50] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:02:50] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-03 01:02:50] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-06-03 01:02:51] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/104 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/182 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 1/473 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 0/473 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 183 constraints, problems are : Problem set: 0 solved, 411 unsolved in 25576 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/104 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/182 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 369/551 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/551 constraints. Problems are: Problem set: 42 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 552 constraints, problems are : Problem set: 42 solved, 369 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 369/411 constraints, Known Traps: 12/12 constraints]
After SMT, in 56065ms problems are : Problem set: 42 solved, 369 unsolved
Search for dead transitions found 42 dead transitions in 56070ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 85/197 places, 378/471 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 388
Applied a total of 2 rules in 7 ms. Remains 84 /85 variables (removed 1) and now considering 388/378 (removed -10) transitions.
[2024-06-03 01:03:44] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
// Phase 1: matrix 356 rows 84 cols
[2024-06-03 01:03:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 01:03:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 01:03:44] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:03:44] [INFO ] Invariant cache hit.
[2024-06-03 01:03:44] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-03 01:03:44] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/197 places, 388/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57133 ms. Remains : 84/197 places, 388/471 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14
Product exploration explored 100000 steps with 18284 reset in 357 ms.
Product exploration explored 100000 steps with 18225 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 151 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (7446 resets) in 281 ms. (141 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (1378 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1404 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-06-03 01:03:46] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:03:46] [INFO ] Invariant cache hit.
[2024-06-03 01:03:46] [INFO ] State equation strengthened by 79 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 171 constraints, problems are : Problem set: 1 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 388/388 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 385
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 37 place count 84 transition count 351
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 119 place count 50 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 140 place count 50 transition count 282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 310
Applied a total of 144 rules in 35 ms. Remains 48 /84 variables (removed 36) and now considering 310/388 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 48/84 places, 310/388 transitions.
RANDOM walk for 1767 steps (122 resets) in 14 ms. (117 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 18 factoid took 622 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 388/388 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-06-03 01:03:47] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:03:47] [INFO ] Invariant cache hit.
[2024-06-03 01:03:47] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 01:03:47] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:03:47] [INFO ] Invariant cache hit.
[2024-06-03 01:03:48] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-03 01:03:48] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-06-03 01:03:48] [INFO ] Redundant transitions in 4 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-03 01:03:48] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:03:48] [INFO ] Invariant cache hit.
[2024-06-03 01:03:48] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 4 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-03 01:03:51] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-03 01:03:53] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:03:53] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2024-06-03 01:03:53] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-06-03 01:03:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-03 01:03:53] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-03 01:03:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-03 01:03:55] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (OVERLAPS) 1/440 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 197 constraints, problems are : Problem set: 0 solved, 379 unsolved in 25350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 379/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 576 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
After SMT, in 55920ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 55929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56563 ms. Remains : 84/84 places, 388/388 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 144 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (7433 resets) in 531 ms. (75 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (1404 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1383 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2024-06-03 01:04:45] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-03 01:04:45] [INFO ] Invariant cache hit.
[2024-06-03 01:04:45] [INFO ] State equation strengthened by 79 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 171 constraints, problems are : Problem set: 1 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 388/388 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 385
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 37 place count 84 transition count 351
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 119 place count 50 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 140 place count 50 transition count 282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 310
Applied a total of 144 rules in 46 ms. Remains 48 /84 variables (removed 36) and now considering 310/388 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 48/84 places, 310/388 transitions.
RANDOM walk for 1970 steps (128 resets) in 13 ms. (140 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 18 factoid took 405 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 18172 reset in 213 ms.
Product exploration explored 100000 steps with 18279 reset in 251 ms.
Built C files in :
/tmp/ltsmin15896551340729440884
[2024-06-03 01:04:46] [INFO ] Computing symmetric may disable matrix : 388 transitions.
[2024-06-03 01:04:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 01:04:46] [INFO ] Computing symmetric may enable matrix : 388 transitions.
[2024-06-03 01:04:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 01:04:46] [INFO ] Computing Do-Not-Accords matrix : 388 transitions.
[2024-06-03 01:04:46] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 01:04:46] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15896551340729440884
Running compilation step : cd /tmp/ltsmin15896551340729440884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1991 ms.
Running link step : cd /tmp/ltsmin15896551340729440884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15896551340729440884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9552226082797665335.hoa' '--buchi-type=spotba'
LTSmin run took 1124 ms.
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 122577 ms.
All properties solved by simple procedures.
Total runtime 773766 ms.

BK_STOP 1717376690168

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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