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.r355-tall-171683758100148.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 greatspnxred
Input is ShieldIIPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758100148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 426K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716913055147

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 16:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:17:36] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-28 16:17:36] [INFO ] Transformed 1253 places.
[2024-05-28 16:17:36] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:17:36] [INFO ] Found NUPN structural information;
[2024-05-28 16:17:36] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 82 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 102 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:17:36] [INFO ] Computed 451 invariants in 34 ms
[2024-05-28 16:17:37] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-05-28 16:17:37] [INFO ] Invariant cache hit.
[2024-05-28 16:17:39] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:17:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30038 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:18:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 28 ms to minimize.
[2024-05-28 16:18:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-28 16:18:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:18:32] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:18:32] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-28 16:18:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:18:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:18:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-28 16:18:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:18:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 15 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30026 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60759ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60788ms
Finished structural reductions in LTL mode , in 1 iterations and 63286 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 82 out of 1253 places after structural reductions.
[2024-05-28 16:18:40] [INFO ] Flatten gal took : 204 ms
[2024-05-28 16:18:40] [INFO ] Flatten gal took : 96 ms
[2024-05-28 16:18:40] [INFO ] Input system was already deterministic with 1203 transitions.
Reduction of identical properties reduced properties to check from 41 to 39
RANDOM walk for 34607 steps (10 resets) in 2276 ms. (15 steps per ms) remains 0/39 properties
Computed a total of 1 stabilizing places and 1 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(X(p0)) U !p0)) U (F(!p0)&&G(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 52 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:18:42] [INFO ] Invariant cache hit.
[2024-05-28 16:18:42] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-28 16:18:42] [INFO ] Invariant cache hit.
[2024-05-28 16:18:44] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:18:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30029 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 5 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:19:40] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 1)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 1)
(s741 0)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 1)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 1)
(s791 0)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 1)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 1)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 1)
(s812 0)
(s813 1)
(s814 0)
(s815 1)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 1)
(s837 0)
(s838 1)
(s839 0)
(s840 1)
(s841 0)
(s842 0)
(s843 1)
(s844 0)
(s845 0)
(s846 1)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 1)
(s853 1)
(s854 0)
(s855 1)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 1)
(s862 0)
(s863 1)
(s864 0)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 0)
(s870 0)
(s871 1)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 1)
(s878 1)
(s879 0)
(s880 1)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 1)
(s887 0)
(s888 1)
(s889 0)
(s890 1)
(s891 0)
(s892 0)
(s893 1)
(s894 0)
(s895 0)
(s896 1)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 1)
(s903 1)
(s904 0)
(s905 1)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 1)
(s912 0)
(s913 1)
(s914 0)
(s915 1)
(s916 0)
(s917 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1727 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30029 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 23/23 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 62681 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p1) p0), true, true, (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-00 finished in 63167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(X(F(p2))||(X(F(p0))&&p3)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:19:45] [INFO ] Invariant cache hit.
[2024-05-28 16:19:45] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-28 16:19:45] [INFO ] Invariant cache hit.
[2024-05-28 16:19:47] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30027 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 62452 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-01 finished in 62761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&G(p2))))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:20:47] [INFO ] Invariant cache hit.
[2024-05-28 16:20:48] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-28 16:20:48] [INFO ] Invariant cache hit.
[2024-05-28 16:20:49] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:20:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 timeout
1.0)
(s214 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30019 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:21:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:21:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:21:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:21:43] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:21:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:21:43] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:21:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:21:44] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:21:44] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:21:44] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:21:46] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:21:49] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:21:50] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 60463ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in LTL mode , in 1 iterations and 62404 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 10627 steps with 4 reset in 133 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-02 finished in 62787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 117 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:21:50] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:21:51] [INFO ] Implicit Places using invariants in 683 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 686 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 44 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 847 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-03
Product exploration explored 100000 steps with 52 reset in 956 ms.
Product exploration explored 100000 steps with 54 reset in 1096 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 6951 steps (0 resets) in 123 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:21:54] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:21:55] [INFO ] [Real]Absence check using 450 positive place invariants in 375 ms returned sat
[2024-05-28 16:21:58] [INFO ] [Real]Absence check using state equation in 3357 ms returned sat
[2024-05-28 16:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:21:59] [INFO ] [Nat]Absence check using 450 positive place invariants in 276 ms returned sat
[2024-05-28 16:22:02] [INFO ] [Nat]Absence check using state equation in 2811 ms returned sat
[2024-05-28 16:22:02] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-28 16:22:02] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 67 ms.
Could not prove EG (NOT p0)
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 46 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:22:13] [INFO ] Invariant cache hit.
[2024-05-28 16:22:14] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-28 16:22:14] [INFO ] Invariant cache hit.
[2024-05-28 16:22:15] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-05-28 16:22:16] [INFO ] Redundant transitions in 333 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:22:16] [INFO ] Computed 450 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 timeout
1.0)
(s558 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:23:11] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:23:11] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:23:11] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:23:12] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:23:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:23:16] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:23:16] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30023 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 23/23 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 46 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62844 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 8958 steps (0 resets) in 104 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-28 16:23:17] [INFO ] Invariant cache hit.
[2024-05-28 16:23:18] [INFO ] [Real]Absence check using 450 positive place invariants in 305 ms returned sat
[2024-05-28 16:23:21] [INFO ] [Real]Absence check using state equation in 3379 ms returned sat
[2024-05-28 16:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:23:22] [INFO ] [Nat]Absence check using 450 positive place invariants in 287 ms returned sat
[2024-05-28 16:23:26] [INFO ] [Nat]Absence check using state equation in 3511 ms returned sat
[2024-05-28 16:23:26] [INFO ] Computed and/alt/rep : 1102/3826/1102 causal constraints (skipped 97 transitions) in 74 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 52 reset in 842 ms.
Product exploration explored 100000 steps with 49 reset in 1013 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 45 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:23:38] [INFO ] Invariant cache hit.
[2024-05-28 16:23:39] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-28 16:23:39] [INFO ] Invariant cache hit.
[2024-05-28 16:23:40] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2024-05-28 16:23:40] [INFO ] Redundant transitions in 106 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:24:35] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:24:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:24:35] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:24:36] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:24:36] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:24:36] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:24:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:24:40] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:24:40] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 23/23 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62437 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-03 finished in 170439 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(((X(p0) U (p1 U p2))||G((p1||F(p3)))))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 71 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:24:41] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:24:41] [INFO ] Implicit Places using invariants in 678 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 681 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 783 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-04
Product exploration explored 100000 steps with 962 reset in 828 ms.
Product exploration explored 100000 steps with 956 reset in 1032 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 3927 steps (0 resets) in 82 ms. (47 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 11 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:24:44] [INFO ] Computed 450 invariants in 9 ms
[2024-05-28 16:24:45] [INFO ] [Real]Absence check using 450 positive place invariants in 337 ms returned sat
[2024-05-28 16:24:49] [INFO ] [Real]Absence check using state equation in 3492 ms returned sat
[2024-05-28 16:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:24:50] [INFO ] [Nat]Absence check using 450 positive place invariants in 239 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Nat]Absence check using state equation in 3485 ms returned sat
[2024-05-28 16:24:54] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 113 ms.
[2024-05-28 16:25:04] [INFO ] Added : 430 causal constraints over 86 iterations in 10285 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p3))
Support contains 5 out of 1250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 28 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:25:04] [INFO ] Invariant cache hit.
[2024-05-28 16:25:05] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-28 16:25:05] [INFO ] Invariant cache hit.
[2024-05-28 16:25:06] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2024-05-28 16:25:06] [INFO ] Redundant transitions in 180 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:25:06] [INFO ] Computed 450 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:26:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:26:00] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:26:00] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:26:00] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:26:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:26:01] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:26:01] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:26:03] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:26:07] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30027 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62704 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 4095 steps (0 resets) in 64 ms. (63 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 11 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
[2024-05-28 16:26:07] [INFO ] Invariant cache hit.
[2024-05-28 16:26:09] [INFO ] [Real]Absence check using 450 positive place invariants in 301 ms returned sat
[2024-05-28 16:26:12] [INFO ] [Real]Absence check using state equation in 3189 ms returned sat
[2024-05-28 16:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:26:13] [INFO ] [Nat]Absence check using 450 positive place invariants in 323 ms returned sat
[2024-05-28 16:26:16] [INFO ] [Nat]Absence check using state equation in 3079 ms returned sat
[2024-05-28 16:26:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:26:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:26:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2024-05-28 16:26:17] [INFO ] Computed and/alt/rep : 1102/3826/1102 causal constraints (skipped 97 transitions) in 61 ms.
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 990 reset in 848 ms.
Product exploration explored 100000 steps with 963 reset in 1009 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 26 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:26:29] [INFO ] Invariant cache hit.
[2024-05-28 16:26:29] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-28 16:26:29] [INFO ] Invariant cache hit.
[2024-05-28 16:26:31] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
[2024-05-28 16:26:31] [INFO ] Redundant transitions in 115 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:26:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:27:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:27:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:27:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:27:24] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:27:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:27:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:27:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:27:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:27:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:27:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:27:25] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:27:25] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:27:26] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:27:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:27:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:27:26] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 3 ms to minimize.
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:27:31] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
(s25 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30023 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62536 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-04 finished in 170811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(!p0)||(!p0&&G(F(!p2))))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 69 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:27:32] [INFO ] Computed 451 invariants in 7 ms
[2024-05-28 16:27:32] [INFO ] Implicit Places using invariants in 621 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 628 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 728 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-05
Stuttering criterion allowed to conclude after 29660 steps with 20 reset in 242 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-05 finished in 1224 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((X(G(((X(F(p3))&&p2)||p1)))&&p0))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:27:33] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:27:33] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-28 16:27:33] [INFO ] Invariant cache hit.
[2024-05-28 16:27:35] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:28:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:28:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:28:27] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:28:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:28:27] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:28:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:28:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:28:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:28:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:28:28] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:28:29] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:28:29] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:28:29] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:28:29] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:28:30] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:28:30] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:28:30] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:28:30] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:28:31] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:28:31] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:28:35] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in LTL mode , in 1 iterations and 62401 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-06 finished in 62615 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) U (p1||X(X(F(p2))))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 31 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:28:35] [INFO ] Invariant cache hit.
[2024-05-28 16:28:36] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-28 16:28:36] [INFO ] Invariant cache hit.
[2024-05-28 16:28:37] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30030 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:29:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:29:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:29:30] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:29:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:29:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:29:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:29:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:29:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:29:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:29:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:29:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:29:32] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:29:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:29:32] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:29:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:29:33] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:29:33] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:29:33] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:29:34] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:29:34] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:29:38] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Finished structural reductions in LTL mode , in 1 iterations and 62573 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-07
Product exploration explored 100000 steps with 1547 reset in 839 ms.
Product exploration explored 100000 steps with 1565 reset in 1020 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 212 steps (0 resets) in 8 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2024-05-28 16:29:41] [INFO ] Invariant cache hit.
[2024-05-28 16:29:42] [INFO ] [Real]Absence check using 451 positive place invariants in 287 ms returned sat
[2024-05-28 16:29:45] [INFO ] [Real]Absence check using state equation in 3194 ms returned sat
[2024-05-28 16:29:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:29:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 323 ms returned sat
[2024-05-28 16:29:50] [INFO ] [Nat]Absence check using state equation in 4165 ms returned sat
[2024-05-28 16:29:50] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 62 ms.
Could not prove EG (NOT p2)
Support contains 2 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:30:00] [INFO ] Invariant cache hit.
[2024-05-28 16:30:01] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-28 16:30:01] [INFO ] Invariant cache hit.
[2024-05-28 16:30:02] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:30:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30026 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 3 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:31:03] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 60455ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in LTL mode , in 1 iterations and 62555 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 252 steps (0 resets) in 9 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2024-05-28 16:31:03] [INFO ] Invariant cache hit.
[2024-05-28 16:31:04] [INFO ] [Real]Absence check using 451 positive place invariants in 275 ms returned sat
[2024-05-28 16:31:07] [INFO ] [Real]Absence check using state equation in 3036 ms returned sat
[2024-05-28 16:31:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:31:08] [INFO ] [Nat]Absence check using 451 positive place invariants in 319 ms returned sat
[2024-05-28 16:31:13] [INFO ] [Nat]Absence check using state equation in 4017 ms returned sat
[2024-05-28 16:31:13] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 61 ms.
[2024-05-28 16:31:22] [INFO ] Added : 410 causal constraints over 82 iterations in 9800 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1535 reset in 818 ms.
Product exploration explored 100000 steps with 1535 reset in 1000 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1253 transition count 1203
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 153 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:31:25] [INFO ] Redundant transitions in 117 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1201 sub problems to find dead transitions.
// Phase 1: matrix 1202 rows 1253 cols
[2024-05-28 16:31:25] [INFO ] Computed 451 invariants in 3 ms
[2024-05-28 16:31:25] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2455 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30025 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:32:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:32:20] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:32:20] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:32:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:32:21] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:32:21] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 3 ms to minimize.
[2024-05-28 16:32:21] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:32:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 60510ms, After SMT, problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1202/1203 transitions.
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 0 rules in 76 ms. Remains 1253 /1253 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60875 ms. Remains : 1253/1253 places, 1202/1203 transitions.
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 58 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:32:26] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:32:26] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-28 16:32:26] [INFO ] Invariant cache hit.
[2024-05-28 16:32:28] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:32:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
(s694 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30028 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:33:20] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:33:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:33:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:33:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:33:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:33:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:33:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:33:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:33:21] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:33:22] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:33:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:33:22] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:33:22] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:33:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:33:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:33:23] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 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 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30026 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in LTL mode , in 1 iterations and 62508 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-07 finished in 292768 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 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1252 transition count 1201
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 64 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:33:28] [INFO ] Computed 450 invariants in 3 ms
[2024-05-28 16:33:29] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-28 16:33:29] [INFO ] Invariant cache hit.
[2024-05-28 16:33:30] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
[2024-05-28 16:33:30] [INFO ] Redundant transitions in 119 ms returned [1194]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:33:30] [INFO ] Computed 450 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:33:55] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:33:55] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:33:55] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:33:56] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:33:56] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:33:56] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:00] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:34:00] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 22/1721 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:05] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-28 16:34:06] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:34:06] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:34:06] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:34:07] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:34:07] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 4 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:34:10] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:34:10] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 4 ms to minimize.
[2024-05-28 16:34:12] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:34:12] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:34:13] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:34:13] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1741 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:22] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:34:22] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:34:23] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 4 ms to minimize.
[2024-05-28 16:34:23] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 4 ms to minimize.
[2024-05-28 16:34:24] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 5 ms to minimize.
[2024-05-28 16:34:24] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 4 ms to minimize.
[2024-05-28 16:34:25] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62489 ms. Remains : 1249/1253 places, 1199/1203 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-08
Product exploration explored 100000 steps with 39 reset in 912 ms.
Product exploration explored 100000 steps with 39 reset in 1082 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 10912 steps (1 resets) in 169 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 26 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:34:33] [INFO ] Invariant cache hit.
[2024-05-28 16:34:34] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-28 16:34:34] [INFO ] Invariant cache hit.
[2024-05-28 16:34:35] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
[2024-05-28 16:34:35] [INFO ] Redundant transitions in 118 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:34:56] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:35:01] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:35:04] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:35:05] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:35:05] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:35:10] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:35:16] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:35:16] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:35:17] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:35:17] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:35:17] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:35:18] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:35:26] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:35:27] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
[2024-05-28 16:35:27] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 4 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:35:29] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62366 ms. Remains : 1249/1249 places, 1199/1199 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 12632 steps (1 resets) in 140 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 986 ms.
Product exploration explored 100000 steps with 39 reset in 1127 ms.
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 28 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:35:38] [INFO ] Invariant cache hit.
[2024-05-28 16:35:39] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 16:35:39] [INFO ] Invariant cache hit.
[2024-05-28 16:35:40] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2024-05-28 16:35:40] [INFO ] Redundant transitions in 125 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:36:04] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:36:04] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:36:04] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:36:05] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:36:05] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:36:05] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:36:05] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:36:06] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:36:09] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:36:10] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:36:10] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30042 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-28 16:36:17] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:36:17] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:36:17] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 4 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:36:23] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 4 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62301 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-08 finished in 192228 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 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(G(!p2)&&(p0 U (p1||G(p0))))))))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 15 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:36:40] [INFO ] Computed 451 invariants in 7 ms
[2024-05-28 16:36:41] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-28 16:36:41] [INFO ] Invariant cache hit.
[2024-05-28 16:36:42] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:37:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:37:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:37:39] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:37:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Finished structural reductions in LTL mode , in 1 iterations and 62401 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p0) (NOT p1)), p2, (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-09 finished in 62598 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(F(!p0))||(G(p1)&&X((G(F(!p0))||(F(!p0)&&G(F(p1)))))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:37:43] [INFO ] Invariant cache hit.
[2024-05-28 16:37:44] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-28 16:37:44] [INFO ] Invariant cache hit.
[2024-05-28 16:37:45] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:37:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30030 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:38:37] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:38:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:38:37] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:38:37] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:38:37] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:38:40] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:38:40] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:38:40] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:38:40] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 60431ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in LTL mode , in 1 iterations and 62468 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 229 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-10
Product exploration explored 100000 steps with 603 reset in 814 ms.
Product exploration explored 100000 steps with 615 reset in 1002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 13132 steps (4 resets) in 134 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 9 factoid took 278 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 235 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:38:49] [INFO ] Invariant cache hit.
[2024-05-28 16:38:49] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-05-28 16:38:49] [INFO ] Invariant cache hit.
[2024-05-28 16:38:51] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 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 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30027 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:39:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:39:42] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:39:45] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:39:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:39:45] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:39:45] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:39:47] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:39:50] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:39:51] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:39:51] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1727 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 23/23 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in LTL mode , in 1 iterations and 62340 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 20741 steps (7 resets) in 231 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 212 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 234 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 541 reset in 816 ms.
Product exploration explored 100000 steps with 564 reset in 993 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1253 transition count 1203
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 42 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:39:55] [INFO ] Redundant transitions in 108 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1201 sub problems to find dead transitions.
// Phase 1: matrix 1202 rows 1253 cols
[2024-05-28 16:39:55] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:39:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2455 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30020 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:40:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:40:47] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 4 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:40:52] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:40:52] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 15 places in 38 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 Int declared 1253/2455 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30023 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 21/21 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1202/1203 transitions.
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 0 rules in 33 ms. Remains 1253 /1253 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60598 ms. Remains : 1253/1253 places, 1202/1203 transitions.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 15 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:40:55] [INFO ] Computed 451 invariants in 2 ms
[2024-05-28 16:40:56] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-28 16:40:56] [INFO ] Invariant cache hit.
[2024-05-28 16:40:57] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:40:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:41:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:41:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:41:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:41:50] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:41:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:41:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:41:50] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:41:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:41:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:41:51] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:41:51] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:41:51] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:41:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:41:52] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:41:52] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:41:54] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30029 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in LTL mode , in 1 iterations and 62406 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-10 finished in 254779 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)&&(p1||F(p2)))))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:41:58] [INFO ] Invariant cache hit.
[2024-05-28 16:41:58] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-28 16:41:58] [INFO ] Invariant cache hit.
[2024-05-28 16:42:00] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:42:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:42:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:42:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:42:52] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:42:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:42:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:42:54] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:42:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:42:54] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:42:55] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:42:55] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:42:55] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30028 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Finished structural reductions in LTL mode , in 1 iterations and 62536 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2270 steps with 0 reset in 25 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-11 finished in 62800 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(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 58 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:43:01] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:43:01] [INFO ] Implicit Places using invariants in 664 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 665 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 750 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-12
Product exploration explored 100000 steps with 39 reset in 977 ms.
Product exploration explored 100000 steps with 39 reset in 1144 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (12 resets) in 511 ms. (78 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 2/2 properties
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:43:04] [INFO ] Computed 450 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1250 variables, 443/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 1225/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1201/2451 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2451/2451 variables, and 2950 constraints, problems are : Problem set: 0 solved, 2 unsolved in 696 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1250 variables, 443/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 1225/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:43:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:43:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:43:05] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:43:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 4/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1250 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1201/2451 variables, 1250/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2451 variables, 2/2956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:43:06] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:43:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:43:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2451 variables, 3/2959 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 1/2960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2451 variables, 2/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2451 variables, 0/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2451 variables, 0/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2451/2451 variables, and 2962 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2862 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 3581ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 11620 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 344 times.
Drop transitions (Partial Free agglomeration) removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 344 place count 1250 transition count 1201
Applied a total of 344 rules in 109 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1250/1250 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 1193 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 216430 steps, run timeout after 3025 ms. (steps per millisecond=71 ) properties seen :1 out of 2
Probabilistic random walk after 216430 steps, saw 206839 distinct states, run finished after 3029 ms. (steps per millisecond=71 ) properties seen :1
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:43:23] [INFO ] Computed 450 invariants in 69 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/1250 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1250 variables, 6/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1201/2451 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2451/2451 variables, and 2950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1244 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/1250 variables, 3/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 6/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1201/2451 variables, 1250/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2451 variables, 1/2954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:43:25] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:43:25] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:43:25] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:43:25] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:43:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2451 variables, 11/2965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2451 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2451 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2451/2451 variables, and 2965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2739 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 3414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2010 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1250/1250 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 563 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247826 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247826 steps, saw 236721 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-28 16:43:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/1250 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1250 variables, 6/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1201/2451 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2451/2451 variables, and 2950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 2/1693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1244 variables, 0/1693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/1250 variables, 3/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 6/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1250 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1201/2451 variables, 1250/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2451 variables, 1/2954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:43:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2451 variables, 13/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2451 variables, 0/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2451 variables, 0/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2451/2451 variables, and 2967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3093 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3766ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1796 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 25 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:43:37] [INFO ] Invariant cache hit.
[2024-05-28 16:43:38] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-28 16:43:38] [INFO ] Invariant cache hit.
[2024-05-28 16:43:40] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2024-05-28 16:43:40] [INFO ] Redundant transitions in 40 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 3/1252 constraints. Problems are: Problem set: 0 solved, 1200 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 1249/2451 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 3/1252 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 1/1250 variables, 447/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:44:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:44:37] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:44:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:44:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:44:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:44:37] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:44:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:44:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:44:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:44:39] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30029 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63166 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:44:41] [INFO ] Computed 450 invariants in 10 ms
[2024-05-28 16:44:42] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-28 16:44:42] [INFO ] Invariant cache hit.
[2024-05-28 16:44:43] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-05-28 16:44:43] [INFO ] Redundant transitions in 131 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:44:43] [INFO ] Computed 450 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:45:39] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:45:39] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:45:39] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:45:39] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:45:40] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30021 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62571 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (12 resets) in 1722 ms. (23 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
[2024-05-28 16:45:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1250 variables, 443/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 1225/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1200/2450 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2450/2450 variables, and 2950 constraints, problems are : Problem set: 0 solved, 2 unsolved in 696 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1250 variables, 443/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 1225/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 3/1703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1250 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1200/2450 variables, 1250/2953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2450 variables, 2/2955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2450 variables, 0/2955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2450 variables, 0/2955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2450/2450 variables, and 2955 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1474 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 2182ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 9753 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Partial Free-agglomeration rule applied 344 times.
Drop transitions (Partial Free agglomeration) removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 344 place count 1250 transition count 1200
Applied a total of 344 rules in 44 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1250/1250 places, 1200/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1032 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 223589 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :1 out of 2
Probabilistic random walk after 223589 steps, saw 213684 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :1
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:46:00] [INFO ] Computed 450 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/1250 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1250 variables, 6/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1200/2450 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2450/2450 variables, and 2950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 646 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:46:01] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:46:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1244 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/1250 variables, 3/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 6/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1200/2450 variables, 1250/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2450 variables, 1/2954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2450 variables, 12/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2450 variables, 1/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2450 variables, 0/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2450 variables, 0/2967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2450/2450 variables, and 2967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2951 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1582 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1250/1250 places, 1200/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 575 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256654 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256654 steps, saw 245085 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-28 16:46:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/1250 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1250 variables, 6/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1200/2450 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2450 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2450/2450 variables, and 2950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 595 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1219/1244 variables, 440/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1219/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:46:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 2/1693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1244 variables, 0/1693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/1250 variables, 3/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 6/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1250 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1200/2450 variables, 1250/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2450 variables, 1/2954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:10] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:46:10] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:46:11] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:46:11] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:46:11] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:46:11] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:46:11] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:46:12] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2450 variables, 20/2974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:46:14] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:46:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:46:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:46:14] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2450 variables, 6/2980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2450 variables, 0/2980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2450 variables, 0/2980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2450/2450 variables, and 2980 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5037 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 5641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2322 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 21 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:46:17] [INFO ] Invariant cache hit.
[2024-05-28 16:46:17] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-28 16:46:17] [INFO ] Invariant cache hit.
[2024-05-28 16:46:19] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2024-05-28 16:46:19] [INFO ] Redundant transitions in 49 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:46:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 3/1252 constraints. Problems are: Problem set: 0 solved, 1199 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 1249/2450 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30029 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 3/1252 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (OVERLAPS) 1/1250 variables, 447/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:47:13] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:47:13] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 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 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 447/447 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63011 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 39 reset in 883 ms.
Product exploration explored 100000 steps with 39 reset in 1068 ms.
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:47:22] [INFO ] Computed 450 invariants in 7 ms
[2024-05-28 16:47:23] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-28 16:47:23] [INFO ] Invariant cache hit.
[2024-05-28 16:47:24] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2024-05-28 16:47:24] [INFO ] Redundant transitions in 111 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:47:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
(s1037 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 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 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62552 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-12 finished in 324104 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((X(p0)||G(p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:48:25] [INFO ] Computed 451 invariants in 2 ms
[2024-05-28 16:48:25] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-28 16:48:25] [INFO ] Invariant cache hit.
[2024-05-28 16:48:27] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:48:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:49:24] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:49:24] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LTL mode , in 1 iterations and 62528 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1737 steps with 0 reset in 21 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-13 finished in 62805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||X(F(p0)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:49:27] [INFO ] Invariant cache hit.
[2024-05-28 16:49:28] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-28 16:49:28] [INFO ] Invariant cache hit.
[2024-05-28 16:49:29] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:49:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30023 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:50:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:50:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:50:24] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:50:24] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:50:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:50:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:50:25] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:50:25] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:50:26] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:50:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:50:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:50:27] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30031 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Finished structural reductions in LTL mode , in 1 iterations and 62503 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 2827 ms.
Product exploration explored 100000 steps with 33333 reset in 2954 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050A-LTLFireability-14 finished in 68399 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 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 50 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:50:36] [INFO ] Computed 451 invariants in 3 ms
[2024-05-28 16:50:36] [INFO ] Implicit Places using invariants in 661 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 662 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 734 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-15
Product exploration explored 100000 steps with 39 reset in 900 ms.
Product exploration explored 100000 steps with 39 reset in 1120 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 1471 steps (0 resets) in 27 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 28 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:50:39] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:50:40] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-28 16:50:40] [INFO ] Invariant cache hit.
[2024-05-28 16:50:41] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
[2024-05-28 16:50:41] [INFO ] Redundant transitions in 127 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:50:41] [INFO ] Computed 450 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30021 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62731 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 1497 steps (0 resets) in 21 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 893 ms.
Product exploration explored 100000 steps with 39 reset in 1121 ms.
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:51:44] [INFO ] Invariant cache hit.
[2024-05-28 16:51:45] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-28 16:51:45] [INFO ] Invariant cache hit.
[2024-05-28 16:51:46] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2024-05-28 16:51:46] [INFO ] Redundant transitions in 122 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:51:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30026 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:52:39] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:52:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:52:42] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:52:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:52:42] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:52:42] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30023 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62670 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-15 finished in 130978 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))'
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(((X(p0) U (p1 U p2))||G((p1||F(p3)))))))'
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) U (p1||X(X(F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(G(p1)&&X((G(F(!p0))||(F(!p0)&&G(F(p1)))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLFireability-10
Stuttering acceptance computed with spot in 288 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 50 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:52:48] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:52:48] [INFO ] Implicit Places using invariants in 658 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 672 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 747 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-10
Product exploration explored 100000 steps with 616 reset in 879 ms.
Product exploration explored 100000 steps with 610 reset in 1070 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 16369 steps (6 resets) in 166 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 213 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 20 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:52:51] [INFO ] Computed 450 invariants in 5 ms
[2024-05-28 16:52:52] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-28 16:52:52] [INFO ] Invariant cache hit.
[2024-05-28 16:52:53] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:53:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:53:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:53:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:53:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:53:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:53:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:53:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:53:48] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:53:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:53:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:53:48] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:53:49] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:53:49] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:53:49] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30030 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 62521 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 8705 steps (3 resets) in 131 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 9 factoid took 251 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 229 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 231 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 610 reset in 876 ms.
Product exploration explored 100000 steps with 644 reset in 1054 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:53:58] [INFO ] Redundant transitions in 128 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:53:58] [INFO ] Computed 450 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30028 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:54:51] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:54:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:54:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-28 16:54:51] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:54:52] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:54:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:54:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:54:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:54:53] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:54:53] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:54:53] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:54:53] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:54:54] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:54:54] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:54:54] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:54:54] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:54:55] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 1)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 1)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 1)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 1)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 1)
(s741 0)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 1)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)timeout

(s787 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60590 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 15 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:54:58] [INFO ] Computed 450 invariants in 2 ms
[2024-05-28 16:54:59] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-28 16:54:59] [INFO ] Invariant cache hit.
[2024-05-28 16:55:00] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:55:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 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 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30030 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:55:54] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:55:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:55:54] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:55:54] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:55:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:55:55] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:55:55] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:55:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
(s553 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in LTL mode , in 1 iterations and 62486 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-10 finished in 193503 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(((!p1 U (p2||G(!p1)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-28 16:56:01] [INFO ] Flatten gal took : 71 ms
[2024-05-28 16:56:01] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 16:56:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 9 ms.
Total runtime 2305149 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-050A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1253
TRANSITIONS: 1203
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.004s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 5197
MODEL NAME: /home/mcc/execution/413/model
1253 places, 1203 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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