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-171683762300986.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 ShieldRVt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762300986
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 239K 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 ShieldRVt-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717276329016

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:12:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:12:10] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-01 21:12:10] [INFO ] Transformed 1003 places.
[2024-06-01 21:12:10] [INFO ] Transformed 1003 transitions.
[2024-06-01 21:12:10] [INFO ] Found NUPN structural information;
[2024-06-01 21:12:10] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 809 transition count 809
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 809 transition count 809
Applied a total of 388 rules in 156 ms. Remains 809 /1003 variables (removed 194) and now considering 809/1003 (removed 194) transitions.
// Phase 1: matrix 809 rows 809 cols
[2024-06-01 21:12:10] [INFO ] Computed 81 invariants in 20 ms
[2024-06-01 21:12:11] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 21:12:11] [INFO ] Invariant cache hit.
[2024-06-01 21:12:11] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-06-01 21:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 21:12:29] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 10 ms to minimize.
[2024-06-01 21:12:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-06-01 21:12:30] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:12:31] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:12:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:12:31] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:12:32] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:12:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-06-01 21:12:32] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:12:32] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:12:32] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2024-06-01 21:12:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:12:33] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:12:33] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:12:33] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 4 ms to minimize.
[2024-06-01 21:12:34] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 21:12:34] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-01 21:12:35] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:12:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:12:35] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 21:12:37] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:12:41] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 5 ms to minimize.
[2024-06-01 21:12:41] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/1618 variables, and 104 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/809 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 21:12:56] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:12:56] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:12:57] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:12:57] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:12:57] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:12:58] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-06-01 21:12:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:12:58] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:12:58] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:12:58] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:12:59] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:12:59] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 5 ms to minimize.
[2024-06-01 21:12:59] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:12:59] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:13:00] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:13:00] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:13:00] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 3 ms to minimize.
[2024-06-01 21:13:00] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 18/122 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 21:13:08] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 3 ms to minimize.
[2024-06-01 21:13:11] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:13:11] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 1)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 1)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 1)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 1)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 1)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 0)
(s664 1)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 1)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 1)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 1)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 1)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 1)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 1)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 1)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 timeout
0)
(s796 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/1618 variables, and 125 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/809 constraints, PredecessorRefiner: 0/808 constraints, Known Traps: 44/44 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 809/1003 places, 809/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61319 ms. Remains : 809/1003 places, 809/1003 transitions.
Support contains 113 out of 809 places after structural reductions.
[2024-06-01 21:13:12] [INFO ] Flatten gal took : 74 ms
[2024-06-01 21:13:12] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:13:12] [INFO ] Input system was already deterministic with 809 transitions.
Support contains 109 out of 809 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2551 ms. (15 steps per ms) remains 16/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
[2024-06-01 21:13:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 635/665 variables, 66/66 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 1 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 9 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 8/74 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:14] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 8 ms to minimize.
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/665 variables, 6/80 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 144/809 variables, 15/95 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:15] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 809/1618 variables, 809/905 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:16] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 3 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:13:17] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1618 variables, 10/915 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 915 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 275/302 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 507/809 variables, 55/86 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 22/108 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:13:18] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:13:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:13:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:13:19] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/809 variables, 6/114 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/809 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 809/1618 variables, 809/923 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1618 variables, 15/938 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 3 ms to minimize.
[2024-06-01 21:13:20] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1618 variables, 13/951 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1618 variables, 0/951 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/1618 variables, 0/951 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 951 constraints, problems are : Problem set: 1 solved, 15 unsolved in 4751 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 46/46 constraints]
After SMT, in 9781ms problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 8972 ms.
Support contains 25 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 809/809 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 809 transition count 603
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 209 rules applied. Total rules applied 415 place count 603 transition count 600
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 422 place count 601 transition count 595
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 427 place count 596 transition count 595
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 139 Pre rules applied. Total rules applied 427 place count 596 transition count 456
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 4 with 278 rules applied. Total rules applied 705 place count 457 transition count 456
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 724 place count 438 transition count 437
Iterating global reduction 4 with 19 rules applied. Total rules applied 743 place count 438 transition count 437
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 743 place count 438 transition count 425
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 767 place count 426 transition count 425
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 1 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 4 with 352 rules applied. Total rules applied 1119 place count 250 transition count 249
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1219 place count 200 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1220 place count 200 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1221 place count 199 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1222 place count 198 transition count 289
Applied a total of 1222 rules in 158 ms. Remains 198 /809 variables (removed 611) and now considering 289/809 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 198/809 places, 289/809 transitions.
RANDOM walk for 40000 steps (10 resets) in 593 ms. (67 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
// Phase 1: matrix 289 rows 198 cols
[2024-06-01 21:13:32] [INFO ] Computed 80 invariants in 3 ms
[2024-06-01 21:13:32] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:13:32] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 98/148 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 132/280 variables, 58/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/283 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 82/365 variables, 36/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 4/369 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/369 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/369 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 29/398 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/398 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/398 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 2/400 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/400 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 27/427 variables, 11/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/427 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/427 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 1/428 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/428 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/428 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 21/449 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/449 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/449 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 1/450 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/450 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/450 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 20/470 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/470 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/470 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 14/484 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/484 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/484 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 3/487 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/487 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (OVERLAPS) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 298 constraints, problems are : Problem set: 0 solved, 6 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 198/198 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 98/148 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 132/280 variables, 58/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 26/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/283 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 82/365 variables, 36/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 4/369 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/369 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 29/398 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/398 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/398 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 2/400 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/400 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 27/427 variables, 11/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/427 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/427 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 1/428 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/428 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/428 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 21/449 variables, 8/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/449 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/449 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 1/450 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/450 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/450 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 20/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/470 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/470 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 14/484 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/484 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/484 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 3/487 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/487 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/487 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 0/487 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 304 constraints, problems are : Problem set: 0 solved, 6 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 198/198 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1579ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 306 ms.
Support contains 9 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 289/289 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 197 transition count 288
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 197 transition count 276
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 185 transition count 276
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 182 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 178 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 177 transition count 279
Applied a total of 41 rules in 27 ms. Remains 177 /198 variables (removed 21) and now considering 279/289 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 177/198 places, 279/289 transitions.
RANDOM walk for 40000 steps (11 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 258898 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 6
Probabilistic random walk after 258898 steps, saw 185649 distinct states, run finished after 3009 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 279 rows 177 cols
[2024-06-01 21:13:37] [INFO ] Computed 80 invariants in 2 ms
[2024-06-01 21:13:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 93/138 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 133/271 variables, 56/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 28/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 76/347 variables, 32/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 16/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 28/375 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 22/397 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/397 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/397 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 22/419 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 20/439 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/439 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/439 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 14/453 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/453 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/453 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 3/456 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/456 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/456 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 0/456 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 281 constraints, problems are : Problem set: 0 solved, 6 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:13:38] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 93/138 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 133/271 variables, 56/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 28/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 76/347 variables, 32/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 16/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 28/375 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 22/397 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/397 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/397 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 22/419 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/419 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/419 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 20/439 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/439 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/439 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 14/453 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/453 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/453 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 3/456 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/456 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/456 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 0/456 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 288 constraints, problems are : Problem set: 0 solved, 6 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 9 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 279/279 transitions.
Applied a total of 0 rules in 9 ms. Remains 177 /177 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 177/177 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-01 21:13:39] [INFO ] Invariant cache hit.
[2024-06-01 21:13:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 21:13:39] [INFO ] Invariant cache hit.
[2024-06-01 21:13:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 21:13:39] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-01 21:13:39] [INFO ] Redundant transitions in 13 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-01 21:13:39] [INFO ] Invariant cache hit.
[2024-06-01 21:13:39] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 279/456 variables, 177/259 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 24/283 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 283 constraints, problems are : Problem set: 0 solved, 273 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 279/456 variables, 177/259 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 24/283 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 273/556 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 556 constraints, problems are : Problem set: 0 solved, 273 unsolved in 8908 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 2/2 constraints]
After SMT, in 16870ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 16881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17198 ms. Remains : 177/177 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 73 edges and 177 vertex of which 4 / 177 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 567 edges and 175 vertex of which 173 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 70 edges and 171 vertex of which 4 / 171 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 169 transition count 270
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 69 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 164 transition count 261
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 67 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 157 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 153 vertex of which 8 / 153 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 149 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 145 vertex of which 8 / 145 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 141 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 137 vertex of which 8 / 137 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 133 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 129 vertex of which 8 / 129 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 125 transition count 194
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 44 edges and 123 vertex of which 2 / 123 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 124 place count 122 transition count 184
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 128 place count 121 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 130 place count 120 transition count 180
Graph (complete) has 373 edges and 120 vertex of which 118 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 131 place count 118 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 135 place count 118 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 141 place count 118 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 143 place count 116 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 146 place count 114 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 150 place count 114 transition count 164
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 151 place count 114 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 152 place count 114 transition count 163
Applied a total of 152 rules in 42 ms. Remains 114 /177 variables (removed 63) and now considering 163/279 (removed 116) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 163 rows 114 cols
[2024-06-01 21:13:56] [INFO ] Computed 49 invariants in 1 ms
[2024-06-01 21:13:56] [INFO ] [Real]Absence check using 49 positive place invariants in 5 ms returned sat
[2024-06-01 21:13:56] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-06-01 21:13:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 21:13:56] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 21:13:56] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 21:13:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 5 ms returned sat
[2024-06-01 21:13:56] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 21:13:56] [INFO ] After 41ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 21:13:56] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 21:13:56] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 479 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 21:13:56] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:13:56] [INFO ] Flatten gal took : 29 ms
[2024-06-01 21:13:56] [INFO ] Input system was already deterministic with 809 transitions.
Computed a total of 247 stabilizing places and 247 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 54 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 781/809 places, 781/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 808 transition count 592
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 219 rules applied. Total rules applied 435 place count 592 transition count 589
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 442 place count 590 transition count 584
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 447 place count 585 transition count 584
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 447 place count 585 transition count 439
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 737 place count 440 transition count 439
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 755 place count 422 transition count 421
Iterating global reduction 4 with 18 rules applied. Total rules applied 773 place count 422 transition count 421
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 773 place count 422 transition count 409
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 797 place count 410 transition count 409
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 4 with 308 rules applied. Total rules applied 1105 place count 256 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1107 place count 254 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1108 place count 253 transition count 253
Applied a total of 1108 rules in 83 ms. Remains 253 /809 variables (removed 556) and now considering 253/809 (removed 556) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 253/809 places, 253/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 85 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 785/809 places, 785/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 36 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 789 transition count 789
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 789 transition count 789
Applied a total of 40 rules in 29 ms. Remains 789 /809 variables (removed 20) and now considering 789/809 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 789/809 places, 789/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 789 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 63 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 785/809 places, 785/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 80 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 783/809 places, 783/809 transitions.
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 16 ms
[2024-06-01 21:13:57] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:13:57] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 786 transition count 786
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Applied a total of 50 rules in 82 ms. Remains 784 /809 variables (removed 25) and now considering 784/809 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 784/809 places, 784/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 19 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 64 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 783/809 places, 783/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 17 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 85 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 783/809 places, 783/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 808 transition count 582
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 229 rules applied. Total rules applied 455 place count 582 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 457 place count 580 transition count 579
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 457 place count 580 transition count 433
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 749 place count 434 transition count 433
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 769 place count 414 transition count 413
Iterating global reduction 3 with 20 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 789 place count 414 transition count 399
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 817 place count 400 transition count 399
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 1129 place count 244 transition count 243
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 242 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1132 place count 241 transition count 241
Applied a total of 1132 rules in 49 ms. Remains 241 /809 variables (removed 568) and now considering 241/809 (removed 568) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 241/809 places, 241/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 241 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 784 transition count 784
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Applied a total of 54 rules in 60 ms. Remains 782 /809 variables (removed 27) and now considering 782/809 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 782/809 places, 782/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 54 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 781/809 places, 781/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 65 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 781/809 places, 781/809 transitions.
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:13:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:13:58] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 808 transition count 581
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 230 rules applied. Total rules applied 457 place count 581 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 459 place count 579 transition count 578
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 459 place count 579 transition count 432
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 751 place count 433 transition count 432
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 770 place count 414 transition count 413
Iterating global reduction 3 with 19 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 789 place count 414 transition count 400
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 815 place count 401 transition count 400
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1131 place count 243 transition count 242
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 241 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1134 place count 240 transition count 240
Applied a total of 1134 rules in 50 ms. Remains 240 /809 variables (removed 569) and now considering 240/809 (removed 569) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 240/809 places, 240/809 transitions.
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:13:59] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 36939 steps (8 resets) in 259 ms. (142 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-020B-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 77 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 781/809 places, 781/809 transitions.
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 18 ms
[2024-06-01 21:13:59] [INFO ] Input system was already deterministic with 781 transitions.
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 19 ms
[2024-06-01 21:13:59] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:13:59] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 21:13:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 809 places, 809 transitions and 1978 arcs took 4 ms.
Total runtime 109141 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-2023-15

BK_STOP 1717276439637

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/849/ctl_0_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/849/ctl_1_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/849/ctl_2_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/849/ctl_3_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/849/ctl_4_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/849/ctl_5_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/849/ctl_6_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/849/ctl_7_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/849/ctl_8_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/849/ctl_9_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/849/ctl_10_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/849/ctl_11_
ctl formula name ShieldRVt-PT-020B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/849/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVt-PT-020B, examination is CTLFireability"
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-171683762300986"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;