About the Execution of LTSMin+red for ShieldIIPs-PT-002B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
549.340 | 428355.00 | 950009.00 | 931.50 | FTFFFFTFTTFFFFFT | 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.r528-tall-171683760200028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760200028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:43 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 ShieldIIPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717223239273
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:27:20] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-06-01 06:27:20] [INFO ] Transformed 123 places.
[2024-06-01 06:27:20] [INFO ] Transformed 121 transitions.
[2024-06-01 06:27:20] [INFO ] Found NUPN structural information;
[2024-06-01 06:27:20] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 31 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-06-01 06:27:20] [INFO ] Computed 19 invariants in 15 ms
[2024-06-01 06:27:21] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 06:27:21] [INFO ] Invariant cache hit.
[2024-06-01 06:27:21] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-06-01 06:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 13 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 110/222 variables, 112/181 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/222 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/222 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/222 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/222 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/222 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/222 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/222 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/222 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 30 (OVERLAPS) 0/222 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 236 constraints, problems are : Problem set: 0 solved, 109 unsolved in 19118 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/222 variables, 112/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 109/345 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 06:27:51] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/222 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 352 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17323 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 112/112 constraints]
After SMT, in 36530ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 36546ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37202 ms. Remains : 112/123 places, 110/121 transitions.
Support contains 34 out of 112 places after structural reductions.
[2024-06-01 06:27:58] [INFO ] Flatten gal took : 66 ms
[2024-06-01 06:27:58] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:27:58] [INFO ] Input system was already deterministic with 110 transitions.
RANDOM walk for 40000 steps (114 resets) in 1103 ms. (36 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40003 steps (27 resets) in 180 ms. (221 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
[2024-06-01 06:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 110/222 variables, 112/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 2 ms to minimize.
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 138 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/222 variables, 112/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1963ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 289 ms.
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 112 transition count 101
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 103 transition count 101
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 103 transition count 90
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 92 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 89 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 89 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 89 transition count 86
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 86
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
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 110 place count 57 transition count 55
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 57 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 56 transition count 54
Applied a total of 125 rules in 107 ms. Remains 56 /112 variables (removed 56) and now considering 54/110 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 56/112 places, 54/110 transitions.
RANDOM walk for 40000 steps (8 resets) in 551 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1538692 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :0 out of 2
Probabilistic random walk after 1538692 steps, saw 320112 distinct states, run finished after 3004 ms. (steps per millisecond=512 ) properties seen :0
// Phase 1: matrix 54 rows 56 cols
[2024-06-01 06:28:04] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:28:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/29 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/68 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/92 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/105 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/105 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/106 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/106 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/108 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/108 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/108 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/110 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/110 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/110 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 81 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/29 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/68 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/92 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/105 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/105 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/105 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/106 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/108 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/108 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/108 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/110 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/110 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/110 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 83 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 56/56 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 06:28:05] [INFO ] Invariant cache hit.
[2024-06-01 06:28:05] [INFO ] Implicit Places using invariants in 65 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/56 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82 ms. Remains : 55/56 places, 54/54 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1551497 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :0 out of 2
Probabilistic random walk after 1551497 steps, saw 320815 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
// Phase 1: matrix 54 rows 55 cols
[2024-06-01 06:28:08] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/28 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/67 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/91 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/104 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/107 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/107 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/107 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/109 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/109 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/109 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/109 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/28 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/67 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/91 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/104 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/104 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/105 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/105 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/105 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/107 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/107 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/107 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/109 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/109 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/109 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/109 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/55 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 06:28:08] [INFO ] Invariant cache hit.
[2024-06-01 06:28:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:28:08] [INFO ] Invariant cache hit.
[2024-06-01 06:28:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 06:28:09] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 06:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 2/55 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 54/109 variables, 55/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/109 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/109 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/109 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/109 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/109 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 18 (OVERLAPS) 0/109 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2468 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 2/55 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 54/109 variables, 55/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/109 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 148 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 23/23 constraints]
After SMT, in 4463ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4581 ms. Remains : 55/55 places, 54/54 transitions.
FORMULA ShieldIIPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 111 transition count 98
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 100 transition count 98
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 100 transition count 88
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 86 transition count 84
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 86 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 84 transition count 82
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Applied a total of 114 rules in 21 ms. Remains 53 /112 variables (removed 59) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:28:13] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:28:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:28:13] [INFO ] Invariant cache hit.
[2024-06-01 06:28:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 06:28:13] [INFO ] Redundant transitions in 20 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 51/104 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 85 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 49/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 136 constraints, problems are : Problem set: 0 solved, 49 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 15/15 constraints]
After SMT, in 2322ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/112 places, 51/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2456 ms. Remains : 53/112 places, 51/110 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-00
Stuttering criterion allowed to conclude after 285 steps with 1 reset in 8 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-00 finished in 2757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1)&&F(p2))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 8 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-06-01 06:28:16] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:28:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 06:28:16] [INFO ] Invariant cache hit.
[2024-06-01 06:28:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:28:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:28:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:18] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:18] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 107/216 variables, 109/163 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/216 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/216 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/216 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 22 (OVERLAPS) 0/216 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 187 constraints, problems are : Problem set: 0 solved, 106 unsolved in 11172 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/216 variables, 109/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 106/293 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:31] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:28:31] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:28:32] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:32] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:28:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (OVERLAPS) 0/216 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 312 constraints, problems are : Problem set: 0 solved, 106 unsolved in 14032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 78/78 constraints]
After SMT, in 25221ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25222ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25351 ms. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 21 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-01 finished in 25910 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((p0&&G(p1))))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 7 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-06-01 06:28:42] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 06:28:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 06:28:42] [INFO ] Invariant cache hit.
[2024-06-01 06:28:42] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 06:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 5 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13115 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14214 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 27344ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 27346ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27478 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-03 finished in 27723 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(G((X(G(p1))&&p0))))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 3 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-06-01 06:29:10] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:29:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 06:29:10] [INFO ] Invariant cache hit.
[2024-06-01 06:29:10] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:29:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/147 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/216 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 177 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9122 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:19] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/179 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/285 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/216 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:36] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/216 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 19 (OVERLAPS) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 302 constraints, problems are : Problem set: 0 solved, 106 unsolved in 22441 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 68/68 constraints]
After SMT, in 31577ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 31578ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31696 ms. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-05 finished in 31925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-06-01 06:29:42] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:29:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 06:29:42] [INFO ] Invariant cache hit.
[2024-06-01 06:29:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 06:29:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13571 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:03] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14426 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 28009ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 28010ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28212 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-06 finished in 28567 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((G(p1)||p0))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 87 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 48 place count 87 transition count 82
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 54 place count 84 transition count 82
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 114 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 51 transition count 50
Applied a total of 117 rules in 22 ms. Remains 51 /112 variables (removed 61) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-06-01 06:30:10] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 06:30:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 06:30:10] [INFO ] Invariant cache hit.
[2024-06-01 06:30:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 06:30:10] [INFO ] Redundant transitions in 23 ms returned [49]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:30:10] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 49/100 variables, 51/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 78 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 49/100 variables, 51/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 128 constraints, problems are : Problem set: 0 solved, 47 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 12/12 constraints]
After SMT, in 2039ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2190 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-07
Product exploration explored 100000 steps with 2860 reset in 146 ms.
Stuttering criterion allowed to conclude after 68016 steps with 1962 reset in 146 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-07 finished in 2568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 5 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-06-01 06:30:13] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:30:13] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 06:30:13] [INFO ] Invariant cache hit.
[2024-06-01 06:30:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 06:30:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13176 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14352 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 27543ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 27544ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27675 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-08 finished in 27979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
[2024-06-01 06:30:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
[2024-06-01 06:30:41] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12811 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:58] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14594 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 27418ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 27419ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27554 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-09 finished in 27913 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(G(p1))&&p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 52 transition count 51
Applied a total of 115 rules in 20 ms. Remains 52 /112 variables (removed 60) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-06-01 06:31:09] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 06:31:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 06:31:09] [INFO ] Invariant cache hit.
[2024-06-01 06:31:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 06:31:09] [INFO ] Redundant transitions in 14 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 49 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:31:09] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 50/102 variables, 52/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 83 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 134 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 15/15 constraints]
After SMT, in 2255ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/112 places, 50/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2387 ms. Remains : 52/112 places, 50/110 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-10
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-10 finished in 2527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 114 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 51 transition count 50
Applied a total of 117 rules in 17 ms. Remains 51 /112 variables (removed 61) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-06-01 06:31:11] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 06:31:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 06:31:11] [INFO ] Invariant cache hit.
[2024-06-01 06:31:11] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-01 06:31:11] [INFO ] Redundant transitions in 20 ms returned [49]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:31:11] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 49/100 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 76 constraints, problems are : Problem set: 0 solved, 47 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 49/100 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/100 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/100 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 127 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 11/11 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2240 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-12
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-12 finished in 2347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 88 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 88 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 46 place count 88 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 52 transition count 51
Applied a total of 115 rules in 14 ms. Remains 52 /112 variables (removed 60) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-06-01 06:31:14] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 06:31:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:31:14] [INFO ] Invariant cache hit.
[2024-06-01 06:31:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 06:31:14] [INFO ] Redundant transitions in 19 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:31:14] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/102 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 83 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 47/130 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 133 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 16/16 constraints]
After SMT, in 3088ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/112 places, 50/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3220 ms. Remains : 52/112 places, 50/110 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-13
Stuttering criterion allowed to conclude after 168 steps with 3 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-13 finished in 3351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 111 transition count 98
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 100 transition count 98
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 100 transition count 87
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 89 transition count 87
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 85 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 52 place count 85 transition count 80
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 58 place count 82 transition count 80
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 116 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 51 transition count 49
Applied a total of 118 rules in 14 ms. Remains 51 /112 variables (removed 61) and now considering 49/110 (removed 61) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:31:17] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:17] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 06:31:17] [INFO ] Invariant cache hit.
[2024-06-01 06:31:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 06:31:17] [INFO ] Redundant transitions in 15 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 06:31:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/100 variables, 51/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 82 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 49/100 variables, 51/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 48/130 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 132 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 14/14 constraints]
After SMT, in 2314ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2442 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-14
Product exploration explored 100000 steps with 735 reset in 177 ms.
Stack based approach found an accepted trace after 4079 steps with 29 reset with depth 169 and stack size 156 in 23 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-14 finished in 2703 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)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 102 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 87 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 108 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 55 transition count 53
Applied a total of 110 rules in 15 ms. Remains 55 /112 variables (removed 57) and now considering 53/110 (removed 57) transitions.
// Phase 1: matrix 53 rows 55 cols
[2024-06-01 06:31:20] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:31:20] [INFO ] Invariant cache hit.
[2024-06-01 06:31:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:20] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 06:31:20] [INFO ] Redundant transitions in 16 ms returned [52]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 50 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-06-01 06:31:20] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 52/107 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:21] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:21] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 89 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 52/107 variables, 55/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 50/139 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 142 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 2824ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2825ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/112 places, 52/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2950 ms. Remains : 55/112 places, 52/110 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-15
Product exploration explored 100000 steps with 660 reset in 144 ms.
Product exploration explored 100000 steps with 655 reset in 155 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/55 stabilizing places and 3/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (262 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (61 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2905912 steps, run timeout after 3001 ms. (steps per millisecond=968 ) properties seen :0 out of 1
Probabilistic random walk after 2905912 steps, saw 459436 distinct states, run finished after 3001 ms. (steps per millisecond=968 ) properties seen :0
[2024-06-01 06:31:27] [INFO ] Invariant cache hit.
[2024-06-01 06:31:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/56 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/72 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/74 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/74 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/97 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/97 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/97 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/98 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/100 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/107 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/107 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/107 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/107 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/56 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/72 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/74 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/97 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/97 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/98 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/100 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/100 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/100 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/107 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/107 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 54 transition count 51
Applied a total of 15 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/55 places, 51/52 transitions.
RANDOM walk for 40000 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2969058 steps, run timeout after 3001 ms. (steps per millisecond=989 ) properties seen :0 out of 1
Probabilistic random walk after 2969058 steps, saw 614274 distinct states, run finished after 3002 ms. (steps per millisecond=989 ) properties seen :0
// Phase 1: matrix 51 rows 54 cols
[2024-06-01 06:31:30] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:31:30] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/72 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/95 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/96 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/96 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/96 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/98 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/105 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/105 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/105 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/72 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/95 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/95 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/96 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/96 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/96 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/98 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/98 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/105 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/105 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/105 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/105 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/105 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 54/54 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:30] [INFO ] Invariant cache hit.
[2024-06-01 06:31:30] [INFO ] Implicit Places using invariants in 47 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50 ms. Remains : 53/54 places, 51/51 transitions.
RANDOM walk for 40000 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2712408 steps, run timeout after 3001 ms. (steps per millisecond=903 ) properties seen :0 out of 1
Probabilistic random walk after 2712408 steps, saw 552258 distinct states, run finished after 3001 ms. (steps per millisecond=903 ) properties seen :0
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:31:33] [INFO ] Computed 18 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:33] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/55 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/71 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/94 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/94 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/94 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/95 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/97 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/97 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/104 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/104 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/55 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/71 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/94 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/94 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/94 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/95 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/97 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/104 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/104 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/104 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/104 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 219ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 53/53 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:33] [INFO ] Invariant cache hit.
[2024-06-01 06:31:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:31:33] [INFO ] Invariant cache hit.
[2024-06-01 06:31:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 06:31:33] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:31:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 51/104 variables, 53/76 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 84 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 51/104 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 49/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 134 constraints, problems are : Problem set: 0 solved, 49 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
After SMT, in 2673ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2775 ms. Remains : 53/53 places, 51/51 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 476 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p1)]
Support contains 4 out of 55 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 : 55/55 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-06-01 06:31:37] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:31:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 06:31:37] [INFO ] Invariant cache hit.
[2024-06-01 06:31:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:31:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 06:31:37] [INFO ] Redundant transitions in 19 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 06:31:37] [INFO ] Invariant cache hit.
[2024-06-01 06:31:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 52/107 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 86 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 52/107 variables, 55/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 0/107 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 143 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2464 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 16/16 constraints]
After SMT, in 3679ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 3680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3805 ms. Remains : 55/55 places, 52/52 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (260 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (61 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2621572 steps, run timeout after 3001 ms. (steps per millisecond=873 ) properties seen :0 out of 1
Probabilistic random walk after 2621572 steps, saw 426440 distinct states, run finished after 3001 ms. (steps per millisecond=873 ) properties seen :0
[2024-06-01 06:31:44] [INFO ] Invariant cache hit.
[2024-06-01 06:31:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/56 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/72 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/74 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/74 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/97 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/97 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/97 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/98 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/100 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/107 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/107 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/107 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/107 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/56 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/72 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/74 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/97 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/97 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/98 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/100 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/100 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/100 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/107 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/107 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 54 transition count 51
Applied a total of 15 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 54/55 places, 51/52 transitions.
RANDOM walk for 40000 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2806379 steps, run timeout after 3001 ms. (steps per millisecond=935 ) properties seen :0 out of 1
Probabilistic random walk after 2806379 steps, saw 582616 distinct states, run finished after 3001 ms. (steps per millisecond=935 ) properties seen :0
// Phase 1: matrix 51 rows 54 cols
[2024-06-01 06:31:47] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/72 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/95 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/96 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/96 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/96 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/98 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/105 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/105 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/105 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/72 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/95 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/95 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/96 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/96 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/96 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/98 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/98 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/105 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/105 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/105 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/105 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/105 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 54/54 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:47] [INFO ] Invariant cache hit.
[2024-06-01 06:31:47] [INFO ] Implicit Places using invariants in 37 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40 ms. Remains : 53/54 places, 51/51 transitions.
RANDOM walk for 40000 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2746449 steps, run timeout after 3001 ms. (steps per millisecond=915 ) properties seen :0 out of 1
Probabilistic random walk after 2746449 steps, saw 564179 distinct states, run finished after 3001 ms. (steps per millisecond=915 ) properties seen :0
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:31:50] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:50] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/55 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/71 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/94 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/94 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/94 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/95 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/97 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/97 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/104 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/104 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/55 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/71 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/94 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/94 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/94 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/95 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/97 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/104 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/104 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/104 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/104 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 53/53 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:50] [INFO ] Invariant cache hit.
[2024-06-01 06:31:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 06:31:51] [INFO ] Invariant cache hit.
[2024-06-01 06:31:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 06:31:51] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 51/104 variables, 53/76 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 84 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 51/104 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 49/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 134 constraints, problems are : Problem set: 0 solved, 49 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
After SMT, in 2584ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2684 ms. Remains : 53/53 places, 51/51 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 653 reset in 143 ms.
Product exploration explored 100000 steps with 656 reset in 155 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 1 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2024-06-01 06:31:54] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:54] [INFO ] Implicit Places using invariants in 42 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/55 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 53/55 places, 51/52 transitions.
Treatment of property ShieldIIPs-PT-002B-LTLFireability-15 finished in 34200 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)))'
[2024-06-01 06:31:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:31:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 06:31:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 110 transitions and 340 arcs took 3 ms.
Total runtime 274110 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-002B-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717223667628
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-002B-LTLFireability-15
ltl formula formula --ltl=/tmp/3565/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 112 places, 110 transitions and 340 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3565/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3565/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3565/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3565/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 145 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~423 levels ~10000 states ~107028 transitions
pnml2lts-mc( 1/ 4): ~496 levels ~20000 states ~254872 transitions
pnml2lts-mc( 1/ 4): ~532 levels ~40000 states ~600520 transitions
pnml2lts-mc( 1/ 4): ~1486 levels ~80000 states ~1226764 transitions
pnml2lts-mc( 1/ 4): ~5240 levels ~160000 states ~2361312 transitions
pnml2lts-mc( 0/ 4): ~10751 levels ~320000 states ~4925888 transitions
pnml2lts-mc( 0/ 4): ~24402 levels ~640000 states ~10585372 transitions
pnml2lts-mc( 0/ 4): ~32736 levels ~1280000 states ~22284536 transitions
pnml2lts-mc( 2/ 4): ~60928 levels ~2560000 states ~47289596 transitions
pnml2lts-mc( 3/ 4): ~72268 levels ~5120000 states ~96490236 transitions
pnml2lts-mc( 3/ 4): ~127765 levels ~10240000 states ~201635684 transitions
pnml2lts-mc( 3/ 4): ~386726 levels ~20480000 states ~413601700 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3713958
pnml2lts-mc( 0/ 4): unique states count: 33445876
pnml2lts-mc( 0/ 4): unique transitions count: 701133758
pnml2lts-mc( 0/ 4): - self-loop count: 28
pnml2lts-mc( 0/ 4): - claim dead count: 122123685
pnml2lts-mc( 0/ 4): - claim found count: 536798074
pnml2lts-mc( 0/ 4): - claim success count: 33454774
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1955233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33506089 states 702233363 transitions, fanout: 20.958
pnml2lts-mc( 0/ 4): Total exploration time 152.370 sec (152.320 sec minimum, 152.338 sec on average)
pnml2lts-mc( 0/ 4): States per second: 219900, Transitions per second: 4608738
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.9MB, 8.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 110 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.9MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-002B, 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 r528-tall-171683760200028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B 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 '
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 ;