MCC'2024- Execution of r528-tall-171683760400116

About the Execution of LTSMin+red for ShieldIIPs-PT-030A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1756.840	3258081.00	7297417.00	5163.80	T?FFF????TTF?TFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760400116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 15:01 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 253K 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-030A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717227274022

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:34:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:34:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:34:35] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-01 07:34:35] [INFO ] Transformed 753 places.
[2024-06-01 07:34:35] [INFO ] Transformed 723 transitions.
[2024-06-01 07:34:35] [INFO ] Found NUPN structural information;
[2024-06-01 07:34:35] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-030A-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 74 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:34:35] [INFO ] Computed 271 invariants in 31 ms
[2024-06-01 07:34:36] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 07:34:36] [INFO ] Invariant cache hit.
[2024-06-01 07:34:37] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:34:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 9 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 13 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1049 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30030 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 25/1049 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:35:19] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:35:19] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 6/1055 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 1/1056 constraints. Problems are: Problem set: 0 solved, 722 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 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/1476 variables, and 1056 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30033 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 0/722 constraints, Known Traps: 32/32 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 61926 ms. Remains : 753/753 places, 723/723 transitions.
Support contains 73 out of 753 places after structural reductions.
[2024-06-01 07:35:37] [INFO ] Flatten gal took : 144 ms
[2024-06-01 07:35:37] [INFO ] Flatten gal took : 69 ms
[2024-06-01 07:35:38] [INFO ] Input system was already deterministic with 723 transitions.
Reduction of identical properties reduced properties to check from 37 to 32
RANDOM walk for 39052 steps (23 resets) in 1476 ms. (26 steps per ms) remains 0/32 properties
FORMULA ShieldIIPs-PT-030A-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((G(F(p0))||((!p1||X(p2)) U p3))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 25 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:35:39] [INFO ] Invariant cache hit.
[2024-06-01 07:35:39] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 07:35:39] [INFO ] Invariant cache hit.
[2024-06-01 07:35:40] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 12 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30018 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:36:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30028 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in LTL mode , in 1 iterations and 61497 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-01
Product exploration explored 100000 steps with 314 reset in 727 ms.
Product exploration explored 100000 steps with 316 reset in 757 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 p3) p0 (NOT p1) p2), (X (NOT p3)), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 111 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (24 resets) in 614 ms. (65 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 3/3 properties
[2024-06-01 07:36:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/16 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 737/753 variables, 267/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 737/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1777 constraints, problems are : Problem set: 0 solved, 3 unsolved in 500 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/16 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 12/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 737/753 variables, 267/287 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 737/1024 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 3/1027 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/1027 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 723/1476 variables, 753/1780 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 1/1781 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 12/1793 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 0/1793 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1476 variables, 0/1793 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 1793 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2027 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 15/15 constraints]
After SMT, in 2538ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 210 place count 751 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 211 place count 750 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 212 place count 749 transition count 720
Applied a total of 212 rules in 193 ms. Remains 749 /753 variables (removed 4) and now considering 720/723 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 749/753 places, 720/723 transitions.
RANDOM walk for 30590 steps (7 resets) in 634 ms. (48 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (NOT p3)), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT p1))), (G (OR p3 p0)), (G (OR (NOT p1) p3 p0))]
False Knowledge obtained : [(F p3), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p3))), (F p1)]
Knowledge based reduction with 16 factoid took 294 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 21 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:36:47] [INFO ] Invariant cache hit.
[2024-06-01 07:36:47] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 07:36:47] [INFO ] Invariant cache hit.
[2024-06-01 07:36:48] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:37:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:37:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:37:14] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 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 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30024 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 61383 ms. Remains : 753/753 places, 723/723 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 p3) (NOT p1) p0 p2), (X (NOT p3)), (X (NOT (AND (NOT p3) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 89 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (24 resets) in 364 ms. (109 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
[2024-06-01 07:37:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/753 variables, 269/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 744/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/753 variables, 269/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 744/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:37:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 723/1476 variables, 753/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 1/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:37:49] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:37:50] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:37:50] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:37:50] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 4/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1476 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 1783 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1030 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 210 place count 751 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 211 place count 750 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 212 place count 749 transition count 720
Applied a total of 212 rules in 80 ms. Remains 749 /753 variables (removed 4) and now considering 720/723 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 749/753 places, 720/723 transitions.
RANDOM walk for 40000 steps (8 resets) in 700 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 76503 steps, run visited all 1 properties in 765 ms. (steps per millisecond=100 )
Probabilistic random walk after 76503 steps, saw 71364 distinct states, run finished after 769 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 p2), (X (NOT p3)), (X (NOT (AND (NOT p3) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p2))), (F p1), (F (NOT (OR (NOT p1) p3))), (F p3), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 248 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 289 reset in 603 ms.
Product exploration explored 100000 steps with 304 reset in 771 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 753 transition count 723
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 131 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:37:54] [INFO ] Redundant transitions in 104 ms returned [715]
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 721 sub problems to find dead transitions.
// Phase 1: matrix 722 rows 753 cols
[2024-06-01 07:37:54] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 07:37:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:38:20] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:38:20] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1475 variables, and 1053 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30023 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 5 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 3/1056 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1056 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 7 (OVERLAPS) 722/1475 variables, 753/1809 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1475 variables, 3/1812 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1475 variables, 719/2531 constraints. Problems are: Problem set: 2 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1475/1475 variables, and 2531 constraints, problems are : Problem set: 2 solved, 719 unsolved in 30029 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 719/721 constraints, Known Traps: 32/32 constraints]
After SMT, in 60221ms problems are : Problem set: 2 solved, 719 unsolved
Search for dead transitions found 2 dead transitions in 60228ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 753/753 places, 720/723 transitions.
Graph (complete) has 2639 edges and 753 vertex of which 751 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 38 ms. Remains 751 /753 variables (removed 2) and now considering 720/720 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 751/753 places, 720/723 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60521 ms. Remains : 751/753 places, 720/723 transitions.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 20 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:38:54] [INFO ] Computed 271 invariants in 7 ms
[2024-06-01 07:38:55] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 07:38:55] [INFO ] Invariant cache hit.
[2024-06-01 07:38:55] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:38:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:39:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:39:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:39:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:39:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:39:20] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:39:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:39:20] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:39:20] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:39:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:39:21] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:39:21] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:39:21] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:39:21] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:23] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:39:26] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
SMT process timed out in 30285ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30292ms
Finished structural reductions in LTL mode , in 1 iterations and 31432 ms. Remains : 753/753 places, 723/723 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-01 finished in 227295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((p0&&G(p1)))))))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 25 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:39:26] [INFO ] Invariant cache hit.
[2024-06-01 07:39:26] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-06-01 07:39:26] [INFO ] Invariant cache hit.
[2024-06-01 07:39:27] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:39:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:39:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:39:51] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:39:53] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:39:57] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:39:57] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30017 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30021 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Finished structural reductions in LTL mode , in 1 iterations and 61499 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-02
Stuttering criterion allowed to conclude after 1601 steps with 0 reset in 12 ms.
FORMULA ShieldIIPs-PT-030A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLFireability-02 finished in 61764 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||G(p2))))))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:40:28] [INFO ] Invariant cache hit.
[2024-06-01 07:40:28] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 07:40:28] [INFO ] Invariant cache hit.
[2024-06-01 07:40:29] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:40:55] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:40:57] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:40:57] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:40:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 4 ms to minimize.
SMT process timed out in 30294ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Finished structural reductions in LTL mode , in 1 iterations and 31390 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLFireability-03 finished in 31538 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((G(((p2&&X(p3))||p1))||p0)))'
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:40:59] [INFO ] Invariant cache hit.
[2024-06-01 07:40:59] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 07:40:59] [INFO ] Invariant cache hit.
[2024-06-01 07:41:00] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:41:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:41:26] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:41:28] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:41:28] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:41:28] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:41:29] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:41:29] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:41:29] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:41:29] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:41:30] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:41:30] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30014 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:41:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30017 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in LTL mode , in 1 iterations and 61306 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 9023 steps with 5 reset in 73 ms.
FORMULA ShieldIIPs-PT-030A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLFireability-04 finished in 61518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:42:01] [INFO ] Invariant cache hit.
[2024-06-01 07:42:01] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 07:42:01] [INFO ] Invariant cache hit.
[2024-06-01 07:42:02] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:42:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:42:27] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:42:27] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:42:29] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:42:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:42:30] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:42:30] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:42:30] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:42:30] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 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 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30018 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in LTL mode , in 1 iterations and 61277 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-05
Product exploration explored 100000 steps with 152 reset in 622 ms.
Product exploration explored 100000 steps with 151 reset in 717 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2486 steps (0 resets) in 23 ms. (103 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 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:43:04] [INFO ] Invariant cache hit.
[2024-06-01 07:43:04] [INFO ] [Real]Absence check using 271 positive place invariants in 133 ms returned sat
[2024-06-01 07:43:06] [INFO ] [Real]Absence check using state equation in 1372 ms returned sat
[2024-06-01 07:43:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:43:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 128 ms returned sat
[2024-06-01 07:43:08] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-06-01 07:43:08] [INFO ] Computed and/alt/rep : 664/2303/664 causal constraints (skipped 58 transitions) in 41 ms.
[2024-06-01 07:43:17] [INFO ] Added : 539 causal constraints over 109 iterations in 9440 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 36 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:43:17] [INFO ] Computed 271 invariants in 6 ms
[2024-06-01 07:43:18] [INFO ] Implicit Places using invariants in 400 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 750/753 places, 721/723 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 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2368 steps (0 resets) in 52 ms. (44 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 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 07:43:18] [INFO ] Computed 270 invariants in 4 ms
[2024-06-01 07:43:19] [INFO ] [Real]Absence check using 270 positive place invariants in 130 ms returned sat
[2024-06-01 07:43:20] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2024-06-01 07:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:43:20] [INFO ] [Nat]Absence check using 270 positive place invariants in 125 ms returned sat
[2024-06-01 07:43:21] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2024-06-01 07:43:22] [INFO ] Computed and/alt/rep : 662/2301/662 causal constraints (skipped 58 transitions) in 41 ms.
[2024-06-01 07:43:30] [INFO ] Added : 516 causal constraints over 104 iterations in 8059 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 149 reset in 626 ms.
Product exploration explored 100000 steps with 148 reset in 746 ms.
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 07:43:31] [INFO ] Invariant cache hit.
[2024-06-01 07:43:31] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-01 07:43:31] [INFO ] Invariant cache hit.
[2024-06-01 07:43:32] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-06-01 07:43:32] [INFO ] Redundant transitions in 70 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 07:43:32] [INFO ] Computed 270 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30019 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 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 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(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 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(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 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(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 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(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 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(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 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(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 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(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 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(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 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(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 1)
(s246 0)
(s247 0)
(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 1)
(s265 0)
(s266 0)
(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 1)
(s296 0)
(s297 0)
(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 1)
(s315 0)
(s316 0)
(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 1)
(s346 0)
(s347 0)
(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 1)
(s365 0)
(s366 0)
(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 1)
(s396 0)
(s397 0)
(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 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(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 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)timeout

(s445 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30019 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61439 ms. Remains : 750/750 places, 720/721 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-05 finished in 151936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 37 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:44:33] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 07:44:33] [INFO ] Implicit Places using invariants in 365 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 367 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 750/753 places, 721/723 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-06
Product exploration explored 100000 steps with 64 reset in 639 ms.
Product exploration explored 100000 steps with 64 reset in 757 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 6529 steps (1 resets) in 74 ms. (87 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 07:44:35] [INFO ] Computed 270 invariants in 4 ms
[2024-06-01 07:44:35] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-06-01 07:44:35] [INFO ] Invariant cache hit.
[2024-06-01 07:44:36] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2024-06-01 07:44:36] [INFO ] Redundant transitions in 71 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 07:44:36] [INFO ] Computed 270 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:44:58] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:44:58] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:45:02] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:45:04] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:45:04] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:45:04] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:45:05] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:45:05] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:45:05] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:45:05] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:45:06] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:45:06] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30018 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:45:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30014 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61450 ms. Remains : 750/750 places, 720/721 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 5203 steps (0 resets) in 68 ms. (75 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 64 reset in 609 ms.
Product exploration explored 100000 steps with 64 reset in 711 ms.
Support contains 5 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 720/720 transitions.
Applied a total of 0 rules in 12 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2024-06-01 07:45:39] [INFO ] Invariant cache hit.
[2024-06-01 07:45:39] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 07:45:39] [INFO ] Invariant cache hit.
[2024-06-01 07:45:40] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-06-01 07:45:40] [INFO ] Redundant transitions in 66 ms returned []
Running 719 sub problems to find dead transitions.
[2024-06-01 07:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30015 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:46:26] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30015 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61318 ms. Remains : 750/750 places, 720/720 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-06 finished in 127323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1 U p2))||(p3 U p4)))'
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 23 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:46:40] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 07:46:40] [INFO ] Implicit Places using invariants in 335 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 750/753 places, 721/723 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-07
Product exploration explored 100000 steps with 428 reset in 584 ms.
Product exploration explored 100000 steps with 429 reset in 679 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 p4) (NOT p3) (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p2) p1 (NOT p4) p3))), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p4) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) p3))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3))), (X (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) p3)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 45 factoid took 91 ms. Reduced automaton from 6 states, 18 edges and 5 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (24 resets) in 307 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 07:46:42] [INFO ] Computed 270 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 741/750 variables, 268/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 741/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 721/1471 variables, 750/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1471 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1471 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 741/750 variables, 268/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 741/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 2/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 721/1471 variables, 750/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1471 variables, 1/1773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 17/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1471 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1471 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2425 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2770ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 160 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 206 place count 750 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 207 place count 749 transition count 720
Applied a total of 207 rules in 38 ms. Remains 749 /750 variables (removed 1) and now considering 720/721 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 749/750 places, 720/721 transitions.
RANDOM walk for 26235 steps (5 resets) in 249 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p2) p1 (NOT p4) p3))), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p4) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) p3))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3))), (X (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) p3)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 45 factoid took 214 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 07:46:46] [INFO ] Invariant cache hit.
[2024-06-01 07:46:46] [INFO ] [Real]Absence check using 270 positive place invariants in 108 ms returned sat
[2024-06-01 07:46:47] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2024-06-01 07:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:46:48] [INFO ] [Nat]Absence check using 270 positive place invariants in 89 ms returned sat
[2024-06-01 07:46:49] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2024-06-01 07:46:49] [INFO ] Computed and/alt/rep : 662/2301/662 causal constraints (skipped 58 transitions) in 36 ms.
[2024-06-01 07:46:57] [INFO ] Added : 550 causal constraints over 110 iterations in 7885 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 750 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 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 07:46:57] [INFO ] Invariant cache hit.
[2024-06-01 07:46:57] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 07:46:57] [INFO ] Invariant cache hit.
[2024-06-01 07:46:58] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2024-06-01 07:46:58] [INFO ] Redundant transitions in 68 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 07:46:58] [INFO ] Computed 270 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30027 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:47:45] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 07:47:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61426 ms. Remains : 750/750 places, 720/721 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 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 119 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (24 resets) in 411 ms. (97 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2024-06-01 07:47:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 741/750 variables, 268/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 741/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:47:59] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 1/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 720/1470 variables, 750/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1470 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1470 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 1771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 741/750 variables, 268/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 741/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 1/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:47:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 2/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 720/1470 variables, 750/1773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 1/1774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1470 variables, 8/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1470 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1470 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1470/1470 variables, and 1782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1245 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1734ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 720/720 transitions.
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 206 place count 750 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 207 place count 749 transition count 719
Applied a total of 207 rules in 40 ms. Remains 749 /750 variables (removed 1) and now considering 719/720 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 749/750 places, 719/720 transitions.
RANDOM walk for 37776 steps (8 resets) in 427 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 13 factoid took 296 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 07:48:02] [INFO ] Invariant cache hit.
[2024-06-01 07:48:02] [INFO ] [Real]Absence check using 270 positive place invariants in 107 ms returned sat
[2024-06-01 07:48:03] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2024-06-01 07:48:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:48:04] [INFO ] [Nat]Absence check using 270 positive place invariants in 88 ms returned sat
[2024-06-01 07:48:05] [INFO ] [Nat]Absence check using state equation in 1183 ms returned sat
[2024-06-01 07:48:05] [INFO ] Computed and/alt/rep : 662/2306/662 causal constraints (skipped 57 transitions) in 42 ms.
[2024-06-01 07:48:13] [INFO ] Added : 505 causal constraints over 103 iterations in 8438 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 428 reset in 579 ms.
Product exploration explored 100000 steps with 436 reset in 678 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 720/720 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 749 /750 variables (removed 1) and now considering 719/720 (removed 1) transitions.
// Phase 1: matrix 719 rows 749 cols
[2024-06-01 07:48:15] [INFO ] Computed 270 invariants in 5 ms
[2024-06-01 07:48:15] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 07:48:15] [INFO ] Invariant cache hit.
[2024-06-01 07:48:16] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2024-06-01 07:48:16] [INFO ] Redundant transitions in 66 ms returned []
Running 718 sub problems to find dead transitions.
[2024-06-01 07:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:48:25] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:48:25] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:48:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:48:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:48:25] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:48:26] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:48:26] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:48:26] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:48:26] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:48:26] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:48:27] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:48:27] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 20/1039 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:48:29] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:48:29] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:48:29] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:48:30] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:48:30] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:48:30] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:48:30] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:48:31] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:48:31] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:48:37] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/1468 variables, and 1049 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30014 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 30/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 719/1468 variables, 749/1798 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 718/2516 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:49:05] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:49:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:49:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:49:08] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:49:08] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:49:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:49:09] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 2526 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30025 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 749/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 40/40 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61263 ms. Remains : 749/750 places, 719/720 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-07 finished in 156272 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((X(p0)||F(!p1))) U p2))'
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:49:16] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 07:49:16] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 07:49:16] [INFO ] Invariant cache hit.
[2024-06-01 07:49:17] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:49:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 6 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:49:46] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:49:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:49:46] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30019 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:50:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30028 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 61326 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-08
Product exploration explored 100000 steps with 227 reset in 588 ms.
Product exploration explored 100000 steps with 234 reset in 698 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
RANDOM walk for 10435 steps (4 resets) in 88 ms. (117 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 272 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
[2024-06-01 07:50:20] [INFO ] Invariant cache hit.
[2024-06-01 07:50:20] [INFO ] [Real]Absence check using 271 positive place invariants in 131 ms returned sat
[2024-06-01 07:50:21] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2024-06-01 07:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:50:22] [INFO ] [Nat]Absence check using 271 positive place invariants in 121 ms returned sat
[2024-06-01 07:50:23] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2024-06-01 07:50:24] [INFO ] Computed and/alt/rep : 664/2303/664 causal constraints (skipped 58 transitions) in 36 ms.
[2024-06-01 07:50:32] [INFO ] Added : 499 causal constraints over 100 iterations in 8459 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:50:32] [INFO ] Invariant cache hit.
[2024-06-01 07:50:32] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 07:50:32] [INFO ] Invariant cache hit.
[2024-06-01 07:50:33] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:50:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:50:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:50:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:50:55] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:51:03] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 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 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30019 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:51:20] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30026 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in LTL mode , in 1 iterations and 61284 ms. Remains : 753/753 places, 723/723 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
RANDOM walk for 10971 steps (4 resets) in 95 ms. (114 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 254 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
[2024-06-01 07:51:34] [INFO ] Invariant cache hit.
[2024-06-01 07:51:35] [INFO ] [Real]Absence check using 271 positive place invariants in 131 ms returned sat
[2024-06-01 07:51:36] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2024-06-01 07:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:51:36] [INFO ] [Nat]Absence check using 271 positive place invariants in 124 ms returned sat
[2024-06-01 07:51:38] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2024-06-01 07:51:38] [INFO ] Computed and/alt/rep : 664/2303/664 causal constraints (skipped 58 transitions) in 36 ms.
[2024-06-01 07:51:46] [INFO ] Added : 499 causal constraints over 100 iterations in 8190 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 224 reset in 597 ms.
Product exploration explored 100000 steps with 233 reset in 693 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 753 transition count 723
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:51:48] [INFO ] Redundant transitions in 69 ms returned [715]
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 721 sub problems to find dead transitions.
// Phase 1: matrix 722 rows 753 cols
[2024-06-01 07:51:48] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 07:51:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:52:11] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:52:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:52:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:52:13] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:52:13] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:52:17] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:52:17] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:52:17] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:52:17] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:52:18] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:52:18] [INFO ] Deduced a trap composed of 2 places in 143 ms of which 4 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 753/753 places, 722/723 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30282 ms. Remains : 753/753 places, 722/723 transitions.
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:52:18] [INFO ] Computed 271 invariants in 4 ms
[2024-06-01 07:52:18] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 07:52:18] [INFO ] Invariant cache hit.
[2024-06-01 07:52:19] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:52:42] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:52:42] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:52:42] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:52:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:52:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:52:43] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:52:45] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:52:45] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:52:45] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 30275ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30281ms
Finished structural reductions in LTL mode , in 1 iterations and 31387 ms. Remains : 753/753 places, 723/723 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-08 finished in 213235 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(p0)&&(X((!p1||F(!p2))) U ((!p2&&X((!p1||F(!p2))))||X(G((!p1||F(!p2)))))))))'
Support contains 9 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:52:49] [INFO ] Invariant cache hit.
[2024-06-01 07:52:50] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 07:52:50] [INFO ] Invariant cache hit.
[2024-06-01 07:52:50] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:52:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:53:14] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:53:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:53:16] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:53:16] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:53:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:53:16] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:53:17] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:53:17] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:53:17] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:53:19] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:53:21] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1050 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30022 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 26/1050 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:53:29] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 5/1055 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1808 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2530 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2530 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30018 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 31/31 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in LTL mode , in 1 iterations and 61315 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (NOT p0), (AND p2 p1), (AND p2 p1), true, p2, (AND p2 p1)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 1528 ms.
Product exploration explored 100000 steps with 33333 reset in 1583 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-030A-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030A-LTLFireability-09 finished in 64753 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(X(X((!(G((p0 U p1)) U (p0 U G(p2)))&&p3)))))'
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:53:54] [INFO ] Invariant cache hit.
[2024-06-01 07:53:54] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-06-01 07:53:54] [INFO ] Invariant cache hit.
[2024-06-01 07:53:55] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:54:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:54:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:54:20] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:54:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:54:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:54:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:54:20] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:54:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:54:21] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:54:23] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:54:23] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30015 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30028 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in LTL mode , in 1 iterations and 61326 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (NOT p3) p2), p2, (AND p1 p2), p2, (AND p1 p2)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 1521 ms.
Product exploration explored 100000 steps with 33333 reset in 1583 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 p3 (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p3 p0) (AND p3 p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-030A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030A-LTLFireability-10 finished in 64778 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((G(p0)||X(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:54:59] [INFO ] Invariant cache hit.
[2024-06-01 07:54:59] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 07:54:59] [INFO ] Invariant cache hit.
[2024-06-01 07:55:00] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:55:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:55:26] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:55:29] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:55:29] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:55:29] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30017 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:55:47] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30026 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 61313 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-12
Product exploration explored 100000 steps with 143 reset in 619 ms.
Product exploration explored 100000 steps with 141 reset in 710 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 p0 (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4953 steps (0 resets) in 55 ms. (88 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:56:02] [INFO ] Invariant cache hit.
[2024-06-01 07:56:03] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 07:56:03] [INFO ] Invariant cache hit.
[2024-06-01 07:56:03] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:56:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:56:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:56:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:56:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1052 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30016 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 28/1052 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:56:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:56:45] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:56:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 3/1055 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1808 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2530 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2530 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30021 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 31/31 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 61261 ms. Remains : 753/753 places, 723/723 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) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5093 steps (0 resets) in 55 ms. (90 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 141 reset in 609 ms.
Product exploration explored 100000 steps with 142 reset in 718 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 753 transition count 723
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 20 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:57:06] [INFO ] Redundant transitions in 69 ms returned [715]
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 721 sub problems to find dead transitions.
// Phase 1: matrix 722 rows 753 cols
[2024-06-01 07:57:06] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 07:57:06] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:57:30] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:57:31] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:57:31] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:57:31] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:57:31] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:57:36] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:57:36] [INFO ] Deduced a trap composed of 2 places in 136 ms of which 3 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 07:57:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
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 753/1475 variables, and 1055 constraints, problems are : Problem set: 2 solved, 719 unsolved in 30015 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 2 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 750/750 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 0/750 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 3/753 variables, 271/1021 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 3/1024 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 31/1055 constraints. Problems are: Problem set: 2 solved, 719 unsolved
[2024-06-01 07:57:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1056 constraints. Problems are: Problem set: 2 solved, 719 unsolved
[2024-06-01 07:57:53] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 1/1057 constraints. Problems are: Problem set: 2 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/1475 variables, and 1057 constraints, problems are : Problem set: 2 solved, 719 unsolved in 30013 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/721 constraints, Known Traps: 33/33 constraints]
After SMT, in 60178ms problems are : Problem set: 2 solved, 719 unsolved
Search for dead transitions found 2 dead transitions in 60184ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 753/753 places, 720/723 transitions.
Graph (complete) has 2639 edges and 753 vertex of which 751 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 751 /753 variables (removed 2) and now considering 720/720 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 751/753 places, 720/723 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60296 ms. Remains : 751/753 places, 720/723 transitions.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 6 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:58:06] [INFO ] Computed 271 invariants in 4 ms
[2024-06-01 07:58:06] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 07:58:06] [INFO ] Invariant cache hit.
[2024-06-01 07:58:07] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:58:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:58:31] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30261ms
Finished structural reductions in LTL mode , in 1 iterations and 31344 ms. Remains : 753/753 places, 723/723 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-12 finished in 218631 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((X(X(p0))||G((G(p2)||p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 6 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:58:38] [INFO ] Invariant cache hit.
[2024-06-01 07:58:38] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 07:58:38] [INFO ] Invariant cache hit.
[2024-06-01 07:58:39] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30014 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30026 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in LTL mode , in 1 iterations and 61267 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-14
Product exploration explored 100000 steps with 19999 reset in 1132 ms.
Product exploration explored 100000 steps with 20032 reset in 1229 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 p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 10 states, 22 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (24 resets) in 390 ms. (102 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
[2024-06-01 07:59:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 742/753 variables, 268/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 742/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 3/1476 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Domain max(s): 3/753 constraints, Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 14 factoid took 230 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-030A-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030A-LTLFireability-14 finished in 65074 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(F(p0))||((!p1||X(p2)) U 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(F(p0)))'
Found a Shortening insensitive property : ShieldIIPs-PT-030A-LTLFireability-05
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 36 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:59:43] [INFO ] Computed 271 invariants in 5 ms
[2024-06-01 07:59:43] [INFO ] Implicit Places using invariants in 357 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 358 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 405 ms. Remains : 750/753 places, 721/723 transitions.
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-05
Product exploration explored 100000 steps with 144 reset in 597 ms.
Product exploration explored 100000 steps with 153 reset in 707 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2858 steps (0 resets) in 32 ms. (86 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 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 07:59:45] [INFO ] Computed 270 invariants in 2 ms
[2024-06-01 07:59:46] [INFO ] [Real]Absence check using 270 positive place invariants in 126 ms returned sat
[2024-06-01 07:59:47] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2024-06-01 07:59:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:59:47] [INFO ] [Nat]Absence check using 270 positive place invariants in 124 ms returned sat
[2024-06-01 07:59:48] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2024-06-01 07:59:49] [INFO ] Computed and/alt/rep : 662/2301/662 causal constraints (skipped 58 transitions) in 35 ms.
[2024-06-01 07:59:57] [INFO ] Added : 516 causal constraints over 104 iterations in 7990 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 13 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 07:59:57] [INFO ] Invariant cache hit.
[2024-06-01 07:59:57] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 07:59:57] [INFO ] Invariant cache hit.
[2024-06-01 07:59:58] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2024-06-01 07:59:58] [INFO ] Redundant transitions in 67 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 07:59:58] [INFO ] Computed 270 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:00:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:00:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:00:22] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:00:22] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:00:22] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:00:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:00:22] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:00:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:00:23] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:00:25] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:00:25] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:00:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:00:26] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 08:00:26] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:00:26] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:00:27] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:00:27] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:00:27] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
(s621 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 0.0timeout
)
(s622 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30024 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:00:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:00:47] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 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 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 28 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61383 ms. Remains : 750/750 places, 720/721 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 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1949 steps (0 resets) in 23 ms. (81 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 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:00:58] [INFO ] Invariant cache hit.
[2024-06-01 08:00:59] [INFO ] [Real]Absence check using 270 positive place invariants in 124 ms returned sat
[2024-06-01 08:01:00] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2024-06-01 08:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:01:01] [INFO ] [Nat]Absence check using 270 positive place invariants in 129 ms returned sat
[2024-06-01 08:01:02] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-01 08:01:02] [INFO ] Computed and/alt/rep : 662/2306/662 causal constraints (skipped 57 transitions) in 37 ms.
[2024-06-01 08:01:11] [INFO ] Added : 567 causal constraints over 115 iterations in 9503 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 150 reset in 598 ms.
Product exploration explored 100000 steps with 149 reset in 715 ms.
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 720/720 transitions.
Applied a total of 0 rules in 11 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2024-06-01 08:01:13] [INFO ] Invariant cache hit.
[2024-06-01 08:01:13] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-06-01 08:01:13] [INFO ] Invariant cache hit.
[2024-06-01 08:01:14] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2024-06-01 08:01:14] [INFO ] Redundant transitions in 66 ms returned []
Running 719 sub problems to find dead transitions.
[2024-06-01 08:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:01:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:01:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:01:37] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:01:38] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:01:38] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:01:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:01:38] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:01:38] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:01:39] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:01:41] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:01:41] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:01:41] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-06-01 08:01:42] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:01:42] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:01:42] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:01:42] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:01:43] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 08:01:43] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30018 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:02:00] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 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 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(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 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(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 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(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 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(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 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(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 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61308 ms. Remains : 750/750 places, 720/720 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-05 finished in 151301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1 U p2))||(p3 U p4)))'
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((X(p0)||F(!p1))) U p2))'
Found a Lengthening insensitive property : ShieldIIPs-PT-030A-LTLFireability-08
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 26 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 08:02:14] [INFO ] Computed 271 invariants in 4 ms
[2024-06-01 08:02:15] [INFO ] Implicit Places using invariants in 357 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 358 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 394 ms. Remains : 750/753 places, 721/723 transitions.
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-08
Product exploration explored 100000 steps with 239 reset in 584 ms.
Product exploration explored 100000 steps with 237 reset in 690 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
RANDOM walk for 12121 steps (5 resets) in 96 ms. (124 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 08:02:17] [INFO ] Computed 270 invariants in 1 ms
[2024-06-01 08:02:18] [INFO ] [Real]Absence check using 270 positive place invariants in 150 ms returned sat
[2024-06-01 08:02:19] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2024-06-01 08:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:02:19] [INFO ] [Nat]Absence check using 270 positive place invariants in 130 ms returned sat
[2024-06-01 08:02:21] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2024-06-01 08:02:21] [INFO ] Computed and/alt/rep : 662/2301/662 causal constraints (skipped 58 transitions) in 34 ms.
[2024-06-01 08:02:30] [INFO ] Added : 546 causal constraints over 110 iterations in 9367 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 08:02:30] [INFO ] Invariant cache hit.
[2024-06-01 08:02:31] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-06-01 08:02:31] [INFO ] Invariant cache hit.
[2024-06-01 08:02:31] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-06-01 08:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:02:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:02:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:02:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1471 variables, and 1049 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30016 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1471 variables, and 1052 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30019 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 32/32 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in LTL mode , in 1 iterations and 61239 ms. Remains : 750/750 places, 721/721 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
RANDOM walk for 13600 steps (6 resets) in 104 ms. (129 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 227 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
[2024-06-01 08:03:32] [INFO ] Invariant cache hit.
[2024-06-01 08:03:33] [INFO ] [Real]Absence check using 270 positive place invariants in 138 ms returned sat
[2024-06-01 08:03:34] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2024-06-01 08:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:03:35] [INFO ] [Nat]Absence check using 270 positive place invariants in 135 ms returned sat
[2024-06-01 08:03:36] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2024-06-01 08:03:36] [INFO ] Computed and/alt/rep : 662/2301/662 causal constraints (skipped 58 transitions) in 34 ms.
[2024-06-01 08:03:45] [INFO ] Added : 553 causal constraints over 111 iterations in 8876 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 234 reset in 579 ms.
Product exploration explored 100000 steps with 236 reset in 683 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 08:03:47] [INFO ] Redundant transitions in 64 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 08:03:47] [INFO ] Computed 270 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 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 Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:04:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:04:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 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 Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30012 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60281 ms. Remains : 750/750 places, 720/721 transitions.
Support contains 7 out of 750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 6 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 08:04:47] [INFO ] Computed 270 invariants in 2 ms
[2024-06-01 08:04:47] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 08:04:47] [INFO ] Invariant cache hit.
[2024-06-01 08:04:48] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-06-01 08:04:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:05:10] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:05:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:05:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:05:15] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 4 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 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 Real declared 750/1471 variables, and 1049 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30034 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:05:34] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 720 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 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(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 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(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 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(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 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(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 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(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 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(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 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(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 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(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 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(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 1)
(s246 0)
(s247 0)
(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 1)
(s265 0)
(s266 0)
(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 1)
(s296 0)
(s297 0)
(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 1)
(s315 0)
(s316 0)
(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 1)
(s346 0)
(s347 0)
(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 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1471 variables, and 1052 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30013 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 32/32 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in LTL mode , in 1 iterations and 61235 ms. Remains : 750/750 places, 721/721 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-08 finished in 213847 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((G(p0)||X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-030A-LTLFireability-12
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Applied a total of 4 rules in 25 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 08:05:48] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 08:05:49] [INFO ] Implicit Places using invariants in 356 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 394 ms. Remains : 750/753 places, 721/723 transitions.
Running random walk in product with property : ShieldIIPs-PT-030A-LTLFireability-12
Product exploration explored 100000 steps with 146 reset in 607 ms.
Product exploration explored 100000 steps with 144 reset in 703 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 p0 (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4948 steps (0 resets) in 54 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 08:05:51] [INFO ] Computed 270 invariants in 5 ms
[2024-06-01 08:05:51] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 08:05:51] [INFO ] Invariant cache hit.
[2024-06-01 08:05:52] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-06-01 08:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:06:13] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:06:17] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1471 variables, and 1049 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30019 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1471 variables, and 1052 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 32/32 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in LTL mode , in 1 iterations and 61225 ms. Remains : 750/750 places, 721/721 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) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5135 steps (0 resets) in 58 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 144 reset in 613 ms.
Product exploration explored 100000 steps with 144 reset in 711 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-06-01 08:06:54] [INFO ] Redundant transitions in 67 ms returned [713]
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 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-06-01 08:06:54] [INFO ] Computed 270 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 1049 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30018 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:07:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 08:07:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 1051 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30016 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 31/31 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/750 places, 720/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60293 ms. Remains : 750/750 places, 720/721 transitions.
Support contains 4 out of 750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 6 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-06-01 08:07:54] [INFO ] Computed 270 invariants in 4 ms
[2024-06-01 08:07:55] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 08:07:55] [INFO ] Invariant cache hit.
[2024-06-01 08:07:56] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-06-01 08:07:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:08:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:08:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 08:08:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:08:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:08:20] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:08:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:08:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:08:20] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:08:21] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 15 places in 139 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 750/1471 variables, and 1049 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (OVERLAPS) 1/750 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 29/1049 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:08:42] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 08:08:43] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1471 variables, and 1052 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30017 ms.
Refiners :[Domain max(s): 750/750 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 32/32 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in LTL mode , in 1 iterations and 61251 ms. Remains : 750/750 places, 721/721 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLFireability-12 finished in 187654 ms.
[2024-06-01 08:08:56] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:08:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 08:08:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 753 places, 723 transitions and 3246 arcs took 23 ms.
Total runtime 2061103 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-01
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-05
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-06
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-07
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-08
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLFireability-12

BK_STOP 1717230532103

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-030A-LTLFireability-01
ltl formula formula --ltl=/tmp/6143/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 755 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 750 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1404 levels ~10000 states ~61284 transitions
pnml2lts-mc( 1/ 4): ~1404 levels ~20000 states ~115912 transitions
pnml2lts-mc( 1/ 4): ~1404 levels ~40000 states ~234848 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~80000 states ~273668 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~160000 states ~540668 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~320000 states ~1113552 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~640000 states ~2242964 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~1280000 states ~4468344 transitions
pnml2lts-mc( 0/ 4): ~1392 levels ~2560000 states ~9787384 transitions
pnml2lts-mc( 0/ 4): ~1404 levels ~5120000 states ~19610272 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5900576
pnml2lts-mc( 0/ 4): unique states count: 5906358
pnml2lts-mc( 0/ 4): unique transitions count: 39390774
pnml2lts-mc( 0/ 4): - self-loop count: 413
pnml2lts-mc( 0/ 4): - claim dead count: 33432799
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5906371
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5865
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5906371 states 39390798 transitions, fanout: 6.669
pnml2lts-mc( 0/ 4): Total exploration time 114.710 sec (114.680 sec minimum, 114.690 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51490, Transitions per second: 343395
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 109.5MB, 19.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 109.5MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-030A-LTLFireability-05
ltl formula formula --ltl=/tmp/6143/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 755 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 788 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~803 levels ~10000 states ~108596 transitions
pnml2lts-mc( 0/ 4): ~803 levels ~20000 states ~160064 transitions
pnml2lts-mc( 0/ 4): ~803 levels ~40000 states ~255528 transitions
pnml2lts-mc( 0/ 4): ~803 levels ~80000 states ~462760 transitions
pnml2lts-mc( 0/ 4): ~805 levels ~160000 states ~910688 transitions
pnml2lts-mc( 0/ 4): ~805 levels ~320000 states ~1854380 transitions
pnml2lts-mc( 0/ 4): ~811 levels ~640000 states ~3699712 transitions
pnml2lts-mc( 3/ 4): ~930 levels ~1280000 states ~9988428 transitions
pnml2lts-mc( 3/ 4): ~930 levels ~2560000 states ~20974140 transitions
pnml2lts-mc( 0/ 4): ~815 levels ~5120000 states ~30060728 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5665087
pnml2lts-mc( 0/ 4): unique states count: 5668496
pnml2lts-mc( 0/ 4): unique transitions count: 41164325
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 35408707
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5668512
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3488
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5668512 states 41164400 transitions, fanout: 7.262
pnml2lts-mc( 0/ 4): Total exploration time 113.620 sec (113.580 sec minimum, 113.600 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49890, Transitions per second: 362299
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 107.5MB, 19.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 107.5MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-030A-LTLFireability-06
ltl formula formula --ltl=/tmp/6143/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 751 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1386 levels ~10000 states ~75384 transitions
pnml2lts-mc( 3/ 4): ~1388 levels ~20000 states ~115872 transitions
pnml2lts-mc( 3/ 4): ~1388 levels ~40000 states ~199788 transitions
pnml2lts-mc( 3/ 4): ~1388 levels ~80000 states ~382068 transitions
pnml2lts-mc( 0/ 4): ~1377 levels ~160000 states ~408004 transitions
pnml2lts-mc( 0/ 4): ~1377 levels ~320000 states ~813316 transitions
pnml2lts-mc( 0/ 4): ~1377 levels ~640000 states ~1706340 transitions
pnml2lts-mc( 0/ 4): ~1377 levels ~1280000 states ~3612172 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~2560000 states ~7045528 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~5120000 states ~14528484 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~10240000 states ~30669612 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10127901
pnml2lts-mc( 0/ 4): unique states count: 10133420
pnml2lts-mc( 0/ 4): unique transitions count: 79505710
pnml2lts-mc( 0/ 4): - self-loop count: 384
pnml2lts-mc( 0/ 4): - claim dead count: 69317837
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10133435
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5591
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10133435 states 79505738 transitions, fanout: 7.846
pnml2lts-mc( 0/ 4): Total exploration time 195.600 sec (195.570 sec minimum, 195.583 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51807, Transitions per second: 406471
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.7MB, 14.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-030A-LTLFireability-07
ltl formula formula --ltl=/tmp/6143/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 755 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 1172 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~433 levels ~10000 states ~28176 transitions
pnml2lts-mc( 0/ 4): ~433 levels ~20000 states ~55948 transitions
pnml2lts-mc( 0/ 4): ~433 levels ~40000 states ~112712 transitions
pnml2lts-mc( 3/ 4): ~417 levels ~80000 states ~213712 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~160000 states ~445612 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~320000 states ~983060 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~640000 states ~2082240 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~1280000 states ~4195268 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~2560000 states ~8847852 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4009675
pnml2lts-mc( 0/ 4): unique states count: 4011450
pnml2lts-mc( 0/ 4): unique transitions count: 14678742
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10657312
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4011466
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1854
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4011466 states 14678792 transitions, fanout: 3.659
pnml2lts-mc( 0/ 4): Total exploration time 74.440 sec (74.430 sec minimum, 74.433 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53889, Transitions per second: 197190
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 94.7MB, 24.7 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 94.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-030A-LTLFireability-08
ltl formula formula --ltl=/tmp/6143/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 755 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 744 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1407 levels ~10000 states ~85672 transitions
pnml2lts-mc( 0/ 4): ~1410 levels ~20000 states ~128204 transitions
pnml2lts-mc( 3/ 4): ~1387 levels ~40000 states ~160896 transitions
pnml2lts-mc( 3/ 4): ~1387 levels ~80000 states ~283136 transitions
pnml2lts-mc( 3/ 4): ~1387 levels ~160000 states ~513492 transitions
pnml2lts-mc( 3/ 4): ~1387 levels ~320000 states ~1070828 transitions
pnml2lts-mc( 3/ 4): ~1389 levels ~640000 states ~2095216 transitions
pnml2lts-mc( 1/ 4): ~1556 levels ~1280000 states ~4627140 transitions
pnml2lts-mc( 1/ 4): ~1563 levels ~2560000 states ~9418092 transitions
pnml2lts-mc( 3/ 4): ~1398 levels ~5120000 states ~18376444 transitions
pnml2lts-mc( 3/ 4): ~1407 levels ~10240000 states ~38837416 transitions
pnml2lts-mc( 3/ 4): ~1410 levels ~20480000 states ~79340296 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26746994
pnml2lts-mc( 0/ 4): unique states count: 26752786
pnml2lts-mc( 0/ 4): unique transitions count: 135774882
pnml2lts-mc( 0/ 4): - self-loop count: 103
pnml2lts-mc( 0/ 4): - claim dead count: 108958555
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26752801
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5892
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26752801 states 135774921 transitions, fanout: 5.075
pnml2lts-mc( 0/ 4): Total exploration time 506.440 sec (506.430 sec minimum, 506.432 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52825, Transitions per second: 268097
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.6MB, 10.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 79.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.6MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-030A-LTLFireability-12
ltl formula formula --ltl=/tmp/6143/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6143/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6143/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6143/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6143/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 765 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1480 levels ~10000 states ~58408 transitions
pnml2lts-mc( 1/ 4): ~1480 levels ~20000 states ~86672 transitions
pnml2lts-mc( 1/ 4): ~1480 levels ~40000 states ~143160 transitions
pnml2lts-mc( 1/ 4): ~1480 levels ~80000 states ~262988 transitions
pnml2lts-mc( 2/ 4): ~1544 levels ~160000 states ~491720 transitions
pnml2lts-mc( 2/ 4): ~1544 levels ~320000 states ~1014400 transitions
pnml2lts-mc( 2/ 4): ~1544 levels ~640000 states ~2144448 transitions
pnml2lts-mc( 2/ 4): ~1544 levels ~1280000 states ~4302388 transitions
pnml2lts-mc( 0/ 4): ~1428 levels ~2560000 states ~9866040 transitions
pnml2lts-mc( 0/ 4): ~1428 levels ~5120000 states ~20490556 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9809015
pnml2lts-mc( 0/ 4): unique states count: 9814691
pnml2lts-mc( 0/ 4): unique transitions count: 39111099
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29243585
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9814708
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5789
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9814708 states 39111131 transitions, fanout: 3.985
pnml2lts-mc( 0/ 4): Total exploration time 187.210 sec (187.200 sec minimum, 187.208 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52426, Transitions per second: 208916
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 139.3MB, 14.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 139.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760400116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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