About the Execution of LTSMin+red for ASLink-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1840.960 | 1800000.00 | 2986419.00 | 4765.70 | [undef] | Time out reached |
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.r466-smll-171620124300048.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 ASLink-PT-05a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 516K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717186314206
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:11:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 20:11:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:11:56] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-05-31 20:11:56] [INFO ] Transformed 1211 places.
[2024-05-31 20:11:56] [INFO ] Transformed 1827 transitions.
[2024-05-31 20:11:56] [INFO ] Found NUPN structural information;
[2024-05-31 20:11:56] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 520 ms.
Structural test allowed to assert that 137 places are NOT stable. Took 18 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
RANDOM walk for 40000 steps (249 resets) in 4082 ms. (9 steps per ms) remains 407/1074 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 407/407 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 407/407 properties
// Phase 1: matrix 1808 rows 1211 cols
[2024-05-31 20:11:58] [INFO ] Computed 232 invariants in 120 ms
Error getting values : (error "ParserException while parsing response: ((s1 (/ 1.0 2.0))
(s2 (/ 1.0 2.0))
(s3 (/ 1.0 2.0))
(s4 (/ 1.0 2.0))
(s5 (/ 1.0 2.0))
(s6 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s199 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s230 (/ 1.0 2.0))
(s231 (/ 1.0 2.0))
(s232 (/ 1.0 2.0))
(s233 (/ 1.0 2.0))
(s234 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s274 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s287 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s297 (/ 1.0 2.0))
(s298 (/ 1.0 2.0))
(s299 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s305 (/ 1.0 2.0))
(s306 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s390 (/ 1.0 2.0))
(s391 (/ 1.0 2.0))
(s392 (/ 1.0 2.0))
(s393 (/ 1.0 2.0))
(s394 (/ 1.0 2.0))
(s395 (/ 1.0 2.0))
(s396 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s478 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 (/ 1.0 2.0))
(s541 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s584 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s586 (/ 1.0 2.0))
(s587 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s589 (/ 1.0 2.0))
(s590 (/ 1.0 2.0))
(s591 (/ 1.0 2.0))
(s592 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s619 (/ 1.0 2.0))
(s620 (/ 1.0 2.0))
(s621 (/ 1.0 2.0))
(s622 (/ 1.0 2.0))
(s623 (/ 1.0 2.0))
(s624 (/ 1.0 2.0))
(s625 (/ 1.0 2.0))
(s626 (/ 1.0 2.0))
(s627 (/ 1.0 2.0))
(s628 (/ 1.0 2.0))
(s629 (/ 1.0 2.0))
(s630 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s657 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s664 (/ 1.0 2.0))
(s665 (/ 1.0 2.0))
(s666 (/ 1.0 2.0))
(s667 (/ 1.0 2.0))
(s668 (/ 1.0 2.0))
(s669 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s673 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s676 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s687 (/ 1.0 2.0))
(s688 (/ 1.0 2.0))
(s689 (/ 1.0 2.0))
(s690 (/ 1.0 2.0))
(s691 (/ 1.0 2.0))
(s692 (/ 1.0 2.0))
(s693 (/ 1.0 2.0))
(s694 (/ 1.0 2.0))
(s695 (/ 1.0 2.0))
(s696 (/ 1.0 2.0))
(s697 (/ 1.0 2.0))
(s698 (/ 1.0 2.0))
(s699 (/ 1.0 2.0))
(s700 (/ 1.0 2.0))
(s701 (/ 1.0 2.0))
(s702 (/ 1.0 2.0))
(s703 (/ 1.0 2.0))
(s704 (/ 1.0 2.0))
(s708 (/ 1.0 2.0))
(s709 (/ 1.0 2.0))
(s710 (/ 1.0 2.0))
(s711 (/ 1.0 2.0))
(s712 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s778 (/ 1.0 2.0))
(s779 (/ 1.0 2.0))
(s780 (/ 1.0 2.0))
(s781 (/ 1.0 2.0))
(s782 (/ 1.0 2.0))
(s783 (/ 1.0 2.0))
(s784 (/ 1.0 2.0))
(s785 (/ 1.0 2.0))
(s786 (/ 1.0 2.0))
(s787 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s814 (/ 1.0 2.0))
(s852 (/ 1.0 2.0))
(s853 (/ 1.0 2.0))
(s854 (/ 1.0 2.0))
(s855 (/ 1.0 2.0))
(s856 (/ 1.0 2.0))
(s857 (/ 1.0 2.0))
(s858 (/ 1.0 2.0))
(s859 (/ 1.0 2.0))
(s860 (/ 1.0 2.0))
(s861 (/ 1.0 2.0))
(s862 (/ 1.0 2.0))
(s863 (/ 1.0 2.0))
(s864 (/ 1.0 2.0))
(s865 (/ 1.0 2.0))
(s866 (/ 1.0 2.0))
(s867 (/ 1.0 2.0))
(s868 (/ 1.0 2.0))
(s869 (/ 1.0 2.0))
(s870 (/ 1.0 2.0))
(s871 (/ 1.0 2.0))
(s872 (/ 1.0 2.0))
(s873 (/ 1.0 2.0))
(s874 (/ 1.0 2.0))
(s903 (/ 1.0 2.0))
(s904 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 (/ 1.0 2.0))
(s907 (/ 1.0 2.0))
(s977 (/ 1.0 2.0))
(s978 (/ 1.0 2.0))
(s979 (/ 1.0 2.0))
(s980 (/ 1.0 2.0))
(s981 (/ 1.0 2.0))
(s982 (/ 1.0 2.0))
(s1000 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 407/407 constraints. Problems are: Problem set: 0 solved, 407 unsolved
SMT process timed out in 5693ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 407 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 5 places
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1197 transition count 1733
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 164 place count 1122 transition count 1733
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 164 place count 1122 transition count 1637
Deduced a syphon composed of 96 places in 8 ms
Ensure Unique test removed 35 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 391 place count 991 transition count 1637
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 991 transition count 1636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 990 transition count 1636
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 395 place count 988 transition count 1626
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 988 transition count 1626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 401 place count 987 transition count 1623
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 403 place count 985 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 404 place count 984 transition count 1615
Iterating global reduction 6 with 1 rules applied. Total rules applied 405 place count 984 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 406 place count 983 transition count 1607
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 983 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 982 transition count 1599
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 982 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 410 place count 981 transition count 1591
Iterating global reduction 6 with 1 rules applied. Total rules applied 411 place count 981 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 412 place count 980 transition count 1583
Iterating global reduction 6 with 1 rules applied. Total rules applied 413 place count 980 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 414 place count 979 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 979 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 416 place count 978 transition count 1567
Iterating global reduction 6 with 1 rules applied. Total rules applied 417 place count 978 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 977 transition count 1559
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 977 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 976 transition count 1551
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 976 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 975 transition count 1543
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 975 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 424 place count 974 transition count 1535
Iterating global reduction 6 with 1 rules applied. Total rules applied 425 place count 974 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 426 place count 973 transition count 1527
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 973 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 972 transition count 1519
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 972 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 430 place count 971 transition count 1511
Iterating global reduction 6 with 1 rules applied. Total rules applied 431 place count 971 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 432 place count 970 transition count 1503
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 970 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 969 transition count 1495
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 969 transition count 1495
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 479 place count 947 transition count 1473
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 482 place count 947 transition count 1470
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 485 place count 944 transition count 1470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 486 place count 943 transition count 1469
Applied a total of 486 rules in 1070 ms. Remains 943 /1211 variables (removed 268) and now considering 1469/1808 (removed 339) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1087 ms. Remains : 943/1211 places, 1469/1808 transitions.
RANDOM walk for 4000000 steps (40776 resets) in 114999 ms. (34 steps per ms) remains 265/407 properties
BEST_FIRST walk for 40003 steps (79 resets) in 259 ms. (153 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40002 steps (78 resets) in 219 ms. (181 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40004 steps (81 resets) in 225 ms. (177 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40003 steps (81 resets) in 219 ms. (181 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40004 steps (76 resets) in 247 ms. (161 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40003 steps (77 resets) in 229 ms. (173 steps per ms) remains 265/265 properties
BEST_FIRST walk for 40003 steps (78 resets) in 241 ms. (165 steps per ms) remains 258/265 properties
BEST_FIRST walk for 40003 steps (78 resets) in 231 ms. (172 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (79 resets) in 220 ms. (181 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (80 resets) in 221 ms. (180 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (77 resets) in 241 ms. (165 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (79 resets) in 229 ms. (173 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (77 resets) in 222 ms. (179 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (79 resets) in 221 ms. (180 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (76 resets) in 267 ms. (149 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (82 resets) in 342 ms. (116 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (81 resets) in 285 ms. (139 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (88 resets) in 291 ms. (137 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (81 resets) in 291 ms. (137 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (78 resets) in 284 ms. (140 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (78 resets) in 302 ms. (132 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (78 resets) in 259 ms. (153 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (80 resets) in 289 ms. (137 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (82 resets) in 365 ms. (109 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40001 steps (73 resets) in 266 ms. (149 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (80 resets) in 276 ms. (144 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (80 resets) in 261 ms. (152 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (83 resets) in 254 ms. (156 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (78 resets) in 277 ms. (143 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (76 resets) in 260 ms. (153 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (82 resets) in 238 ms. (167 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (84 resets) in 212 ms. (187 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (75 resets) in 232 ms. (171 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (81 resets) in 230 ms. (173 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (81 resets) in 214 ms. (186 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (77 resets) in 220 ms. (181 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (78 resets) in 238 ms. (167 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (78 resets) in 225 ms. (177 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (74 resets) in 232 ms. (171 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (79 resets) in 230 ms. (173 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (82 resets) in 218 ms. (182 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (77 resets) in 241 ms. (165 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40002 steps (80 resets) in 217 ms. (183 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (81 resets) in 223 ms. (178 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (83 resets) in 219 ms. (181 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (74 resets) in 242 ms. (164 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (81 resets) in 219 ms. (181 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (76 resets) in 242 ms. (164 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (82 resets) in 222 ms. (179 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (80 resets) in 216 ms. (184 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (81 resets) in 223 ms. (178 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (74 resets) in 230 ms. (173 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (78 resets) in 232 ms. (171 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (79 resets) in 226 ms. (176 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40003 steps (77 resets) in 252 ms. (158 steps per ms) remains 258/258 properties
BEST_FIRST walk for 40004 steps (77 resets) in 292 ms. (136 steps per ms) remains 258/258 properties
// Phase 1: matrix 1469 rows 943 cols
[2024-05-31 20:12:38] [INFO ] Computed 182 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 31/289 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 264/554 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 22/576 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 1/577 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 13 (OVERLAPS) 236/813 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/813 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 15 (OVERLAPS) 50/863 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 3.0 46.0))
(s1 (/ 71.0 92.0))
(s2 (/ 1.0 92.0))
(s3 (/ 1.0 92.0))
(s4 (/ 1.0 92.0))
(s5 (/ 1.0 92.0))
(s6 (/ 1.0 92.0))
(s7 (/ 1.0 92.0))
(s8 (/ 1.0 92.0))
(s9 (/ 1.0 92.0))
(s10 (/ 1.0 92.0))
(s11 (/ 1.0 92.0))
(s12 (/ 1.0 92.0))
(s13 (/ 1.0 92.0))
(s14 (/ 1.0 92.0))
(s15 (/ 1.0 92.0))
(s16 (/ 1.0 92.0))
(s17 0.0)
(s18 (/ 1.0 46.0))
(s19 (/ 3.0 92.0))
(s20 (/ 87.0 92.0))
(s21 0.0)
(s22 (/ 1.0 92.0))
(s23 (/ 5.0 92.0))
(s24 (/ 77.0 92.0))
(s25 (/ 1.0 92.0))
(s26 (/ 1.0 92.0))
(s27 (/ 1.0 92.0))
(s28 (/ 1.0 92.0))
(s29 (/ 1.0 92.0))
(s30 (/ 1.0 92.0))
(s31 (/ 1.0 92.0))
(s32 (/ 1.0 92.0))
(s33 (/ 1.0 92.0))
(s34 (/ 15.0 46.0))
(s35 (/ 1.0 92.0))
(s36 (/ 1.0 92.0))
(s37 (/ 1.0 92.0))
(s38 (/ 1.0 92.0))
(s39 (/ 1.0 92.0))
(s40 (/ 1.0 92.0))
(s41 (/ 1.0 92.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 92.0))
(s44 (/ 1.0 92.0))
(s45 (/ 1.0 92.0))
(s46 (/ 1.0 92.0))
(s47 (/ 1.0 92.0))
(s48 (/ 1.0 92.0))
(s49 (/ 1.0 92.0))
(s50 (/ 1.0 92.0))
(s51 (/ 1.0 92.0))
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 75.0 92.0))
(s72 (/ 1.0 92.0))
(s73 (/ 1.0 92.0))
(s74 (/ 1.0 92.0))
(s75 (/ 1.0 92.0))
(s76 (/ 1.0 92.0))
(s77 (/ 1.0 92.0))
(s78 (/ 1.0 92.0))
(s79 (/ 1.0 92.0))
(s80 (/ 1.0 92.0))
(s81 (/ 1.0 92.0))
(s82 (/ 1.0 92.0))
(s83 (/ 1.0 92.0))
(s84 (/ 1.0 92.0))
(s85 (/ 1.0 92.0))
(s86 (/ 1.0 92.0))
(s87 (/ 1.0 92.0))
(s88 (/ 1.0 92.0))
(s89 (/ 1.0 92.0))
(s90 (/ 1.0 92.0))
(s91 (/ 4.0 23.0))
(s92 (/ 1.0 92.0))
(s93 (/ 1.0 92.0))
(s94 (/ 1.0 92.0))
(s95 0.0)
(s96 (/ 16.0 23.0))
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 (/ 1.0 92.0))
(s101 (/ 1.0 92.0))
(s102 (/ 1.0 92.0))
(s103 (/ 1.0 92.0))
(s104 (/ 1.0 92.0))
(s105 (/ 1.0 92.0))
(s106 (/ 1.0 92.0))
(s107 (/ 1.0 92.0))
(s108 (/ 1.0 92.0))
(s109 (/ 1.0 92.0))
(s110 (/ 1.0 92.0))
(s111 (/ 53.0 92.0))
(s112 (/ 1.0 92.0))
(s113 (/ 53.0 92.0))
(s114 (/ 1.0 92.0))
(s115 (/ 53.0 92.0))
(s116 (/ 1.0 92.0))
(s117 (/ 1.0 92.0))
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 (/ 1.0 23.0))
(s155 0.0)
(s156 (/ 1.0 92.0))
(s157 (/ 1.0 92.0))
(s158 (/ 1.0 92.0))
(s159 (/ 1.0 92.0))
(s160 (/ 1.0 92.0))
(s161 (/ 1.0 92.0))
(s162 (/ 1.0 92.0))
(s163 (/ 1.0 92.0))
(s164 (/ 1.0 92.0))
(s165 (/ 1.0 92.0))
(s166 (/ 87.0 92.0))
(s167 (/ 3.0 92.0))
(s168 (/ 1.0 92.0))
(s169 (/ 1.0 92.0))
(s170 (/ 1.0 92.0))
(s171 (/ 3.0 92.0))
(s172 (/ 89.0 92.0))
(s173 (/ 1.0 92.0))
(s174 (/ 1.0 92.0))
(s175 (/ 1.0 92.0))
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 (/ 1.0 92.0))
(s183 (/ 91.0 92.0))
(s184 (/ 1.0 92.0))
(s185 (/ 1.0 92.0))
(s186 (/ 1.0 92.0))
(s187 (/ 89.0 92.0))
(s188 (/ 55.0 92.0))
(s189 (/ 9.0 23.0))
(s190 (/ 75.0 92.0))
(s191 (/ 1.0 92.0))
(s192 (/ 1.0 92.0))
(s193 (/ 1.0 92.0))
(s194 (/ 1.0 92.0))
(s195 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2412 variables, and 152 constraints, problems are : Problem set: 0 solved, 258 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 60/61 constraints, Generalized P Invariants (flows): 92/121 constraints, State Equation: 0/943 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 31/289 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 264/554 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-31 20:13:31] [INFO ] Deduced a trap composed of 30 places in 348 ms of which 67 ms to minimize.
[2024-05-31 20:13:31] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-05-31 20:13:32] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:13:33] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
[2024-05-31 20:13:34] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:13:36] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 3 ms to minimize.
[2024-05-31 20:13:36] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 22/576 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 1/577 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 14 (OVERLAPS) 236/813 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/813 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 16 (OVERLAPS) 50/863 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/2412 variables, and 159 constraints, problems are : Problem set: 0 solved, 258 unsolved in 45048 ms.
Refiners :[Positive P Invariants (semi-flows): 60/61 constraints, Generalized P Invariants (flows): 92/121 constraints, State Equation: 0/943 constraints, PredecessorRefiner: 0/258 constraints, Known Traps: 7/7 constraints]
After SMT, in 90465ms problems are : Problem set: 0 solved, 258 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 258 out of 943 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 943/943 places, 1469/1469 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 938 transition count 1462
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 928 transition count 1462
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 22 place count 928 transition count 1454
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 920 transition count 1454
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 918 transition count 1454
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 916 transition count 1442
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 916 transition count 1442
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 915 transition count 1442
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 71 place count 902 transition count 1429
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 899 transition count 1426
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 899 transition count 1426
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 899 transition count 1423
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 85 place count 896 transition count 1421
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 896 transition count 1421
Applied a total of 86 rules in 309 ms. Remains 896 /943 variables (removed 47) and now considering 1421/1469 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 896/943 places, 1421/1469 transitions.
RANDOM walk for 4000000 steps (47520 resets) in 94930 ms. (42 steps per ms) remains 253/258 properties
BEST_FIRST walk for 40004 steps (89 resets) in 251 ms. (158 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (93 resets) in 386 ms. (103 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (90 resets) in 432 ms. (92 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (91 resets) in 489 ms. (81 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (90 resets) in 463 ms. (86 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (88 resets) in 427 ms. (93 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (93 resets) in 378 ms. (105 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (88 resets) in 448 ms. (89 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (91 resets) in 426 ms. (93 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (92 resets) in 423 ms. (94 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (93 resets) in 396 ms. (100 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (92 resets) in 519 ms. (76 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (90 resets) in 446 ms. (89 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (83 resets) in 606 ms. (65 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (89 resets) in 454 ms. (87 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (92 resets) in 399 ms. (100 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (89 resets) in 448 ms. (89 steps per ms) remains 251/253 properties
BEST_FIRST walk for 40003 steps (86 resets) in 388 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (89 resets) in 507 ms. (78 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (92 resets) in 384 ms. (103 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (87 resets) in 345 ms. (115 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (87 resets) in 567 ms. (70 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 467 ms. (85 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 347 ms. (114 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (95 resets) in 316 ms. (126 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (89 resets) in 486 ms. (82 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (92 resets) in 352 ms. (113 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (89 resets) in 396 ms. (100 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (90 resets) in 326 ms. (122 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 408 ms. (97 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (92 resets) in 361 ms. (110 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (91 resets) in 412 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (92 resets) in 383 ms. (104 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (87 resets) in 380 ms. (104 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 495 ms. (80 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (86 resets) in 495 ms. (80 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (91 resets) in 420 ms. (95 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 495 ms. (80 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (91 resets) in 533 ms. (74 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 525 ms. (76 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (91 resets) in 464 ms. (86 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (83 resets) in 444 ms. (89 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (81 resets) in 554 ms. (72 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (90 resets) in 463 ms. (86 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (87 resets) in 367 ms. (108 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 428 ms. (93 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 390 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 339 ms. (117 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (89 resets) in 413 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (92 resets) in 393 ms. (101 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 401 ms. (99 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 390 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (86 resets) in 460 ms. (86 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (92 resets) in 383 ms. (104 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 436 ms. (91 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (91 resets) in 348 ms. (114 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (93 resets) in 341 ms. (116 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (91 resets) in 441 ms. (90 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (86 resets) in 354 ms. (112 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 356 ms. (112 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 473 ms. (84 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 468 ms. (85 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (92 resets) in 411 ms. (97 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (91 resets) in 319 ms. (125 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 454 ms. (87 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (89 resets) in 380 ms. (104 steps per ms) remains 251/251 properties
Interrupted probabilistic random walk after 2584721 steps, run timeout after 99002 ms. (steps per millisecond=26 ) properties seen :14 out of 251
Probabilistic random walk after 2584721 steps, saw 788876 distinct states, run finished after 99013 ms. (steps per millisecond=26 ) properties seen :14
// Phase 1: matrix 1421 rows 896 cols
[2024-05-31 20:16:22] [INFO ] Computed 171 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 25/262 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 160/422 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 10/432 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 150/582 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 31/613 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 117/730 variables, 14/132 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/730 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 55/785 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 6/791 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/791 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 104/895 variables, 28/170 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/895 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 1/896 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/896 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (OVERLAPS) 1421/2317 variables, 896/1067 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2317 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2317/2317 variables, and 1067 constraints, problems are : Problem set: 0 solved, 237 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 896/896 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 25/262 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 160/422 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 20:17:43] [INFO ] Deduced a trap composed of 24 places in 405 ms of which 6 ms to minimize.
[2024-05-31 20:17:43] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 3 ms to minimize.
[2024-05-31 20:17:45] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-05-31 20:17:46] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 5 ms to minimize.
[2024-05-31 20:17:47] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 10/432 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 150/582 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (OVERLAPS) 31/613 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (OVERLAPS) 117/730 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/730 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (OVERLAPS) 55/785 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (OVERLAPS) 6/791 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/791 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (OVERLAPS) 104/895 variables, 28/175 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/895 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (OVERLAPS) 1/896 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/896 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (OVERLAPS) 1421/2317 variables, 896/1072 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2317/2317 variables, and 1309 constraints, problems are : Problem set: 0 solved, 237 unsolved in 75051 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 896/896 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 5/5 constraints]
After SMT, in 150195ms problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 896/896 places, 1421/1421 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 895 transition count 1417
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 890 transition count 1417
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 890 transition count 1413
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 884 transition count 1413
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 883 transition count 1413
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 880 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 879 transition count 1409
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 879 transition count 1409
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 879 transition count 1408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 878 transition count 1408
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 878 transition count 1408
Applied a total of 32 rules in 168 ms. Remains 878 /896 variables (removed 18) and now considering 1408/1421 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 878/896 places, 1408/1421 transitions.
RANDOM walk for 4000000 steps (47604 resets) in 91295 ms. (43 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (84 resets) in 296 ms. (134 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 390 ms. (102 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (90 resets) in 465 ms. (85 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (90 resets) in 384 ms. (103 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (94 resets) in 628 ms. (63 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (92 resets) in 556 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (87 resets) in 470 ms. (84 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (85 resets) in 498 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (85 resets) in 422 ms. (94 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (91 resets) in 521 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (90 resets) in 420 ms. (95 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (89 resets) in 445 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (88 resets) in 452 ms. (88 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (87 resets) in 456 ms. (87 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (86 resets) in 446 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 411 ms. (97 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (86 resets) in 433 ms. (92 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (87 resets) in 373 ms. (106 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (83 resets) in 380 ms. (104 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (93 resets) in 339 ms. (117 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (88 resets) in 418 ms. (95 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (88 resets) in 401 ms. (99 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (86 resets) in 447 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (90 resets) in 424 ms. (94 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (87 resets) in 423 ms. (94 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (98 resets) in 360 ms. (110 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (88 resets) in 479 ms. (83 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (92 resets) in 414 ms. (96 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (85 resets) in 448 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (86 resets) in 447 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 418 ms. (95 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (89 resets) in 457 ms. (87 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (88 resets) in 583 ms. (68 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (96 resets) in 349 ms. (114 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (91 resets) in 495 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (89 resets) in 468 ms. (85 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (88 resets) in 485 ms. (82 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (87 resets) in 542 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (89 resets) in 486 ms. (82 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (89 resets) in 459 ms. (86 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (91 resets) in 455 ms. (87 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 399 ms. (100 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (94 resets) in 525 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (92 resets) in 461 ms. (86 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 537 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (89 resets) in 435 ms. (91 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (93 resets) in 402 ms. (99 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (90 resets) in 402 ms. (99 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (88 resets) in 416 ms. (95 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (90 resets) in 444 ms. (89 steps per ms) remains 237/237 properties
Interrupted probabilistic random walk after 2507463 steps, run timeout after 96001 ms. (steps per millisecond=26 ) properties seen :0 out of 237
Probabilistic random walk after 2507463 steps, saw 773582 distinct states, run finished after 96004 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 1408 rows 878 cols
[2024-05-31 20:21:01] [INFO ] Computed 166 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 25/262 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 154/416 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 4/420 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 79/499 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 3/502 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 30/532 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 6/538 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 63/601 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 18/619 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/619 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 114/733 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/733 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (OVERLAPS) 53/786 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/786 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 25 (OVERLAPS) 2/788 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/788 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 27 (OVERLAPS) 87/875 variables, 24/163 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/875 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 29 (OVERLAPS) 1/876 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 876/2286 variables, and 164 constraints, problems are : Problem set: 0 solved, 237 unsolved in 90018 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 113/115 constraints, State Equation: 0/878 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 25/262 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 154/416 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 7 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 5 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 3 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 4/420 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 79/499 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (OVERLAPS) 3/502 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (OVERLAPS) 30/532 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (OVERLAPS) 6/538 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (OVERLAPS) 63/601 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (OVERLAPS) 18/619 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/619 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (OVERLAPS) 114/733 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/733 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (OVERLAPS) 53/786 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/786 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 26 (OVERLAPS) 2/788 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/2286 variables, and 145 constraints, problems are : Problem set: 0 solved, 237 unsolved in 90021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/51 constraints, Generalized P Invariants (flows): 89/115 constraints, State Equation: 0/878 constraints, PredecessorRefiner: 0/237 constraints, Known Traps: 6/6 constraints]
After SMT, in 180169ms problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 878 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 878/878 places, 1408/1408 transitions.
Applied a total of 0 rules in 44 ms. Remains 878 /878 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 878/878 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 878/878 places, 1408/1408 transitions.
Applied a total of 0 rules in 51 ms. Remains 878 /878 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-31 20:24:01] [INFO ] Invariant cache hit.
[2024-05-31 20:24:03] [INFO ] Implicit Places using invariants in 1640 ms returned [20, 53, 71, 163, 180, 185, 186, 206, 224, 316, 330, 334, 335, 355, 373, 465, 479, 483, 484, 485, 503, 521, 540, 590, 591, 602, 603, 604, 622, 640, 659, 709, 710, 713, 724, 725, 726, 744, 746, 749, 767, 768, 769, 770, 782, 788, 794, 800, 806, 812, 818, 824, 830, 836, 842]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1659 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 823/878 places, 1408/1408 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 823 transition count 1333
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 748 transition count 1333
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 150 place count 748 transition count 1307
Deduced a syphon composed of 26 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 203 place count 721 transition count 1307
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 215 place count 717 transition count 1299
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 223 place count 709 transition count 1299
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 238 place count 694 transition count 1284
Iterating global reduction 4 with 15 rules applied. Total rules applied 253 place count 694 transition count 1284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 256 place count 694 transition count 1281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 256 place count 694 transition count 1280
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 693 transition count 1280
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 261 place count 690 transition count 1277
Iterating global reduction 5 with 3 rules applied. Total rules applied 264 place count 690 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 265 place count 689 transition count 1276
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 689 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 267 place count 688 transition count 1275
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 688 transition count 1275
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 350 place count 647 transition count 1234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 352 place count 647 transition count 1232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 364 place count 647 transition count 1220
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 377 place count 634 transition count 1220
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 392 place count 634 transition count 1220
Applied a total of 392 rules in 254 ms. Remains 634 /823 variables (removed 189) and now considering 1220/1408 (removed 188) transitions.
// Phase 1: matrix 1220 rows 634 cols
[2024-05-31 20:24:03] [INFO ] Computed 105 invariants in 21 ms
[2024-05-31 20:24:04] [INFO ] Implicit Places using invariants in 1004 ms returned [122, 128, 131, 133, 134, 155, 156, 251, 257, 260, 262, 263, 281, 282, 376, 382, 385, 387, 388, 406, 407, 477, 483, 486, 488, 493, 494, 560, 566, 569, 571]
[2024-05-31 20:24:04] [INFO ] Actually due to overlaps returned [155, 281, 406, 493, 156, 282, 407, 494, 122, 128, 133, 251, 257, 262, 376, 382, 387, 477, 483, 488, 560, 566, 571, 134, 263, 388]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 608/878 places, 1220/1408 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 588 transition count 1200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 588 transition count 1200
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 583 transition count 1195
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 583 transition count 1195
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 578 transition count 1190
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 578 transition count 1172
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 96 place count 560 transition count 1172
Applied a total of 96 rules in 82 ms. Remains 560 /608 variables (removed 48) and now considering 1172/1220 (removed 48) transitions.
// Phase 1: matrix 1172 rows 560 cols
[2024-05-31 20:24:04] [INFO ] Computed 79 invariants in 14 ms
[2024-05-31 20:24:05] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-31 20:24:05] [INFO ] Invariant cache hit.
[2024-05-31 20:24:06] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 560/878 places, 1172/1408 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4851 ms. Remains : 560/878 places, 1172/1408 transitions.
RANDOM walk for 4000000 steps (70554 resets) in 88552 ms. (45 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (166 resets) in 437 ms. (91 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (165 resets) in 524 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (172 resets) in 554 ms. (72 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (170 resets) in 567 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (164 resets) in 475 ms. (84 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (175 resets) in 471 ms. (84 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (175 resets) in 462 ms. (86 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (174 resets) in 492 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (164 resets) in 488 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (165 resets) in 525 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (175 resets) in 435 ms. (91 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (167 resets) in 516 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (166 resets) in 477 ms. (83 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (174 resets) in 488 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (158 resets) in 541 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (171 resets) in 464 ms. (86 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (176 resets) in 499 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (177 resets) in 510 ms. (78 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (172 resets) in 489 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (172 resets) in 529 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (168 resets) in 526 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (166 resets) in 535 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (167 resets) in 511 ms. (78 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (173 resets) in 451 ms. (88 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (167 resets) in 543 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (178 resets) in 478 ms. (83 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (174 resets) in 504 ms. (79 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (172 resets) in 570 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (174 resets) in 623 ms. (64 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (171 resets) in 516 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (170 resets) in 447 ms. (89 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (179 resets) in 483 ms. (82 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (169 resets) in 588 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (175 resets) in 597 ms. (66 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (166 resets) in 435 ms. (91 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (176 resets) in 519 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (179 resets) in 535 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (162 resets) in 531 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (166 resets) in 494 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (170 resets) in 454 ms. (87 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (179 resets) in 521 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (169 resets) in 476 ms. (83 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (178 resets) in 452 ms. (88 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (167 resets) in 576 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (174 resets) in 490 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (166 resets) in 609 ms. (65 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (164 resets) in 511 ms. (78 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (182 resets) in 460 ms. (86 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (168 resets) in 524 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (173 resets) in 521 ms. (76 steps per ms) remains 237/237 properties
Interrupted probabilistic random walk after 2088764 steps, run timeout after 90001 ms. (steps per millisecond=23 ) properties seen :6 out of 237
Probabilistic random walk after 2088764 steps, saw 991715 distinct states, run finished after 90001 ms. (steps per millisecond=23 ) properties seen :6
[2024-05-31 20:26:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 10/241 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 111/352 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 5/357 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 120/477 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 34/511 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (OVERLAPS) 49/560 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 15 (OVERLAPS) 1172/1732 variables, 560/639 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1732 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 17 (OVERLAPS) 0/1732 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1732/1732 variables, and 639 constraints, problems are : Problem set: 0 solved, 231 unsolved in 64416 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 10/241 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 20:27:14] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 111/352 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 5/357 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (OVERLAPS) 120/477 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 20:27:35] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (OVERLAPS) 34/511 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 15 (OVERLAPS) 49/560 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 17 (OVERLAPS) 1172/1732 variables, 560/644 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1732 variables, 231/875 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1732/1732 variables, and 875 constraints, problems are : Problem set: 0 solved, 231 unsolved in 105020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 5/5 constraints]
After SMT, in 169528ms problems are : Problem set: 0 solved, 231 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 231 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1172/1172 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 560 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 559 transition count 1171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 559 transition count 1170
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 558 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 557 transition count 1164
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 557 transition count 1164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1163
Applied a total of 8 rules in 49 ms. Remains 556 /560 variables (removed 4) and now considering 1163/1172 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 556/560 places, 1163/1172 transitions.
RANDOM walk for 2205211 steps (38732 resets) in 120004 ms. (18 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (166 resets) in 528 ms. (75 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40002 steps (171 resets) in 540 ms. (73 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (177 resets) in 641 ms. (62 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (173 resets) in 560 ms. (71 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40002 steps (173 resets) in 662 ms. (60 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (169 resets) in 585 ms. (68 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (164 resets) in 473 ms. (84 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (172 resets) in 500 ms. (79 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (166 resets) in 623 ms. (64 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (171 resets) in 458 ms. (87 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (169 resets) in 665 ms. (60 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (175 resets) in 658 ms. (60 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (175 resets) in 612 ms. (65 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40001 steps (160 resets) in 592 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (172 resets) in 474 ms. (84 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (165 resets) in 487 ms. (81 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (166 resets) in 553 ms. (72 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (167 resets) in 459 ms. (86 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (167 resets) in 624 ms. (64 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40001 steps (177 resets) in 578 ms. (69 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (171 resets) in 724 ms. (55 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (179 resets) in 632 ms. (63 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40002 steps (170 resets) in 654 ms. (61 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (169 resets) in 567 ms. (70 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (167 resets) in 529 ms. (75 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (163 resets) in 650 ms. (61 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (172 resets) in 565 ms. (70 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (178 resets) in 523 ms. (76 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (184 resets) in 417 ms. (95 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (171 resets) in 616 ms. (64 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (178 resets) in 691 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (172 resets) in 658 ms. (60 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (162 resets) in 549 ms. (72 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (159 resets) in 586 ms. (68 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (176 resets) in 456 ms. (87 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (165 resets) in 708 ms. (56 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (172 resets) in 588 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (160 resets) in 517 ms. (77 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (170 resets) in 436 ms. (91 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (168 resets) in 472 ms. (84 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (170 resets) in 414 ms. (96 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (168 resets) in 578 ms. (69 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (172 resets) in 477 ms. (83 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (178 resets) in 477 ms. (83 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (172 resets) in 544 ms. (73 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (169 resets) in 455 ms. (87 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (164 resets) in 564 ms. (70 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40004 steps (163 resets) in 639 ms. (62 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40003 steps (184 resets) in 627 ms. (63 steps per ms) remains 231/231 properties
BEST_FIRST walk for 40002 steps (178 resets) in 512 ms. (77 steps per ms) remains 231/231 properties
Interrupted probabilistic random walk after 2549907 steps, run timeout after 117001 ms. (steps per millisecond=21 ) properties seen :66 out of 231
Probabilistic random walk after 2549907 steps, saw 1585451 distinct states, run finished after 117002 ms. (steps per millisecond=21 ) properties seen :66
// Phase 1: matrix 1163 rows 556 cols
[2024-05-31 20:31:32] [INFO ] Computed 79 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 80/253 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 4/257 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 115/372 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 4/376 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 88/464 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 37/501 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 55/556 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/556 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 1163/1719 variables, 556/635 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1719 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 0/1719 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 635 constraints, problems are : Problem set: 0 solved, 165 unsolved in 41177 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 556/556 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-31 20:32:15] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:32:16] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 80/253 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-31 20:32:19] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 4/257 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 115/372 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 4/376 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 88/464 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 37/501 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-31 20:32:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/501 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (OVERLAPS) 55/556 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (OVERLAPS) 1163/1719 variables, 556/639 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1719 variables, 165/804 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 804 constraints, problems are : Problem set: 0 solved, 165 unsolved in 120018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 556/556 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 4/4 constraints]
After SMT, in 161283ms problems are : Problem set: 0 solved, 165 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1163/1163 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 553 transition count 1157
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 546 transition count 1157
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 16 place count 546 transition count 1150
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 537 transition count 1150
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 35 place count 536 transition count 1148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 534 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 37 place count 534 transition count 1147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 533 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 531 transition count 1145
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 531 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 531 transition count 1144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 530 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 530 transition count 1142
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 530 transition count 1142
Applied a total of 48 rules in 72 ms. Remains 530 /556 variables (removed 26) and now considering 1142/1163 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 530/556 places, 1142/1163 transitions.
RANDOM walk for 4000000 steps (72611 resets) in 65816 ms. (60 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (174 resets) in 316 ms. (126 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (170 resets) in 340 ms. (117 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 517 ms. (77 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 579 ms. (68 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 595 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 442 ms. (90 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 429 ms. (93 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 577 ms. (69 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (186 resets) in 309 ms. (129 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (182 resets) in 524 ms. (76 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 448 ms. (89 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (184 resets) in 496 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 446 ms. (89 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (171 resets) in 412 ms. (96 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (174 resets) in 361 ms. (110 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (168 resets) in 534 ms. (74 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (184 resets) in 321 ms. (124 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (186 resets) in 510 ms. (78 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 348 ms. (114 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (187 resets) in 533 ms. (74 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 582 ms. (68 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (178 resets) in 606 ms. (65 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (187 resets) in 536 ms. (74 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (178 resets) in 487 ms. (81 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 464 ms. (86 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 613 ms. (65 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (185 resets) in 487 ms. (81 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (179 resets) in 416 ms. (95 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (171 resets) in 431 ms. (92 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (188 resets) in 352 ms. (113 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (180 resets) in 565 ms. (70 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (188 resets) in 568 ms. (70 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (173 resets) in 594 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (192 resets) in 397 ms. (100 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (186 resets) in 484 ms. (82 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (178 resets) in 508 ms. (78 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (189 resets) in 409 ms. (97 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (180 resets) in 530 ms. (75 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (188 resets) in 540 ms. (73 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (185 resets) in 436 ms. (91 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (175 resets) in 455 ms. (87 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 378 ms. (105 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (183 resets) in 456 ms. (87 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (194 resets) in 493 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (188 resets) in 494 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 440 ms. (90 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 693 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 458 ms. (87 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (170 resets) in 552 ms. (72 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (184 resets) in 430 ms. (92 steps per ms) remains 165/165 properties
Interrupted probabilistic random walk after 1476030 steps, run timeout after 72001 ms. (steps per millisecond=20 ) properties seen :0 out of 165
Probabilistic random walk after 1476030 steps, saw 1004440 distinct states, run finished after 72001 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 1142 rows 530 cols
[2024-05-31 20:35:50] [INFO ] Computed 72 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 68/241 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 111/353 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 7/360 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 13/373 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 33/406 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 90/496 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 22/518 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 12/530 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 23 (OVERLAPS) 1142/1672 variables, 530/602 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1672 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 25 (OVERLAPS) 0/1672 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 602 constraints, problems are : Problem set: 0 solved, 165 unsolved in 38992 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-31 20:36:30] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:36:31] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 68/241 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-31 20:36:33] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 111/353 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 7/360 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 13/373 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 33/406 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 90/496 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/496 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 22/518 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 23 (OVERLAPS) 12/530 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/530 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 25 (OVERLAPS) 1142/1672 variables, 530/605 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1672 variables, 165/770 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 770 constraints, problems are : Problem set: 0 solved, 165 unsolved in 135028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 3/3 constraints]
After SMT, in 174124ms problems are : Problem set: 0 solved, 165 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1142/1142 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 530/530 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1142/1142 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-31 20:38:44] [INFO ] Invariant cache hit.
[2024-05-31 20:38:45] [INFO ] Implicit Places using invariants in 696 ms returned [255, 308, 329]
[2024-05-31 20:38:45] [INFO ] Actually due to overlaps returned [329, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 701 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 528/530 places, 1142/1142 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 528 transition count 1137
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 523 transition count 1137
Applied a total of 10 rules in 28 ms. Remains 523 /528 variables (removed 5) and now considering 1137/1142 (removed 5) transitions.
// Phase 1: matrix 1137 rows 523 cols
[2024-05-31 20:38:45] [INFO ] Computed 70 invariants in 20 ms
[2024-05-31 20:38:46] [INFO ] Implicit Places using invariants in 834 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 839 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/530 places, 1137/1142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 1136
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 521 transition count 1135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 520 transition count 1135
Applied a total of 4 rules in 56 ms. Remains 520 /522 variables (removed 2) and now considering 1135/1137 (removed 2) transitions.
// Phase 1: matrix 1135 rows 520 cols
[2024-05-31 20:38:46] [INFO ] Computed 69 invariants in 16 ms
[2024-05-31 20:38:47] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-31 20:38:47] [INFO ] Invariant cache hit.
[2024-05-31 20:38:48] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2317 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 520/530 places, 1135/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3959 ms. Remains : 520/530 places, 1135/1142 transitions.
RANDOM walk for 4000000 steps (72655 resets) in 64878 ms. (61 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 465 ms. (85 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (188 resets) in 581 ms. (68 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 472 ms. (84 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (171 resets) in 414 ms. (96 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 461 ms. (86 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 610 ms. (65 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (177 resets) in 522 ms. (76 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 589 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 657 ms. (60 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (182 resets) in 555 ms. (71 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (174 resets) in 623 ms. (64 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (184 resets) in 496 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (178 resets) in 509 ms. (78 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (171 resets) in 642 ms. (62 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (175 resets) in 520 ms. (76 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (177 resets) in 551 ms. (72 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 510 ms. (78 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (174 resets) in 474 ms. (84 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 431 ms. (92 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (188 resets) in 416 ms. (95 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 369 ms. (108 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (184 resets) in 547 ms. (72 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (185 resets) in 312 ms. (127 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (189 resets) in 539 ms. (74 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (169 resets) in 636 ms. (62 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (179 resets) in 511 ms. (78 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 380 ms. (104 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (173 resets) in 382 ms. (104 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (174 resets) in 448 ms. (89 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 425 ms. (93 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 576 ms. (69 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (174 resets) in 396 ms. (100 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (178 resets) in 387 ms. (103 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (177 resets) in 789 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 571 ms. (69 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (170 resets) in 597 ms. (66 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (179 resets) in 534 ms. (74 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (190 resets) in 499 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (178 resets) in 464 ms. (86 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (179 resets) in 425 ms. (93 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (173 resets) in 382 ms. (104 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 541 ms. (73 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 472 ms. (84 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (168 resets) in 484 ms. (82 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (177 resets) in 500 ms. (79 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (174 resets) in 596 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (178 resets) in 484 ms. (82 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (170 resets) in 443 ms. (90 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (180 resets) in 459 ms. (86 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 395 ms. (101 steps per ms) remains 165/165 properties
Interrupted probabilistic random walk after 1660301 steps, run timeout after 75001 ms. (steps per millisecond=22 ) properties seen :6 out of 165
Probabilistic random walk after 1660301 steps, saw 1086951 distinct states, run finished after 75001 ms. (steps per millisecond=22 ) properties seen :6
[2024-05-31 20:40:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 8/167 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 93/260 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 15/275 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 3/278 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 13/291 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 33/324 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 163/487 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 17 (OVERLAPS) 22/509 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 19 (OVERLAPS) 11/520 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 21 (OVERLAPS) 1135/1655 variables, 520/589 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1655 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 23 (OVERLAPS) 0/1655 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1655/1655 variables, and 589 constraints, problems are : Problem set: 0 solved, 159 unsolved in 50713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 8/167 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 20:41:21] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 93/260 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 20:41:24] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 15/275 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 3/278 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 13/291 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 33/324 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 17 (OVERLAPS) 163/487 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 19 (OVERLAPS) 22/509 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 21 (OVERLAPS) 11/520 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 23 (OVERLAPS) 1135/1655 variables, 520/592 constraints. Problems are: Problem set: 0 solved, 159 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
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="ASLink-PT-05a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ASLink-PT-05a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r466-smll-171620124300048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;