MCC'2024- Execution of r576-smll-171734920100164

About the Execution of ITS-Tools for MedleyA-PT-21

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
536.432	499955.00	594396.00	1622.90	TFFFTFFFFFFFFFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100164.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-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 70K 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-21-LTLFireability-00
FORMULA_NAME MedleyA-PT-21-LTLFireability-01
FORMULA_NAME MedleyA-PT-21-LTLFireability-02
FORMULA_NAME MedleyA-PT-21-LTLFireability-03
FORMULA_NAME MedleyA-PT-21-LTLFireability-04
FORMULA_NAME MedleyA-PT-21-LTLFireability-05
FORMULA_NAME MedleyA-PT-21-LTLFireability-06
FORMULA_NAME MedleyA-PT-21-LTLFireability-07
FORMULA_NAME MedleyA-PT-21-LTLFireability-08
FORMULA_NAME MedleyA-PT-21-LTLFireability-09
FORMULA_NAME MedleyA-PT-21-LTLFireability-10
FORMULA_NAME MedleyA-PT-21-LTLFireability-11
FORMULA_NAME MedleyA-PT-21-LTLFireability-12
FORMULA_NAME MedleyA-PT-21-LTLFireability-13
FORMULA_NAME MedleyA-PT-21-LTLFireability-14
FORMULA_NAME MedleyA-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717393942272

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-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 05:52:24] [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 05:52:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 05:52:25] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-06-03 05:52:25] [INFO ] Transformed 306 places.
[2024-06-03 05:52:25] [INFO ] Transformed 298 transitions.
[2024-06-03 05:52:25] [INFO ] Found NUPN structural information;
[2024-06-03 05:52:25] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 435 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 3 formulas.
FORMULA MedleyA-PT-21-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 269 transition count 261
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 269 transition count 261
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 106 place count 237 transition count 229
Iterating global reduction 0 with 32 rules applied. Total rules applied 138 place count 237 transition count 229
Applied a total of 138 rules in 157 ms. Remains 237 /306 variables (removed 69) and now considering 229/298 (removed 69) transitions.
// Phase 1: matrix 229 rows 237 cols
[2024-06-03 05:52:25] [INFO ] Computed 20 invariants in 27 ms
[2024-06-03 05:52:26] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-03 05:52:26] [INFO ] Invariant cache hit.
[2024-06-03 05:52:26] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-03 05:52:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:30] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 19 ms to minimize.
[2024-06-03 05:52:30] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:52:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 4 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 5 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 4 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-03 05:52:31] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-06-03 05:52:32] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-03 05:52:32] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-03 05:52:32] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-06-03 05:52:32] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-06-03 05:52:33] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 4 ms to minimize.
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 3 ms to minimize.
[2024-06-03 05:52:34] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-03 05:52:35] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-03 05:52:35] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-06-03 05:52:36] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:38] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-03 05:52:39] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:40] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-03 05:52:40] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:42] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-03 05:52:42] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-03 05:52:42] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-06-03 05:52:43] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-06-03 05:52:43] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:52:43] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 3 ms to minimize.
[2024-06-03 05:52:44] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-06-03 05:52:44] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:52:46] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:52:46] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 229/466 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 296 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 39/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/466 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 228/524 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:53:03] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-06-03 05:53:04] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-06-03 05:53:04] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-06-03 05:53:04] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-06-03 05:53:04] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:53:11] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-06-03 05:53:11] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 3 ms to minimize.
[2024-06-03 05:53:11] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-03 05:53:18] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 4 ms to minimize.
[2024-06-03 05:53:18] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-06-03 05:53:18] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-03 05:53:18] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 536 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 51/51 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 237/306 places, 229/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61242 ms. Remains : 237/306 places, 229/298 transitions.
Support contains 35 out of 237 places after structural reductions.
[2024-06-03 05:53:27] [INFO ] Flatten gal took : 65 ms
[2024-06-03 05:53:27] [INFO ] Flatten gal took : 27 ms
[2024-06-03 05:53:27] [INFO ] Input system was already deterministic with 229 transitions.
RANDOM walk for 40000 steps (8 resets) in 2404 ms. (16 steps per ms) remains 7/27 properties
BEST_FIRST walk for 40001 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2024-06-03 05:53:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/237 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:53:28] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-06-03 05:53:28] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-03 05:53:28] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-03 05:53:28] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 229/466 variables, 237/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:53:28] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/466 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/237 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 229/466 variables, 237/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/466 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 58 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 164 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 232 transition count 169
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 178 transition count 169
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 109 place count 178 transition count 138
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 171 place count 147 transition count 138
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 139 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 139 transition count 130
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 187 place count 139 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 133 transition count 124
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 277 place count 94 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 283 place count 91 transition count 108
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 310 place count 91 transition count 81
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 339 place count 64 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 64 transition count 79
Applied a total of 340 rules in 87 ms. Remains 64 /237 variables (removed 173) and now considering 79/229 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 64/237 places, 79/229 transitions.
RANDOM walk for 1151 steps (41 resets) in 26 ms. (42 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 39 stabilizing places and 39 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((F(p1) U X(X(p2))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 21 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:53:29] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 05:53:29] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 05:53:29] [INFO ] Invariant cache hit.
[2024-06-03 05:53:30] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:53:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:53:32] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 11 ms to minimize.
[2024-06-03 05:53:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:53:32] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:53:33] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-03 05:53:34] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-03 05:53:34] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:53:34] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 2 ms to minimize.
[2024-06-03 05:53:34] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:53:36] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 256 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17712 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:53:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-03 05:53:53] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-03 05:53:54] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-06-03 05:53:54] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-03 05:53:54] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:53:57] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-03 05:53:59] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-06-03 05:53:59] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 4 ms to minimize.
[2024-06-03 05:53:59] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-03 05:53:59] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:04] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-03 05:54:04] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 481 constraints, problems are : Problem set: 0 solved, 213 unsolved in 26437 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints]
After SMT, in 44204ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 44216ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44638 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 491 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-01
Product exploration explored 100000 steps with 28524 reset in 499 ms.
Product exploration explored 100000 steps with 28587 reset in 382 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/222 stabilizing places and 38/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 175 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 770 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-03 05:54:17] [INFO ] Invariant cache hit.
[2024-06-03 05:54:18] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-03 05:54:18] [INFO ] Invariant cache hit.
[2024-06-03 05:54:18] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:54:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-03 05:54:21] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:54:22] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:54:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:54:22] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:54:23] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-03 05:54:23] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:24] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 256 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17763 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:41] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-03 05:54:43] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 4 ms to minimize.
[2024-06-03 05:54:43] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 4 ms to minimize.
[2024-06-03 05:54:43] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-06-03 05:54:44] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:46] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 4 ms to minimize.
[2024-06-03 05:54:48] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 4 ms to minimize.
[2024-06-03 05:54:48] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-06-03 05:54:48] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-06-03 05:54:48] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:54:53] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 3 ms to minimize.
[2024-06-03 05:54:53] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 481 constraints, problems are : Problem set: 0 solved, 213 unsolved in 29652 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints]
After SMT, in 47473ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 47479ms
Finished structural reductions in LTL mode , in 1 iterations and 48031 ms. Remains : 222/222 places, 214/214 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/222 stabilizing places and 38/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 174 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 720 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 504 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28550 reset in 163 ms.
Product exploration explored 100000 steps with 28558 reset in 184 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 214/214 transitions.
Graph (trivial) has 145 edges and 222 vertex of which 6 / 222 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 217 transition count 209
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 42 place count 217 transition count 220
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 71 place count 217 transition count 220
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 87 place count 201 transition count 204
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 103 place count 201 transition count 204
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 153 place count 201 transition count 215
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 170 transition count 184
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 170 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 75 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 217 place count 170 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 219 place count 168 transition count 197
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 221 place count 168 transition count 197
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 221 rules in 111 ms. Remains 168 /222 variables (removed 54) and now considering 197/214 (removed 17) transitions.
[2024-06-03 05:55:09] [INFO ] Redundant transitions in 15 ms returned []
Running 195 sub problems to find dead transitions.
// Phase 1: matrix 197 rows 168 cols
[2024-06-03 05:55:09] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 05:55:09] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-03 05:55:11] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-06-03 05:55:11] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 3 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-03 05:55:12] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 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 TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 20/40 constraints. Problems are: Problem set: 108 solved, 87 unsolved
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-03 05:55:13] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 2/42 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/42 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 196/364 variables, 168/210 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 8/218 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/218 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/219 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/219 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/219 constraints. Problems are: Problem set: 108 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 219 constraints, problems are : Problem set: 108 solved, 87 unsolved in 8243 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 108 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 74/168 variables, 20/20 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 22/42 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/42 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 196/364 variables, 168/210 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 8/218 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 87/305 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/305 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/306 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/306 constraints. Problems are: Problem set: 108 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/306 constraints. Problems are: Problem set: 108 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 306 constraints, problems are : Problem set: 108 solved, 87 unsolved in 7763 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 87/195 constraints, Known Traps: 22/22 constraints]
After SMT, in 16097ms problems are : Problem set: 108 solved, 87 unsolved
Search for dead transitions found 108 dead transitions in 16114ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/222 places, 89/214 transitions.
Graph (complete) has 231 edges and 168 vertex of which 95 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.2 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 20 ms. Remains 95 /168 variables (removed 73) and now considering 131/89 (removed -42) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/222 places, 131/214 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16286 ms. Remains : 95/222 places, 131/214 transitions.
Built C files in :
/tmp/ltsmin1430368101290906326
[2024-06-03 05:55:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1430368101290906326
Running compilation step : cd /tmp/ltsmin1430368101290906326;'/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 876 ms.
Running link step : cd /tmp/ltsmin1430368101290906326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin1430368101290906326;'/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/stateBased4798829708549287533.hoa' '--buchi-type=spotba'
LTSmin run took 1218 ms.
FORMULA MedleyA-PT-21-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-01 finished in 118562 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)||G((p1||(F(p0) U p2)))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 160 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 231 transition count 172
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 180 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 179 transition count 171
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 105 place count 179 transition count 138
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 171 place count 146 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 179 place count 138 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 187 place count 138 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 187 place count 138 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 134 transition count 126
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 269 place count 97 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 281 place count 91 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 90 transition count 134
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 89 vertex of which 4 / 89 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 284 place count 87 transition count 134
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 287 place count 86 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 293 place count 83 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 83 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 295 place count 83 transition count 126
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 297 place count 82 transition count 126
Applied a total of 297 rules in 48 ms. Remains 82 /237 variables (removed 155) and now considering 126/229 (removed 103) transitions.
// Phase 1: matrix 126 rows 82 cols
[2024-06-03 05:55:28] [INFO ] Computed 18 invariants in 2 ms
[2024-06-03 05:55:28] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-03 05:55:28] [INFO ] Invariant cache hit.
[2024-06-03 05:55:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 05:55:28] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-03 05:55:28] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-03 05:55:28] [INFO ] Invariant cache hit.
[2024-06-03 05:55:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/82 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-03 05:55:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-03 05:55:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:55:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 125/207 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 82/82 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/82 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 125/207 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 104/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/208 variables, and 216 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3750 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 82/82 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints]
After SMT, in 6884ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/237 places, 126/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7250 ms. Remains : 82/237 places, 126/229 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-02 finished in 7375 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||X(G((p1&&F(p2)))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 228 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 228 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 223 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 223 transition count 215
Applied a total of 28 rules in 9 ms. Remains 223 /237 variables (removed 14) and now considering 215/229 (removed 14) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-03 05:55:35] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 05:55:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 05:55:35] [INFO ] Invariant cache hit.
[2024-06-03 05:55:35] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-03 05:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:55:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-03 05:55:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-03 05:55:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-06-03 05:55:39] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-03 05:55:40] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-03 05:55:40] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:55:40] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:55:40] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 256 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13760 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:55:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:55:53] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/438 variables, 223/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 214/472 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:55:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:55:58] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-06-03 05:55:59] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 3 ms to minimize.
[2024-06-03 05:56:00] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-06-03 05:56:00] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:56:04] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:56:07] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 4 ms to minimize.
[2024-06-03 05:56:07] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-03 05:56:08] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 4 ms to minimize.
[2024-06-03 05:56:08] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:56:12] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:56:17] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:56:19] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 485 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 28/28 constraints]
After SMT, in 43796ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 43799ms
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 215/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44236 ms. Remains : 223/237 places, 215/229 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 98 ms.
Stack based approach found an accepted trace after 171 steps with 0 reset with depth 172 and stack size 172 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-03 finished in 44565 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||X(p1)))||G(!p2))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 9 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:56:20] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 05:56:20] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-03 05:56:20] [INFO ] Invariant cache hit.
[2024-06-03 05:56:20] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 4 ms to minimize.
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 3 ms to minimize.
[2024-06-03 05:56:23] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 3 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 3 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 4 ms to minimize.
[2024-06-03 05:56:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:56:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-03 05:56:25] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:56:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-03 05:56:27] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:29] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/436 variables, 222/260 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 260 constraints, problems are : Problem set: 0 solved, 213 unsolved in 19456 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/260 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/473 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:45] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 4 ms to minimize.
[2024-06-03 05:56:46] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:51] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 3 ms to minimize.
[2024-06-03 05:56:52] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-06-03 05:56:52] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-03 05:56:52] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:56:57] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 480 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 49487ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 49490ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49965 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-21-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLFireability-04 finished in 50679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 221 transition count 213
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 221 transition count 213
Applied a total of 32 rules in 11 ms. Remains 221 /237 variables (removed 16) and now considering 213/229 (removed 16) transitions.
// Phase 1: matrix 213 rows 221 cols
[2024-06-03 05:57:10] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:57:10] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-03 05:57:10] [INFO ] Invariant cache hit.
[2024-06-03 05:57:11] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-03 05:57:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 05:57:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:57:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:57:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-03 05:57:14] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
[2024-06-03 05:57:15] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-06-03 05:57:15] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-03 05:57:15] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-06-03 05:57:15] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-03 05:57:15] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:57:16] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-03 05:57:16] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 05:57:18] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 253 constraints, problems are : Problem set: 0 solved, 212 unsolved in 17591 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/465 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 05:57:33] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:57:34] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 4 ms to minimize.
[2024-06-03 05:57:35] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-06-03 05:57:35] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 4 ms to minimize.
[2024-06-03 05:57:36] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2024-06-03 05:57:36] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-06-03 05:57:36] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 4 ms to minimize.
[2024-06-03 05:57:37] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-03 05:57:37] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 9/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 474 constraints, problems are : Problem set: 0 solved, 212 unsolved in 18923 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 21/21 constraints]
After SMT, in 36549ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 36554ms
Starting structural reductions in LTL mode, iteration 1 : 221/237 places, 213/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37076 ms. Remains : 221/237 places, 213/229 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 149 ms.
Stack based approach found an accepted trace after 171 steps with 0 reset with depth 172 and stack size 172 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-05 finished in 37388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 165 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 231 transition count 168
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 176 transition count 168
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 111 place count 176 transition count 137
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 173 place count 145 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 182 place count 136 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 191 place count 136 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 191 place count 136 transition count 122
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 130 transition count 122
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 279 place count 92 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 89 transition count 107
Applied a total of 285 rules in 33 ms. Remains 89 /237 variables (removed 148) and now considering 107/229 (removed 122) transitions.
// Phase 1: matrix 107 rows 89 cols
[2024-06-03 05:57:48] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:57:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 05:57:48] [INFO ] Invariant cache hit.
[2024-06-03 05:57:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-03 05:57:48] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-03 05:57:48] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-03 05:57:48] [INFO ] Invariant cache hit.
[2024-06-03 05:57:48] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-03 05:57:49] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-03 05:57:49] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:57:49] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 106/195 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 127 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3152 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 89/89 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 106/195 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 216 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4434 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 89/89 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
After SMT, in 7618ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/237 places, 107/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7893 ms. Remains : 89/237 places, 107/229 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 29 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-06 finished in 8120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((F(G(p0)) U (p1 U p0))))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 10 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:57:56] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:57:56] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 05:57:56] [INFO ] Invariant cache hit.
[2024-06-03 05:57:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:57:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:57:58] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 3 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-03 05:57:59] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/252 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:05] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-03 05:58:05] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 254 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-03 05:58:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:58:16] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-06-03 05:58:16] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-03 05:58:16] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-03 05:58:17] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-03 05:58:17] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:19] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-06-03 05:58:19] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 3 ms to minimize.
[2024-06-03 05:58:20] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:29] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:34] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 480 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 45044ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 45047ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45401 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-08
Product exploration explored 100000 steps with 56 reset in 185 ms.
Stack based approach found an accepted trace after 221 steps with 5 reset with depth 161 and stack size 161 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-08 finished in 45947 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&&F(p1)))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 11 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:58:42] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:58:42] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-03 05:58:42] [INFO ] Invariant cache hit.
[2024-06-03 05:58:42] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:58:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:58:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-03 05:58:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:58:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:58:45] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 4 ms to minimize.
[2024-06-03 05:58:45] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-06-03 05:58:46] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-03 05:58:46] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-03 05:58:46] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-03 05:58:46] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-03 05:58:46] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-06-03 05:58:47] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/253 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 253 constraints, problems are : Problem set: 0 solved, 213 unsolved in 16014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:59:00] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-03 05:59:01] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/468 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:59:05] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:59:06] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 4 ms to minimize.
[2024-06-03 05:59:06] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 3 ms to minimize.
[2024-06-03 05:59:06] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-06-03 05:59:06] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-06-03 05:59:06] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-06-03 05:59:08] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 7/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:59:11] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 4 ms to minimize.
[2024-06-03 05:59:12] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 4 ms to minimize.
[2024-06-03 05:59:12] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 4 ms to minimize.
[2024-06-03 05:59:13] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 4 ms to minimize.
[2024-06-03 05:59:14] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 4 ms to minimize.
[2024-06-03 05:59:14] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
[2024-06-03 05:59:14] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-06-03 05:59:14] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:59:22] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 29/29 constraints]
After SMT, in 46050ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 46054ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46583 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 177 steps with 0 reset with depth 178 and stack size 178 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-09 finished in 46941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 166 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 232 transition count 170
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 178 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 177 transition count 169
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 111 place count 177 transition count 139
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 171 place count 147 transition count 139
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 180 place count 138 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 189 place count 138 transition count 130
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 189 place count 138 transition count 123
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 203 place count 131 transition count 123
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 281 place count 92 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 89 transition count 107
Applied a total of 287 rules in 41 ms. Remains 89 /237 variables (removed 148) and now considering 107/229 (removed 122) transitions.
// Phase 1: matrix 107 rows 89 cols
[2024-06-03 05:59:29] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:59:29] [INFO ] Implicit Places using invariants in 149 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/237 places, 107/229 transitions.
Graph (trivial) has 32 edges and 88 vertex of which 4 / 88 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 8 ms. Remains 86 /88 variables (removed 2) and now considering 105/107 (removed 2) transitions.
[2024-06-03 05:59:29] [INFO ] Flow matrix only has 103 transitions (discarded 2 similar events)
// Phase 1: matrix 103 rows 86 cols
[2024-06-03 05:59:29] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 05:59:29] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-03 05:59:29] [INFO ] Flow matrix only has 103 transitions (discarded 2 similar events)
[2024-06-03 05:59:29] [INFO ] Invariant cache hit.
[2024-06-03 05:59:29] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-03 05:59:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/237 places, 105/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 593 ms. Remains : 86/237 places, 105/229 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-10 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 226 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 226 transition count 218
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 220 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 220 transition count 212
Applied a total of 34 rules in 12 ms. Remains 220 /237 variables (removed 17) and now considering 212/229 (removed 17) transitions.
// Phase 1: matrix 212 rows 220 cols
[2024-06-03 05:59:29] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:59:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-03 05:59:30] [INFO ] Invariant cache hit.
[2024-06-03 05:59:30] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-03 05:59:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 05:59:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-03 05:59:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:59:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 4 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-03 05:59:34] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-06-03 05:59:35] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-03 05:59:35] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 05:59:37] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 05:59:40] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-03 05:59:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 254 constraints, problems are : Problem set: 0 solved, 211 unsolved in 19394 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 211/465 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 05:59:55] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-03 05:59:55] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2024-06-03 05:59:55] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-03 05:59:55] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-03 05:59:55] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 05:59:58] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-03 05:59:58] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 06:00:01] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-03 06:00:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 474 constraints, problems are : Problem set: 0 solved, 211 unsolved in 20991 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints]
After SMT, in 40421ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 40425ms
Starting structural reductions in LTL mode, iteration 1 : 220/237 places, 212/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40980 ms. Remains : 220/237 places, 212/229 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 26882 steps (6 resets) in 49 ms. (537 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-21-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLFireability-11 finished in 41560 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((F(p1)&&p0)))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 160 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 231 transition count 172
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 180 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 179 transition count 171
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 179 transition count 139
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 169 place count 147 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 177 place count 139 transition count 131
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 139 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 185 place count 139 transition count 126
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 134 transition count 126
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 273 place count 95 transition count 87
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 90 transition count 120
Applied a total of 283 rules in 19 ms. Remains 90 /237 variables (removed 147) and now considering 120/229 (removed 109) transitions.
// Phase 1: matrix 120 rows 90 cols
[2024-06-03 06:00:11] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 06:00:11] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-03 06:00:11] [INFO ] Invariant cache hit.
[2024-06-03 06:00:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-03 06:00:11] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-03 06:00:11] [INFO ] Redundant transitions in 1 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-03 06:00:11] [INFO ] Invariant cache hit.
[2024-06-03 06:00:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-03 06:00:12] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-03 06:00:12] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-03 06:00:12] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-03 06:00:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-03 06:00:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 126 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3462 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 90/90 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 96/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 222 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4211 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 90/90 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 5/5 constraints]
After SMT, in 7707ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7708ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/237 places, 120/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7988 ms. Remains : 90/237 places, 120/229 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-12 finished in 8065 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||(p1&&F(G(p2))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 159 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 231 transition count 170
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 178 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 177 transition count 169
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 109 place count 177 transition count 138
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 171 place count 146 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 140 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 140 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 183 place count 140 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 136 transition count 128
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 269 place count 97 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 94 transition count 112
Applied a total of 275 rules in 19 ms. Remains 94 /237 variables (removed 143) and now considering 112/229 (removed 117) transitions.
// Phase 1: matrix 112 rows 94 cols
[2024-06-03 06:00:19] [INFO ] Computed 20 invariants in 0 ms
[2024-06-03 06:00:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-03 06:00:19] [INFO ] Invariant cache hit.
[2024-06-03 06:00:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-03 06:00:19] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-03 06:00:19] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-03 06:00:19] [INFO ] Invariant cache hit.
[2024-06-03 06:00:19] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-03 06:00:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-03 06:00:20] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-03 06:00:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-03 06:00:20] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 111/205 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 111/205 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 226 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 7182ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 7185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/237 places, 112/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7459 ms. Remains : 94/237 places, 112/229 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 115 ms.
Product exploration explored 100000 steps with 1 reset in 201 ms.
Computed a total of 1 stabilizing places and 18 stable transitions
Computed a total of 1 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 400 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2024-06-03 06:00:28] [INFO ] Invariant cache hit.
[2024-06-03 06:00:28] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/197 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/204 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/205 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/206 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 06:00:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-03 06:00:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-03 06:00:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-03 06:00:28] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 108/197 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/204 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/205 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/206 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 12 factoid took 546 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 2 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-03 06:00:29] [INFO ] Invariant cache hit.
[2024-06-03 06:00:29] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 06:00:29] [INFO ] Invariant cache hit.
[2024-06-03 06:00:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-03 06:00:29] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-03 06:00:29] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-03 06:00:29] [INFO ] Invariant cache hit.
[2024-06-03 06:00:29] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-03 06:00:30] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-03 06:00:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-03 06:00:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-03 06:00:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 111/205 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 111/205 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 226 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5597 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 8752ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8753ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9034 ms. Remains : 94/94 places, 112/112 transitions.
Computed a total of 1 stabilizing places and 18 stable transitions
Computed a total of 1 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/6 properties
BEST_FIRST walk for 33761 steps (7 resets) in 27 ms. (1205 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 614 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Product exploration explored 100000 steps with 3 reset in 609 ms.
Built C files in :
/tmp/ltsmin14204522182715665563
[2024-06-03 06:00:40] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-06-03 06:00:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 06:00:40] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-06-03 06:00:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 06:00:40] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-06-03 06:00:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 06:00:40] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14204522182715665563
Running compilation step : cd /tmp/ltsmin14204522182715665563;'/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 495 ms.
Running link step : cd /tmp/ltsmin14204522182715665563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14204522182715665563;'/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/stateBased12673704345765897639.hoa' '--buchi-type=spotba'
LTSmin run took 696 ms.
FORMULA MedleyA-PT-21-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-14 finished in 22635 ms.
All properties solved by simple procedures.
Total runtime 497406 ms.

BK_STOP 1717394442227

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

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