MCC'2024- Execution of r492-smll-171636266300156

About the Execution of LTSMin+red for EisenbergMcGuire-PT-04

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
977.852	1768084.00	2048147.00	4685.60	FFFFFFFFTTFFFFTF	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.r492-smll-171636266300156.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 EisenbergMcGuire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 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 EisenbergMcGuire-PT-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717221273167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:54:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:54:36] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-06-01 05:54:36] [INFO ] Transformed 196 places.
[2024-06-01 05:54:36] [INFO ] Transformed 448 transitions.
[2024-06-01 05:54:36] [INFO ] Found NUPN structural information;
[2024-06-01 05:54:36] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 511 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 424
Applied a total of 12 rules in 103 ms. Remains 190 /196 variables (removed 6) and now considering 424/448 (removed 24) transitions.
[2024-06-01 05:54:36] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
// Phase 1: matrix 260 rows 190 cols
[2024-06-01 05:54:36] [INFO ] Computed 13 invariants in 40 ms
[2024-06-01 05:54:37] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-06-01 05:54:37] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-06-01 05:54:37] [INFO ] Invariant cache hit.
[2024-06-01 05:54:37] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-01 05:54:38] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-01 05:54:38] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-06-01 05:54:38] [INFO ] Invariant cache hit.
[2024-06-01 05:54:38] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:54:42] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 35 ms to minimize.
[2024-06-01 05:54:42] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 4 ms to minimize.
[2024-06-01 05:54:43] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-01 05:54:43] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
[2024-06-01 05:54:43] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:54:43] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 4 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 3 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 3 ms to minimize.
[2024-06-01 05:54:44] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-06-01 05:54:45] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 3 ms to minimize.
[2024-06-01 05:54:45] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 4 ms to minimize.
[2024-06-01 05:54:45] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 4 ms to minimize.
[2024-06-01 05:54:46] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 3 ms to minimize.
[2024-06-01 05:54:46] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-06-01 05:54:46] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:54:47] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 4 ms to minimize.
[2024-06-01 05:54:47] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:54:47] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 05:54:48] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 2 ms to minimize.
[2024-06-01 05:54:48] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2024-06-01 05:54:48] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-01 05:54:49] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 3 ms to minimize.
[2024-06-01 05:54:49] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 4 ms to minimize.
[2024-06-01 05:54:50] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:54:51] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:54:52] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-06-01 05:54:52] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
[2024-06-01 05:54:52] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 3 ms to minimize.
[2024-06-01 05:54:52] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:54:53] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 5 ms to minimize.
[2024-06-01 05:54:53] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:54:57] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2024-06-01 05:54:58] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 4 ms to minimize.
[2024-06-01 05:54:58] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-06-01 05:54:58] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 4 ms to minimize.
[2024-06-01 05:54:58] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 4 ms to minimize.
[2024-06-01 05:55:01] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:55:03] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2024-06-01 05:55:04] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-01 05:55:04] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 3 ms to minimize.
[2024-06-01 05:55:04] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-06-01 05:55:04] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 3 ms to minimize.
[2024-06-01 05:55:05] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-06-01 05:55:05] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:55:05] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-06-01 05:55:05] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:55:05] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 4 ms to minimize.
[2024-06-01 05:55:06] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 05:55:06] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-06-01 05:55:06] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:55:06] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2024-06-01 05:55:07] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 4 ms to minimize.
[2024-06-01 05:55:07] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-06-01 05:55:07] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:55:07] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
[2024-06-01 05:55:07] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 4 ms to minimize.
[2024-06-01 05:55:08] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/450 variables, and 75 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/190 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:55:10] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:55:10] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:55:10] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:55:11] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:55:11] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 3 ms to minimize.
[2024-06-01 05:55:13] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:55:15] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 5 ms to minimize.
[2024-06-01 05:55:17] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 5 ms to minimize.
[2024-06-01 05:55:17] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 2 ms to minimize.
[2024-06-01 05:55:18] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-06-01 05:55:18] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-01 05:55:18] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:55:18] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 3 ms to minimize.
[2024-06-01 05:55:19] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-06-01 05:55:19] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:55:21] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:55:22] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-06-01 05:55:22] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2024-06-01 05:55:22] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 3 ms to minimize.
[2024-06-01 05:55:22] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-01 05:55:23] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 3 ms to minimize.
[2024-06-01 05:55:23] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 4 ms to minimize.
[2024-06-01 05:55:23] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
[2024-06-01 05:55:23] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 3 ms to minimize.
[2024-06-01 05:55:23] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 4 ms to minimize.
[2024-06-01 05:55:25] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:55:26] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:55:26] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
[2024-06-01 05:55:26] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 260/450 variables, 190/294 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 94/388 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 420/808 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 05:55:38] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 809 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 92/92 constraints]
After SMT, in 60558ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 424/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62183 ms. Remains : 190/196 places, 424/448 transitions.
Support contains 46 out of 190 places after structural reductions.
[2024-06-01 05:55:39] [INFO ] Flatten gal took : 123 ms
[2024-06-01 05:55:39] [INFO ] Flatten gal took : 63 ms
[2024-06-01 05:55:39] [INFO ] Input system was already deterministic with 424 transitions.
RANDOM walk for 40000 steps (8 resets) in 2213 ms. (18 steps per ms) remains 19/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
[2024-06-01 05:55:40] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-06-01 05:55:40] [INFO ] Invariant cache hit.
[2024-06-01 05:55:40] [INFO ] State equation strengthened by 94 read => feed constraints.
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 157/188 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/190 variables, 1/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:40] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-06-01 05:55:41] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-06-01 05:55:41] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 4 ms to minimize.
[2024-06-01 05:55:41] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:55:41] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 260/450 variables, 190/208 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 94/302 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 05:55:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 2/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 304 constraints, problems are : Problem set: 5 solved, 12 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 163/187 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:55:42] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 2/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/190 variables, 2/17 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 5/22 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 4 ms to minimize.
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 5/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 260/450 variables, 190/217 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 94/311 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 12/323 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:44] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 1/324 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:44] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:55:45] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/326 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:45] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-06-01 05:55:45] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 05:55:45] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:55:46] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 4/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 05:55:46] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 4 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/450 variables, 1/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 331 constraints, problems are : Problem set: 5 solved, 12 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 22/22 constraints]
After SMT, in 7007ms problems are : Problem set: 5 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 187 transition count 372
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 138 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 135 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 135 transition count 360
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 132 place count 124 transition count 349
Applied a total of 132 rules in 130 ms. Remains 124 /190 variables (removed 66) and now considering 349/424 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 124/190 places, 349/424 transitions.
RANDOM walk for 40000 steps (8 resets) in 673 ms. (59 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 560905 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :9 out of 11
Probabilistic random walk after 560905 steps, saw 114596 distinct states, run finished after 3007 ms. (steps per millisecond=186 ) properties seen :9
[2024-06-01 05:55:51] [INFO ] Flow matrix only has 185 transitions (discarded 164 similar events)
// Phase 1: matrix 185 rows 124 cols
[2024-06-01 05:55:51] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 05:55:51] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 22/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/190 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/235 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/239 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 70/309 variables, 49/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/309 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:55:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/162 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/190 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 45/235 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/239 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:55:52] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2024-06-01 05:55:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:55:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 70/309 variables, 49/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/309 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 905ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 466 ms.
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 349/349 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 124 transition count 345
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 120 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 117 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 117 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 116 transition count 332
Applied a total of 16 rules in 53 ms. Remains 116 /124 variables (removed 8) and now considering 332/349 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 116/124 places, 332/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 569655 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :1 out of 2
Probabilistic random walk after 569655 steps, saw 115254 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :1
[2024-06-01 05:55:56] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-06-01 05:55:56] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 05:55:56] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/156 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/184 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/224 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/228 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 56/284 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 47/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/284 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:55:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/156 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/184 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/224 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/228 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:55:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:55:56] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 56/284 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 47/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/284 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 22 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 116/116 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579761 steps, run visited all 1 properties in 1872 ms. (steps per millisecond=309 )
Probabilistic random walk after 579761 steps, saw 117258 distinct states, run finished after 1877 ms. (steps per millisecond=308 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(X(F(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 12 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-06-01 05:55:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 05:55:59] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 05:55:59] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 05:55:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:55:59] [INFO ] Invariant cache hit.
[2024-06-01 05:55:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:56:00] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 05:56:00] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:56:00] [INFO ] Invariant cache hit.
[2024-06-01 05:56:00] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:03] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:56:04] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 05:56:04] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 05:56:04] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 05:56:04] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-06-01 05:56:04] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:56:05] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:56:06] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-06-01 05:56:06] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2024-06-01 05:56:06] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2024-06-01 05:56:06] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:56:06] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-06-01 05:56:07] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 4 ms to minimize.
[2024-06-01 05:56:07] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:07] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 5 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 3 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 4 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
[2024-06-01 05:56:08] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 3 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 3 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 05:56:09] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 05:56:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:56:10] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:56:12] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-06-01 05:56:12] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-06-01 05:56:12] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-06-01 05:56:13] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:16] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:56:17] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:56:18] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:56:18] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:56:18] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-06-01 05:56:19] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 3 ms to minimize.
[2024-06-01 05:56:19] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 4 ms to minimize.
[2024-06-01 05:56:19] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:56:19] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-06-01 05:56:20] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-06-01 05:56:20] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-06-01 05:56:20] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:56:20] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:56:21] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-06-01 05:56:22] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-06-01 05:56:22] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:23] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:30] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(timeout
s156 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 71 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:31] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:56:32] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:56:32] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-06-01 05:56:35] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:36] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:56:38] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 4 ms to minimize.
[2024-06-01 05:56:38] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:41] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:56:42] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 2 ms to minimize.
[2024-06-01 05:56:44] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 236/420 variables, 184/265 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 76/341 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 396/737 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:56:54] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:56:55] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-06-01 05:56:55] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:56:55] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-06-01 05:56:56] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-06-01 05:56:57] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:56:57] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-01 05:56:57] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:56:59] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-06-01 05:56:59] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:56:59] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-06-01 05:57:00] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:57:00] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 3 ms to minimize.
[2024-06-01 05:57:00] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 751 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 82/82 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61341 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 472 reset in 552 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-00 finished in 62342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1&&(p2 U p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 11 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-06-01 05:57:01] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:57:01] [INFO ] Invariant cache hit.
[2024-06-01 05:57:01] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 05:57:01] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:57:01] [INFO ] Invariant cache hit.
[2024-06-01 05:57:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:57:02] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 05:57:02] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:57:02] [INFO ] Invariant cache hit.
[2024-06-01 05:57:02] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:05] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:57:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 4 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 3 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:57:07] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:57:08] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-01 05:57:08] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:57:08] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:08] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-06-01 05:57:08] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-06-01 05:57:09] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:09] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:57:09] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 05:57:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:57:10] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 4 ms to minimize.
[2024-06-01 05:57:10] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 4 ms to minimize.
[2024-06-01 05:57:10] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 3 ms to minimize.
[2024-06-01 05:57:10] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:11] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 4 ms to minimize.
[2024-06-01 05:57:11] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 4 ms to minimize.
[2024-06-01 05:57:11] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-06-01 05:57:11] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-06-01 05:57:11] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:57:12] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:57:12] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 4 ms to minimize.
[2024-06-01 05:57:12] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:57:12] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:57:14] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2024-06-01 05:57:14] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:57:15] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-06-01 05:57:15] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:18] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:19] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 3 ms to minimize.
[2024-06-01 05:57:20] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-06-01 05:57:20] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:57:20] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:57:21] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:57:21] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-06-01 05:57:21] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:57:21] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:57:21] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:57:22] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 05:57:22] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:57:22] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 6 ms to minimize.
[2024-06-01 05:57:23] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2024-06-01 05:57:23] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 4 ms to minimize.
[2024-06-01 05:57:23] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:25] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:31] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-06-01 05:57:31] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:57:31] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:34] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:57:34] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:57:34] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:34] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 3 ms to minimize.
[2024-06-01 05:57:35] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:57:35] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:57:35] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 3 ms to minimize.
[2024-06-01 05:57:35] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-06-01 05:57:35] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:57:36] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:57:37] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-06-01 05:57:38] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-06-01 05:57:38] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-06-01 05:57:38] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:57:38] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-06-01 05:57:39] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-06-01 05:57:39] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:57:40] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:57:50] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-06-01 05:57:51] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-01 05:57:53] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 4 ms to minimize.
[2024-06-01 05:57:54] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:57:55] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-06-01 05:57:55] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2024-06-01 05:57:56] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:57:57] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:57:59] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
[2024-06-01 05:57:59] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 3 ms to minimize.
[2024-06-01 05:57:59] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-06-01 05:58:00] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-06-01 05:58:00] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61111 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 1172 reset in 309 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-01 finished in 61728 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(G(p0))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 12 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-06-01 05:58:03] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:58:03] [INFO ] Invariant cache hit.
[2024-06-01 05:58:03] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 05:58:03] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:58:03] [INFO ] Invariant cache hit.
[2024-06-01 05:58:03] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:58:04] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 05:58:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:58:04] [INFO ] Invariant cache hit.
[2024-06-01 05:58:04] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:07] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 05:58:07] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 05:58:07] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:58:08] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 3 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-06-01 05:58:09] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:58:10] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-06-01 05:58:10] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 2 ms to minimize.
[2024-06-01 05:58:10] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 4 ms to minimize.
[2024-06-01 05:58:10] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:10] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:58:11] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:58:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:58:11] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 3 ms to minimize.
[2024-06-01 05:58:12] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-06-01 05:58:12] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 4 ms to minimize.
[2024-06-01 05:58:12] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-06-01 05:58:12] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-06-01 05:58:12] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 4 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-06-01 05:58:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:58:14] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:58:16] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-06-01 05:58:16] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-06-01 05:58:16] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-06-01 05:58:17] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:20] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:58:21] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-06-01 05:58:22] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-06-01 05:58:22] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2024-06-01 05:58:22] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-06-01 05:58:22] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-06-01 05:58:23] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-01 05:58:23] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2024-06-01 05:58:23] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 05:58:23] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-06-01 05:58:24] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-06-01 05:58:24] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:58:24] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:58:25] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:58:25] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-06-01 05:58:25] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:26] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:33] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2024-06-01 05:58:34] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-06-01 05:58:34] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:36] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-06-01 05:58:36] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
[2024-06-01 05:58:36] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-01 05:58:36] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:58:36] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:58:37] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:58:37] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 6 ms to minimize.
[2024-06-01 05:58:37] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
[2024-06-01 05:58:37] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-01 05:58:37] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:58:39] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-06-01 05:58:39] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-06-01 05:58:40] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:58:40] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-06-01 05:58:40] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 2 ms to minimize.
[2024-06-01 05:58:40] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:58:41] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 3 ms to minimize.
[2024-06-01 05:58:42] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:58:52] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-06-01 05:58:52] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 4 ms to minimize.
[2024-06-01 05:58:55] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 3 ms to minimize.
[2024-06-01 05:58:56] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:58:57] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
[2024-06-01 05:58:57] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-06-01 05:58:58] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-06-01 05:58:58] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-06-01 05:59:00] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:59:01] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 3 ms to minimize.
[2024-06-01 05:59:01] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:59:01] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-06-01 05:59:02] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61147 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 957765 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 957765 steps, saw 207767 distinct states, run finished after 3004 ms. (steps per millisecond=318 ) properties seen :0
[2024-06-01 05:59:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:59:08] [INFO ] Invariant cache hit.
[2024-06-01 05:59:08] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:59:09] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:59:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:59:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:59:09] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 43 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1813 ms. (steps per millisecond=319 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1814 ms. (steps per millisecond=319 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 05:59:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:59:12] [INFO ] Invariant cache hit.
[2024-06-01 05:59:12] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 05:59:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:59:12] [INFO ] Invariant cache hit.
[2024-06-01 05:59:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:59:13] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 05:59:13] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 05:59:13] [INFO ] Invariant cache hit.
[2024-06-01 05:59:13] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:16] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:59:16] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-06-01 05:59:16] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 3 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 3 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:59:18] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-06-01 05:59:19] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 2 ms to minimize.
[2024-06-01 05:59:19] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 3 ms to minimize.
[2024-06-01 05:59:19] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-06-01 05:59:19] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:20] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:59:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:59:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 5 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 05:59:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:59:23] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:59:25] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:59:25] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-06-01 05:59:26] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:59:26] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:29] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-06-01 05:59:30] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:59:31] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-06-01 05:59:31] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-06-01 05:59:32] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-01 05:59:32] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-06-01 05:59:32] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-06-01 05:59:32] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:59:32] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:59:33] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-06-01 05:59:33] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-01 05:59:33] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:59:33] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-06-01 05:59:34] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 3 ms to minimize.
[2024-06-01 05:59:35] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-06-01 05:59:35] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:36] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:43] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 71 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:44] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-06-01 05:59:44] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-06-01 05:59:45] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-06-01 05:59:48] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:49] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-06-01 05:59:50] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 4 ms to minimize.
[2024-06-01 05:59:50] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 05:59:54] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 3 ms to minimize.
[2024-06-01 05:59:55] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 3 ms to minimize.
[2024-06-01 05:59:57] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 236/420 variables, 184/265 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 76/341 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 396/737 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:00:08] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:00:08] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:00:09] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:00:09] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:00:09] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:00:10] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:00:11] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:00:11] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:00:13] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 746 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 77/77 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 61067 ms. Remains : 184/184 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 946165 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 946165 steps, saw 205407 distinct states, run finished after 3004 ms. (steps per millisecond=314 ) properties seen :0
[2024-06-01 06:00:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:00:16] [INFO ] Invariant cache hit.
[2024-06-01 06:00:16] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:00:17] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:00:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:00:17] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:00:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1022ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 34 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1687 ms. (steps per millisecond=343 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1687 ms. (steps per millisecond=343 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 4 place count 184 transition count 464
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 52 place count 184 transition count 464
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 184 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 180 transition count 460
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 180 transition count 460
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 76 rules in 78 ms. Remains 180 /184 variables (removed 4) and now considering 460/400 (removed -60) transitions.
[2024-06-01 06:00:21] [INFO ] Redundant transitions in 47 ms returned []
Running 456 sub problems to find dead transitions.
[2024-06-01 06:00:21] [INFO ] Flow matrix only has 264 transitions (discarded 196 similar events)
// Phase 1: matrix 264 rows 180 cols
[2024-06-01 06:00:21] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 06:00:21] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-01 06:00:24] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:00:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 5 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:00:27] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:00:27] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:00:27] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:28] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:00:28] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:00:28] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:00:28] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:00:29] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:00:29] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:00:29] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:00:30] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:00:31] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:00:31] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:00:31] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:00:32] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 12/45 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:37] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:00:37] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:00:37] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 3/48 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:40] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:00:40] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/50 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:44] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:00:44] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/52 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:49] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/53 constraints. Problems are: Problem set: 128 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/444 variables, and 53 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 128 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 40/41 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/41 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 64/180 variables, 8/49 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/53 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:00:56] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:00:56] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:00:56] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:00:57] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 4/57 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:01:00] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:01:00] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:01:00] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:01:00] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:01:01] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:01:01] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:01:01] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:01:01] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:01:02] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 4 ms to minimize.
[2024-06-01 06:01:02] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 10/67 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:01:05] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:01:05] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:01:05] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:01:05] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:01:05] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 5/72 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:01:09] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:01:09] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/74 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-06-01 06:01:12] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/75 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/75 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 11 (OVERLAPS) 264/444 variables, 180/255 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 119/374 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 328/702 constraints. Problems are: Problem set: 128 solved, 328 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 702 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 328/456 constraints, Known Traps: 62/62 constraints]
After SMT, in 60253ms problems are : Problem set: 128 solved, 328 unsolved
Search for dead transitions found 128 dead transitions in 60263ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 332/400 transitions.
Graph (complete) has 856 edges and 180 vertex of which 116 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.4 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 116 /180 variables (removed 64) and now considering 332/332 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/184 places, 332/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60427 ms. Remains : 116/184 places, 332/400 transitions.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 06:01:21] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 06:01:21] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 06:01:21] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 06:01:21] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:01:21] [INFO ] Invariant cache hit.
[2024-06-01 06:01:22] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:01:22] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:01:22] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:01:22] [INFO ] Invariant cache hit.
[2024-06-01 06:01:22] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:26] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:01:26] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:01:26] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:01:26] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:01:26] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:01:27] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:01:28] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:01:29] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:01:29] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:29] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:01:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:01:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:01:30] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:01:30] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:01:30] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:01:31] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:01:31] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:01:31] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 4 ms to minimize.
[2024-06-01 06:01:31] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:01:31] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:01:32] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:01:32] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:01:32] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:01:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:01:32] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:01:35] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:01:35] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:01:35] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:01:36] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:39] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:01:39] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:01:40] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:01:41] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:01:41] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:01:41] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:01:41] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:01:42] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:01:42] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:01:42] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:01:42] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:01:43] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 5 ms to minimize.
[2024-06-01 06:01:43] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:01:44] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:01:44] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:01:44] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:45] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:51] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:01:52] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:01:52] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:01:54] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:01:54] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:01:54] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:01:55] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:01:56] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 4 ms to minimize.
[2024-06-01 06:01:57] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:01:58] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:01:58] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:01:58] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:01:58] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:01:59] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:01:59] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:02:00] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:02:11] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:02:12] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:02:14] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:02:14] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:02:15] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:02:16] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:02:17] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:02:17] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:02:19] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-06-01 06:02:19] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:02:19] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:02:20] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:02:20] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 61235 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 259578 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(p0))&&F(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 186 transition count 370
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 136 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 131 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 131 transition count 350
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 338
Applied a total of 142 rules in 47 ms. Remains 119 /190 variables (removed 71) and now considering 338/424 (removed 86) transitions.
[2024-06-01 06:02:23] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
// Phase 1: matrix 174 rows 119 cols
[2024-06-01 06:02:23] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:02:23] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 06:02:23] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-06-01 06:02:23] [INFO ] Invariant cache hit.
[2024-06-01 06:02:23] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-01 06:02:23] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-06-01 06:02:23] [INFO ] Redundant transitions in 5 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-01 06:02:23] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-06-01 06:02:23] [INFO ] Invariant cache hit.
[2024-06-01 06:02:23] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:02:26] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:02:28] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:02:28] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:02:28] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:02:28] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:29] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:02:29] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:02:30] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:02:30] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:02:34] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:02:35] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:37] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:02:37] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:02:37] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:02:37] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:02:38] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:40] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:02:40] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:02:41] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:44] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:02:45] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:02:48] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:02:49] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:02:49] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:50] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:02:50] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:02:50] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:02:51] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:02:51] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:02:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:02:51] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:02:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:02:52] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:02:52] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:02:52] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:02:52] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/293 variables, and 80 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:56] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:02:59] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 174/293 variables, 119/201 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 79/280 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 334/614 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:03:06] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:03:08] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:03:09] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:03:09] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:03:09] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 06:03:16] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 620 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 75/75 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/190 places, 338/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60907 ms. Remains : 119/190 places, 338/424 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 219 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 61328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(!p1 U (X(!p2)||G(!p1))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 9 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-06-01 06:03:24] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 06:03:24] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 06:03:24] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 06:03:24] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:03:24] [INFO ] Invariant cache hit.
[2024-06-01 06:03:24] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:03:25] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:03:25] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:03:25] [INFO ] Invariant cache hit.
[2024-06-01 06:03:25] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 3 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 6 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 4 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:03:34] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:03:36] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:03:36] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:03:36] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:03:36] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:40] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:03:40] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:03:41] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:03:42] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:03:42] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:03:42] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-06-01 06:03:43] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 4 ms to minimize.
[2024-06-01 06:03:43] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:03:43] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:03:43] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:03:44] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:03:44] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:03:44] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:03:45] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:03:45] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:03:46] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:47] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:54] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 4 ms to minimize.
[2024-06-01 06:03:54] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:03:54] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:03:56] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:03:56] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:03:56] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:03:57] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 3 ms to minimize.
[2024-06-01 06:03:59] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:03:59] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:03:59] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:03:59] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:03:59] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:04:00] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:04:00] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:04:01] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:04:11] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:04:11] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:04:14] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:04:15] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:04:16] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:04:16] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:04:17] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-06-01 06:04:17] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:04:20] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:04:20] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:04:20] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 3 ms to minimize.
[2024-06-01 06:04:21] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:04:21] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61048 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, p2, (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 19018 reset in 289 ms.
Product exploration explored 100000 steps with 19109 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
[2024-06-01 06:04:26] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:04:26] [INFO ] Invariant cache hit.
[2024-06-01 06:04:26] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:04:27] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:04:28] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1367ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 1 resets, run visited all 2 properties in 8 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 17 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 500 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 220 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 06:04:29] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:04:29] [INFO ] Invariant cache hit.
[2024-06-01 06:04:29] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 06:04:29] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:04:29] [INFO ] Invariant cache hit.
[2024-06-01 06:04:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:04:30] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:04:30] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:04:30] [INFO ] Invariant cache hit.
[2024-06-01 06:04:30] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:04:33] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:04:33] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:04:33] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:04:34] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2024-06-01 06:04:34] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:04:34] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:04:34] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:04:35] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:04:37] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:04:37] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:04:37] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:04:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:04:38] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:04:38] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:04:38] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:04:38] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:04:39] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:04:39] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:04:39] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:04:39] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:04:39] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:04:40] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:04:40] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 4 ms to minimize.
[2024-06-01 06:04:40] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:04:40] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:04:43] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:04:43] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:04:43] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:04:44] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:04:47] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:04:48] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:04:49] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:04:49] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:04:49] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:04:49] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:04:50] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:04:50] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:04:50] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:04:51] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:04:51] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:04:51] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:04:51] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:04:52] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:04:53] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:04:53] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:04:54] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:05:01] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:05:01] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:05:01] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:05:02] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:05:02] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:05:02] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:05:02] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:05:02] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:05:03] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:05:06] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:05:06] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:05:07] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:05:08] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:05:21] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:05:21] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:05:22] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:05:22] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 4 ms to minimize.
[2024-06-01 06:05:22] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:05:22] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:05:22] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:05:23] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:05:23] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:05:23] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:05:26] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:05:26] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:05:26] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:05:26] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:05:27] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:05:28] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:05:28] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:05:28] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:05:29] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:05:29] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Finished structural reductions in LTL mode , in 1 iterations and 61181 ms. Remains : 184/184 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-06-01 06:05:31] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:05:31] [INFO ] Invariant cache hit.
[2024-06-01 06:05:31] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:05:31] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:05:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1353ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1592 steps, including 49 resets, run visited all 2 properties in 44 ms. (steps per millisecond=36 )
Parikh walk visited 2 properties in 44 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 385 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 220 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 216 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 19039 reset in 277 ms.
Product exploration explored 100000 steps with 19123 reset in 307 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 213 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 4 place count 184 transition count 462
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 51 place count 184 transition count 462
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 184 transition count 462
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 75 rules in 43 ms. Remains 180 /184 variables (removed 4) and now considering 458/400 (removed -58) transitions.
[2024-06-01 06:05:34] [INFO ] Redundant transitions in 8 ms returned []
Running 454 sub problems to find dead transitions.
[2024-06-01 06:05:34] [INFO ] Flow matrix only has 263 transitions (discarded 195 similar events)
// Phase 1: matrix 263 rows 180 cols
[2024-06-01 06:05:34] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 06:05:34] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 5 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 06:05:38] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:05:39] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:05:40] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:05:41] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:05:42] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:05:42] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:05:42] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:05:42] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:05:44] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:05:45] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 20/53 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:05:50] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:05:50] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:05:50] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:05:50] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:05:51] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:05:51] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:05:51] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:05:51] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:05:52] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:05:52] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 10/63 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:05:54] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:05:55] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:05:55] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:05:55] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:05:56] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:05:56] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:05:56] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:05:56] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 8/71 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:05:59] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/72 constraints. Problems are: Problem set: 125 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/443 variables, and 72 constraints, problems are : Problem set: 125 solved, 329 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/118 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 125 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 59/60 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/60 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 63/180 variables, 8/68 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/72 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:06:09] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:06:12] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 10/82 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/82 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 263/443 variables, 180/262 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 118/380 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 329/709 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/709 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-06-01 06:06:33] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 710 constraints, problems are : Problem set: 125 solved, 329 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 329/454 constraints, Known Traps: 70/70 constraints]
After SMT, in 60234ms problems are : Problem set: 125 solved, 329 unsolved
Search for dead transitions found 125 dead transitions in 60243ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 333/400 transitions.
Graph (complete) has 857 edges and 180 vertex of which 117 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 117 /180 variables (removed 63) and now considering 333/333 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/184 places, 333/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60319 ms. Remains : 117/184 places, 333/400 transitions.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 06:06:34] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 06:06:34] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 06:06:35] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 06:06:35] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:06:35] [INFO ] Invariant cache hit.
[2024-06-01 06:06:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:06:35] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:06:35] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:06:35] [INFO ] Invariant cache hit.
[2024-06-01 06:06:35] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:06:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:06:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:06:38] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:06:39] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:06:40] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:06:41] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:06:41] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:06:41] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:06:43] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:06:43] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 4 ms to minimize.
[2024-06-01 06:06:43] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:06:43] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:06:43] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:06:44] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:06:44] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 4 ms to minimize.
[2024-06-01 06:06:44] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:06:44] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:06:47] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:06:47] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:06:47] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:06:50] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:06:51] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:06:52] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:06:52] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:06:57] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:07:04] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:07:05] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:07:05] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:07:07] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:07:07] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:07:09] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:07:09] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:07:13] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:07:24] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:07:27] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:07:27] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:07:28] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:07:29] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:07:30] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:07:30] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 61097 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 251739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 29 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-06-01 06:07:36] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-06-01 06:07:36] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 06:07:36] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 06:07:36] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-06-01 06:07:36] [INFO ] Invariant cache hit.
[2024-06-01 06:07:36] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:07:36] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-06-01 06:07:36] [INFO ] Redundant transitions in 5 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-01 06:07:36] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-06-01 06:07:36] [INFO ] Invariant cache hit.
[2024-06-01 06:07:36] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:07:42] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:42] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:49] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:07:49] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:50] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:07:50] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:07:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:07:51] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:52] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:07:52] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:07:52] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:07:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:07:52] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:07:53] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:07:53] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:07:53] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:07:56] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:07:57] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:07:57] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:07:59] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:07:59] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 169/286 variables, 117/190 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 76/266 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:08:06] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:08:06] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:08:06] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:08:06] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:08:06] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/286 variables, and 271 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:08:08] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:08:08] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:08:09] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:08:09] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:08:09] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 169/286 variables, 117/200 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 76/276 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 329/605 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:08:19] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:08:20] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:08:25] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:08:28] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:08:28] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:08:29] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:08:35] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 612 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 77/77 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61022 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 61377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U (p2||F(p3))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 6 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-06-01 06:08:37] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-06-01 06:08:37] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 06:08:37] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 06:08:37] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-06-01 06:08:37] [INFO ] Invariant cache hit.
[2024-06-01 06:08:37] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-01 06:08:38] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 06:08:38] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-06-01 06:08:38] [INFO ] Invariant cache hit.
[2024-06-01 06:08:38] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:08:41] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:08:43] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 4 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:08:44] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 4 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:08:49] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:08:53] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:08:54] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:08:54] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:08:54] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:08:55] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:08:59] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:09:02] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:09:02] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:09:03] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:04] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:09:04] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:09:05] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:09:06] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 6 ms to minimize.
[2024-06-01 06:09:07] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:09:08] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:09:08] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30241ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30257ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31230 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 195 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-11 finished in 31723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 6 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-06-01 06:09:09] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-06-01 06:09:09] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:09:09] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 06:09:09] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-06-01 06:09:09] [INFO ] Invariant cache hit.
[2024-06-01 06:09:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-01 06:09:10] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 06:09:10] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-06-01 06:09:10] [INFO ] Invariant cache hit.
[2024-06-01 06:09:10] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:09:13] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:09:14] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:09:15] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 4 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:26] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:09:27] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:09:27] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:09:27] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:09:28] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:09:28] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:09:28] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:09:29] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:09:29] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:09:34] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:09:35] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:09:36] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:09:36] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:37] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:09:37] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/425 variables, and 78 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/185 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:41] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:47] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:09:47] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:09:50] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:09:50] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:51] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:09:51] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:09:51] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:09:53] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:09:53] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:09:55] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:09:55] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:09:55] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:09:56] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:09:57] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:09:58] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:09:58] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:09:58] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:09:59] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:10:03] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (OVERLAPS) 240/425 variables, 185/299 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 79/378 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 778 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 101/101 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61216 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-12 finished in 61358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 35 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-06-01 06:10:10] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-06-01 06:10:10] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:10:10] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 06:10:10] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-06-01 06:10:10] [INFO ] Invariant cache hit.
[2024-06-01 06:10:10] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:10:11] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-06-01 06:10:11] [INFO ] Redundant transitions in 1 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-01 06:10:11] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-06-01 06:10:11] [INFO ] Invariant cache hit.
[2024-06-01 06:10:11] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:12] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:10:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:10:12] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:10:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:10:16] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:24] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:27] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:30] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:10:30] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:32] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2024-06-01 06:10:33] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 06:10:35] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30770 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 31054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X(G(p1)))||G(p2)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 6 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-06-01 06:10:41] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 06:10:41] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:10:41] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 06:10:41] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:10:41] [INFO ] Invariant cache hit.
[2024-06-01 06:10:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:10:42] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:10:42] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:10:42] [INFO ] Invariant cache hit.
[2024-06-01 06:10:42] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:10:46] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:10:46] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:10:46] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:10:46] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:10:46] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:10:47] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:10:48] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:10:49] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:10:49] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:10:49] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:10:49] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:10:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:10:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:10:50] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:10:50] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 4 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 6 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 4 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:10:53] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:10:55] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:10:55] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:10:56] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:10:56] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:10:59] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:11:00] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:11:01] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:11:01] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:11:02] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:11:02] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:11:02] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:11:02] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:11:03] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:11:03] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:11:03] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:11:03] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:11:03] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:11:04] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:11:05] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 5 ms to minimize.
[2024-06-01 06:11:05] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:11:06] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:11:18] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:11:19] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:11:20] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:11:33] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:11:33] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:11:33] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:11:35] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 4 ms to minimize.
[2024-06-01 06:11:37] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:11:37] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:11:38] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:11:38] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:11:39] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:11:40] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:11:40] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-06-01 06:11:40] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:11:40] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:11:41] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61094 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 618 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 3535 reset in 249 ms.
Product exploration explored 100000 steps with 3503 reset in 296 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 139 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 537 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1004 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 755 ms. (52 steps per ms) remains 6/6 properties
[2024-06-01 06:11:45] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:11:45] [INFO ] Invariant cache hit.
[2024-06-01 06:11:45] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:11:45] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:11:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:11:47] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:11:47] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:11:47] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 37/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:11:48] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:11:48] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:11:48] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/375 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:11:48] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 45/420 variables, 39/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 31/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 292 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3451 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 4619ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2274 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 33 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 2012 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 623 ms. (steps per millisecond=94 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 624 ms. (steps per millisecond=94 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 522 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 06:11:55] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:11:55] [INFO ] Invariant cache hit.
[2024-06-01 06:11:56] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 06:11:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:11:56] [INFO ] Invariant cache hit.
[2024-06-01 06:11:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:11:56] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:11:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:11:56] [INFO ] Invariant cache hit.
[2024-06-01 06:11:56] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:12:15] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:12:15] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:12:15] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:12:16] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:12:16] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:12:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:12:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:12:17] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:12:17] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:12:17] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:12:17] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:12:18] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:12:19] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:12:19] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:20] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:12:32] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:12:33] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:34] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:12:35] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:12:47] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:12:47] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:12:47] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:12:47] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:12:49] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 4 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:12:54] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 60995 ms. Remains : 184/184 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1166 ms. (34 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
[2024-06-01 06:12:58] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:12:58] [INFO ] Invariant cache hit.
[2024-06-01 06:12:58] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 6 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 37/373 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 45/420 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 31/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 286 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 3092ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2003 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 27 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1181 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 813 ms. (steps per millisecond=72 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 815 ms. (steps per millisecond=72 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0))), (F p0)]
Knowledge based reduction with 8 factoid took 708 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1822 reset in 238 ms.
Product exploration explored 100000 steps with 1833 reset in 269 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 3 place count 184 transition count 462
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 50 place count 184 transition count 462
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 184 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 181 transition count 459
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 181 transition count 459
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 71 rules in 32 ms. Remains 181 /184 variables (removed 3) and now considering 459/400 (removed -59) transitions.
[2024-06-01 06:13:08] [INFO ] Redundant transitions in 5 ms returned []
Running 455 sub problems to find dead transitions.
[2024-06-01 06:13:08] [INFO ] Flow matrix only has 264 transitions (discarded 195 similar events)
// Phase 1: matrix 264 rows 181 cols
[2024-06-01 06:13:08] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 06:13:08] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/33 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:13:18] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:13:18] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/53 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/57 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:28] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:13:28] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 264/445 variables, 181/240 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 118/358 constraints. Problems are: Problem set: 124 solved, 331 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 (/ 3.0 4.0))
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 (/ 1.0 4.0))
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 358 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 124 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 46/47 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/47 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 62/181 variables, 8/55 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 4 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 7/66 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:48] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:13:48] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:13:49] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:13:49] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 4/70 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/72 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:13:57] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:13:57] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/75 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:14:00] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:14:00] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:14:01] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 3/78 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:14:03] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:14:03] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:14:04] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:14:04] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:14:04] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:14:04] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 6/84 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-06-01 06:14:08] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/445 variables, and 85 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/118 constraints, PredecessorRefiner: 0/455 constraints, Known Traps: 72/72 constraints]
After SMT, in 60238ms problems are : Problem set: 124 solved, 331 unsolved
Search for dead transitions found 124 dead transitions in 60246ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/184 places, 335/400 transitions.
Graph (complete) has 859 edges and 181 vertex of which 119 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.2 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 119 /181 variables (removed 62) and now considering 335/335 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/184 places, 335/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60305 ms. Remains : 119/184 places, 335/400 transitions.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 06:14:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-06-01 06:14:08] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:14:09] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 06:14:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:14:09] [INFO ] Invariant cache hit.
[2024-06-01 06:14:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:14:09] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-06-01 06:14:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-06-01 06:14:09] [INFO ] Invariant cache hit.
[2024-06-01 06:14:09] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:13] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:14:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:14:13] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:14:13] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:14:13] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:14:15] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:14:16] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:14:16] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:14:16] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:16] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:14:17] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:14:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:14:17] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:14:17] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 4 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:14:20] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:14:23] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:14:23] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:14:27] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:14:30] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:14:30] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:14:30] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:14:30] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:14:31] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:14:32] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:14:32] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:41] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:14:41] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:14:41] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:14:42] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:14:42] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:14:42] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:14:42] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:14:42] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:14:43] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:14:46] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:14:46] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:14:47] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-01 06:15:00] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:15:00] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:15:00] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:15:07] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:15:08] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:15:08] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:15:08] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in LTL mode , in 1 iterations and 60994 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 268305 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(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-04-LTLFireability-02
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 186 transition count 368
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 134 transition count 368
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 128 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 148 place count 116 transition count 332
Applied a total of 148 rules in 29 ms. Remains 116 /190 variables (removed 74) and now considering 332/424 (removed 92) transitions.
[2024-06-01 06:15:10] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-06-01 06:15:10] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 06:15:10] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 06:15:10] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:15:10] [INFO ] Invariant cache hit.
[2024-06-01 06:15:10] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:15:10] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 06:15:11] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:15:11] [INFO ] Invariant cache hit.
[2024-06-01 06:15:11] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:27] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:15:28] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:15:28] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:32] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:15:32] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:15:32] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:34] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:15:34] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:15:34] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:15:34] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:15:34] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:15:35] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:15:35] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:37] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:15:38] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/284 variables, and 68 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/116 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:45] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:15:45] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:15:45] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:15:45] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:47] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:15:48] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/210 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/286 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/614 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:16:03] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 616 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 83/83 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LI_LTL mode, iteration 1 : 116/190 places, 332/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60939 ms. Remains : 116/190 places, 332/424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1631 ms. (steps per millisecond=355 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1634 ms. (steps per millisecond=354 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 06:16:14] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:16:14] [INFO ] Invariant cache hit.
[2024-06-01 06:16:14] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 06:16:14] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:16:14] [INFO ] Invariant cache hit.
[2024-06-01 06:16:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:16:14] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 06:16:14] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:16:14] [INFO ] Invariant cache hit.
[2024-06-01 06:16:14] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:16:23] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:26] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2024-06-01 06:16:26] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:16:26] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:16:26] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:28] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:31] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:36] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:16:36] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:16:36] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:38] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:16:38] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:16:38] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:16:38] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:16:38] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:16:39] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:16:39] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:41] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:16:42] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/284 variables, and 68 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/116 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:46] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:16:54] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:16:54] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/210 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/286 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/614 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:17:08] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 616 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 83/83 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 116/116 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1750 ms. (steps per millisecond=331 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1751 ms. (steps per millisecond=331 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 234 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 06:17:18] [INFO ] Redundant transitions in 3 ms returned []
Running 328 sub problems to find dead transitions.
[2024-06-01 06:17:18] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:17:18] [INFO ] Invariant cache hit.
[2024-06-01 06:17:18] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:20] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:17:22] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:17:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:17:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:17:22] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:17:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:17:26] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:17:26] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:17:30] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:17:33] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:35] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:17:35] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:39] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:17:39] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:17:40] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 3 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:17:42] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:45] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:17:45] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/284 variables, and 68 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/116 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:50] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:17:55] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:17:58] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/210 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/286 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/614 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:09] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 616 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 83/83 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60210 ms. Remains : 116/116 places, 332/332 transitions.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 06:18:18] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:18:18] [INFO ] Invariant cache hit.
[2024-06-01 06:18:19] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 06:18:19] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:18:19] [INFO ] Invariant cache hit.
[2024-06-01 06:18:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:18:19] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 06:18:19] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-06-01 06:18:19] [INFO ] Invariant cache hit.
[2024-06-01 06:18:19] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:18:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:18:23] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:18:23] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:18:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:18:23] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:18:24] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:18:25] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:18:25] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:25] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:18:25] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:18:27] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:18:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:18:27] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:18:27] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:30] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:18:30] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:40] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:18:43] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:18:44] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:46] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:18:46] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/284 variables, and 68 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/116 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:51] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:18:59] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/210 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/286 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/614 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 06:19:11] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:19:13] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 616 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 83/83 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 116/116 places, 332/332 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 250044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(!p1 U (X(!p2)||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X(G(p1)))||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-04-LTLFireability-15
Stuttering acceptance computed with spot in 638 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 187 transition count 371
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 137 transition count 371
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 131 transition count 347
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 335
Applied a total of 142 rules in 24 ms. Remains 119 /190 variables (removed 71) and now considering 335/424 (removed 89) transitions.
[2024-06-01 06:19:21] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
// Phase 1: matrix 171 rows 119 cols
[2024-06-01 06:19:21] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 06:19:21] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 06:19:21] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:19:21] [INFO ] Invariant cache hit.
[2024-06-01 06:19:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:19:21] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-01 06:19:21] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:19:21] [INFO ] Invariant cache hit.
[2024-06-01 06:19:21] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:19:24] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:19:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:19:28] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:19:28] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:19:28] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:19:28] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:19:29] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:19:29] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:38] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:19:38] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:47] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:19:48] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 59 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 171/290 variables, 119/181 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 76/257 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 331/588 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 17/605 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:11] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:20:11] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:20:12] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:20:13] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:20:16] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:21] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 611 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 72/72 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LI_LTL mode, iteration 1 : 119/190 places, 335/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60949 ms. Remains : 119/190 places, 335/424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 5301 reset in 255 ms.
Product exploration explored 100000 steps with 5367 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 188 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 589 ms. (67 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
[2024-06-01 06:20:24] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:20:24] [INFO ] Invariant cache hit.
[2024-06-01 06:20:24] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/226 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 40/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/240 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 20/260 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/262 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 28/290 variables, 22/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/290 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/290 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/226 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/240 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/260 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/260 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/262 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/262 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/262 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/262 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/262 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/262 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/262 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 28/290 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/290 variables, 30/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/290 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 3595ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1233 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 119/119 places, 335/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 1604 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 750 ms. (steps per millisecond=78 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 751 ms. (steps per millisecond=78 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 525 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-06-01 06:20:32] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:20:32] [INFO ] Invariant cache hit.
[2024-06-01 06:20:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 06:20:32] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:20:32] [INFO ] Invariant cache hit.
[2024-06-01 06:20:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:20:33] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-01 06:20:33] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:20:33] [INFO ] Invariant cache hit.
[2024-06-01 06:20:33] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:38] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:20:38] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:20:39] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:20:39] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:20:39] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:20:39] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:20:40] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:20:40] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:20:44] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:20:44] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:46] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:20:46] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:49] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:20:49] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 59 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 171/290 variables, 119/181 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 76/257 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 331/588 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:13] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:21:13] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:21:17] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:21:18] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 17/605 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:21:25] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:21:26] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 610 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 71/71 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 119/119 places, 335/335 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 291 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1478 ms. (27 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 648 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 6/6 properties
[2024-06-01 06:21:35] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:21:35] [INFO ] Invariant cache hit.
[2024-06-01 06:21:35] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:21:35] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/226 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 40/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:21:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 14/240 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 20/260 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/262 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 28/290 variables, 22/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 210 constraints, problems are : Problem set: 0 solved, 6 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:21:36] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/226 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/240 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/260 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:21:36] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:21:36] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/260 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/262 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/262 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:21:37] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/262 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/262 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 28/290 variables, 22/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/290 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/290 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/290 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 220 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 2304ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 575 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 119/119 places, 335/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 1743 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 673 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 856 ms. (steps per millisecond=68 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 857 ms. (steps per millisecond=68 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0))), (F p0)]
Knowledge based reduction with 8 factoid took 630 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2800 reset in 242 ms.
Product exploration explored 100000 steps with 2795 reset in 266 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-06-01 06:21:43] [INFO ] Redundant transitions in 2 ms returned []
Running 331 sub problems to find dead transitions.
[2024-06-01 06:21:43] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:21:43] [INFO ] Invariant cache hit.
[2024-06-01 06:21:43] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:45] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:21:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:21:45] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 3 ms to minimize.
[2024-06-01 06:21:47] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:48] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:21:48] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:21:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:52] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:22:03] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:22:07] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:12] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 67 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:14] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 171/290 variables, 119/192 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 76/268 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 331/599 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:22:27] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:22:27] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:22:28] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:22:28] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:34] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 608 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 69/69 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60221 ms. Remains : 119/119 places, 335/335 transitions.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-06-01 06:22:43] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:22:43] [INFO ] Invariant cache hit.
[2024-06-01 06:22:43] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 06:22:43] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:22:43] [INFO ] Invariant cache hit.
[2024-06-01 06:22:43] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 06:22:44] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-01 06:22:44] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-06-01 06:22:44] [INFO ] Invariant cache hit.
[2024-06-01 06:22:44] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:22:48] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:22:49] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:22:51] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:22:51] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:22:51] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 1 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:23:08] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:10] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:23:10] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 59 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:16] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:23:16] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:23:16] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 171/290 variables, 119/181 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 76/257 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 331/588 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:23] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:23:23] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:23:23] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 7 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:23:24] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:23:25] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:23:25] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:23:25] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:23:25] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:23:26] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:23:26] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:23:27] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:23:27] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 17/605 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:34] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:23:34] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:23:35] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:23:35] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:23:39] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-01 06:23:43] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 611 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 72/72 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 119/119 places, 335/335 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 264183 ms.
[2024-06-01 06:23:44] [INFO ] Flatten gal took : 53 ms
[2024-06-01 06:23:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 06:23:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 424 transitions and 1856 arcs took 23 ms.
Total runtime 1748760 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223041251

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name EisenbergMcGuire-PT-04-LTLFireability-02
ltl formula formula --ltl=/tmp/9309/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 190 places, 424 transitions and 1856 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.070 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9309/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9309/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9309/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9309/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 191, there are 438 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1416 levels ~10000 states ~74740 transitions
pnml2lts-mc( 0/ 4): ~2617 levels ~20000 states ~149732 transitions
pnml2lts-mc( 0/ 4): ~4529 levels ~40000 states ~307524 transitions
pnml2lts-mc( 0/ 4): ~5413 levels ~80000 states ~662004 transitions
pnml2lts-mc( 0/ 4): ~5814 levels ~160000 states ~1308548 transitions
pnml2lts-mc( 2/ 4): ~7129 levels ~320000 states ~2757860 transitions
pnml2lts-mc( 2/ 4): ~7407 levels ~640000 states ~5628868 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~67!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1042190
pnml2lts-mc( 0/ 4): unique transitions count: 9122024
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 8113062
pnml2lts-mc( 0/ 4): - claim success count: 1044230
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1056332 states 9241724 transitions, fanout: 8.749
pnml2lts-mc( 0/ 4): Total exploration time 10.510 sec (10.500 sec minimum, 10.503 sec on average)
pnml2lts-mc( 0/ 4): States per second: 100507, Transitions per second: 879327
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.3MB, 9.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 427 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.3MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-04-LTLFireability-07
ltl formula formula --ltl=/tmp/9309/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 190 places, 424 transitions and 1856 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9309/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9309/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9309/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9309/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 191, there are 462 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( 3/ 4): ~536 levels ~10000 states ~41540 transitions
pnml2lts-mc( 3/ 4): ~536 levels ~20000 states ~81476 transitions
pnml2lts-mc( 0/ 4): ~544 levels ~40000 states ~155700 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~477!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20118
pnml2lts-mc( 0/ 4): unique states count: 40567
pnml2lts-mc( 0/ 4): unique transitions count: 158868
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19351
pnml2lts-mc( 0/ 4): - claim found count: 92591
pnml2lts-mc( 0/ 4): - claim success count: 40897
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2011
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40967 states 161500 transitions, fanout: 3.942
pnml2lts-mc( 0/ 4): Total exploration time 0.540 sec (0.540 sec minimum, 0.540 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75865, Transitions per second: 299074
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 10.5 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 427 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-04-LTLFireability-15
ltl formula formula --ltl=/tmp/9309/ltl_2_
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 190 places, 424 transitions and 1856 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.050 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9309/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9309/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9309/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9309/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 15 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 191, there are 1186 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1621 levels ~10000 states ~148596 transitions
pnml2lts-mc( 2/ 4): ~2627 levels ~20000 states ~298756 transitions
pnml2lts-mc( 2/ 4): ~4751 levels ~40000 states ~587220 transitions
pnml2lts-mc( 2/ 4): ~6476 levels ~80000 states ~1147492 transitions
pnml2lts-mc( 2/ 4): ~7642 levels ~160000 states ~1966164 transitions
pnml2lts-mc( 0/ 4): ~5800 levels ~320000 states ~3987380 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~5921!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21795
pnml2lts-mc( 0/ 4): unique states count: 339553
pnml2lts-mc( 0/ 4): unique transitions count: 4334612
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 333029
pnml2lts-mc( 0/ 4): - claim found count: 3397359
pnml2lts-mc( 0/ 4): - claim success count: 347971
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28398
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 349484 states 4423108 transitions, fanout: 12.656
pnml2lts-mc( 0/ 4): Total exploration time 4.200 sec (4.200 sec minimum, 4.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 83210, Transitions per second: 1053121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.2MB, 9.8 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 427 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.2MB (~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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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 r492-smll-171636266300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;