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.r012-smll-171620123800048.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-05a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123800048
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 23:15:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 23:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:15:28] [INFO ] Load time of PNML (sax parser for PT used): 389 ms
[2024-05-20 23:15:28] [INFO ] Transformed 1211 places.
[2024-05-20 23:15:28] [INFO ] Transformed 1827 transitions.
[2024-05-20 23:15:28] [INFO ] Found NUPN structural information;
[2024-05-20 23:15:28] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 582 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 (245 resets) in 5167 ms. (7 steps per ms) remains 354/1074 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 354/354 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 354/354 properties
// Phase 1: matrix 1808 rows 1211 cols
[2024-05-20 23:15:30] [INFO ] Computed 232 invariants in 283 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))
(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))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 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))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s539 (/ 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))
(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))
(s734 (/ 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))
(s869 (/ 1.0 2.0))
(s903 (/ 1.0 2.0))
(s904 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 354 unsolved
SMT process timed out in 5913ms, After SMT, problems are : Problem set: 0 solved, 354 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 354 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 7 places
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 1195 transition count 1729
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 174 place count 1116 transition count 1729
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 174 place count 1116 transition count 1632
Deduced a syphon composed of 97 places in 5 ms
Ensure Unique test removed 35 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 403 place count 984 transition count 1632
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 404 place count 984 transition count 1631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 405 place count 983 transition count 1631
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 408 place count 980 transition count 1615
Iterating global reduction 4 with 3 rules applied. Total rules applied 411 place count 980 transition count 1615
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 415 place count 979 transition count 1612
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 417 place count 977 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 976 transition count 1604
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 976 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 975 transition count 1596
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 975 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 974 transition count 1588
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 974 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 424 place count 973 transition count 1580
Iterating global reduction 6 with 1 rules applied. Total rules applied 425 place count 973 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 426 place count 972 transition count 1572
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 972 transition count 1572
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 971 transition count 1564
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 971 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 430 place count 970 transition count 1556
Iterating global reduction 6 with 1 rules applied. Total rules applied 431 place count 970 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 432 place count 969 transition count 1548
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 969 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 968 transition count 1540
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 968 transition count 1540
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 436 place count 967 transition count 1532
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 967 transition count 1532
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 438 place count 966 transition count 1524
Iterating global reduction 6 with 1 rules applied. Total rules applied 439 place count 966 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 965 transition count 1516
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 965 transition count 1516
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 964 transition count 1508
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 964 transition count 1508
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 444 place count 963 transition count 1500
Iterating global reduction 6 with 1 rules applied. Total rules applied 445 place count 963 transition count 1500
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 446 place count 962 transition count 1492
Iterating global reduction 6 with 1 rules applied. Total rules applied 447 place count 962 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 961 transition count 1484
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 961 transition count 1484
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 497 place count 937 transition count 1460
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 500 place count 937 transition count 1457
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 503 place count 934 transition count 1457
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 504 place count 934 transition count 1457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 505 place count 933 transition count 1456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 506 place count 932 transition count 1456
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 506 place count 932 transition count 1453
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 512 place count 929 transition count 1453
Applied a total of 512 rules in 1265 ms. Remains 929 /1211 variables (removed 282) and now considering 1453/1808 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1283 ms. Remains : 929/1211 places, 1453/1808 transitions.
RANDOM walk for 4000000 steps (42272 resets) in 109773 ms. (36 steps per ms) remains 253/354 properties
BEST_FIRST walk for 40003 steps (82 resets) in 279 ms. (142 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (80 resets) in 232 ms. (171 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (79 resets) in 228 ms. (174 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (81 resets) in 223 ms. (178 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (85 resets) in 225 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (84 resets) in 220 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (87 resets) in 228 ms. (174 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (83 resets) in 213 ms. (186 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (83 resets) in 225 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (80 resets) in 237 ms. (168 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (82 resets) in 209 ms. (190 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (85 resets) in 213 ms. (186 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (80 resets) in 220 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (80 resets) in 225 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (79 resets) in 236 ms. (168 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (83 resets) in 227 ms. (175 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (85 resets) in 232 ms. (171 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (83 resets) in 216 ms. (184 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (87 resets) in 203 ms. (196 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (86 resets) in 224 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (84 resets) in 216 ms. (184 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (82 resets) in 220 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (79 resets) in 223 ms. (178 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (84 resets) in 209 ms. (190 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (77 resets) in 234 ms. (170 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (82 resets) in 292 ms. (136 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (85 resets) in 218 ms. (182 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (77 resets) in 228 ms. (174 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (86 resets) in 211 ms. (188 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (87 resets) in 220 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (80 resets) in 224 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (83 resets) in 224 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (79 resets) in 232 ms. (171 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (79 resets) in 222 ms. (179 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (81 resets) in 273 ms. (146 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (82 resets) in 227 ms. (175 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (78 resets) in 241 ms. (165 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (80 resets) in 236 ms. (168 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (90 resets) in 225 ms. (177 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (83 resets) in 289 ms. (137 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (76 resets) in 301 ms. (132 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (84 resets) in 285 ms. (139 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (78 resets) in 294 ms. (135 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (84 resets) in 276 ms. (144 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (84 resets) in 227 ms. (175 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (86 resets) in 233 ms. (170 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (82 resets) in 254 ms. (156 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (84 resets) in 233 ms. (170 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40004 steps (84 resets) in 220 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (78 resets) in 249 ms. (160 steps per ms) remains 253/253 properties
// Phase 1: matrix 1453 rows 929 cols
[2024-05-20 23:16:09] [INFO ] Computed 179 invariants in 116 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 30/283 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 238/523 variables, 40/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 10/533 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (OVERLAPS) 183/716 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 13 (OVERLAPS) 83/799 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 15 (OVERLAPS) 8/807 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/807 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 17 (OVERLAPS) 120/927 variables, 34/177 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/2382 variables, and 177 constraints, problems are : Problem set: 0 solved, 253 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 118/120 constraints, State Equation: 0/929 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 30/283 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 238/523 variables, 40/89 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-20 23:17:05] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 32 ms to minimize.
[2024-05-20 23:17:06] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 4 ms to minimize.
[2024-05-20 23:17:07] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 5 ms to minimize.
[2024-05-20 23:17:09] [INFO ] Deduced a trap composed of 34 places in 326 ms of which 13 ms to minimize.
[2024-05-20 23:17:10] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 4 ms to minimize.
[2024-05-20 23:17:11] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 10/533 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (OVERLAPS) 183/716 variables, 29/133 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/716 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 14 (OVERLAPS) 83/799 variables, 13/146 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s328 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s479 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 1)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s629 0)
(s631 0)
(s632 0)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 1)
(s642 0)
(s644 0)
(s646 0)
(s648 0)
(s650 0)
(s652 0)
(s654 0)
(s656 0)
(s658 0)
(s659 1)
(s661 0)
(s663 0)
(s665 0)
(s667 1)
(s669 0)
(s671 0)
(s673 0)
(s675 0)
(s677 1)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s717 0)
(s719 0)
(s721 0)
(s723 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s732 0)
(s734 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 1)
(s759 0)
(s762 0)
(s763 0)
(s773 1)
(s774 0)
(s775 0)
(s776 1)
(s777 1)
(s778 0)
(s780 0)
(s782 0)
(s784 0)
(s786 0)
(s788 0)
(s790 0)
(s792 0)
(s794 0)
(s821 1)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s835 0)
(s836 0)
(s837 0)
(s841 0)
(s842 0)
(s843 0)
(s847 0)
(s848 0)
(s849 0)
(s853 0)
(s854 0)
(s855 0)
(s859 0)
(s860 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/2382 variables, and 146 constraints, problems are : Problem set: 0 solved, 253 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 56/59 constraints, Generalized P Invariants (flows): 84/120 constraints, State Equation: 0/929 constraints, PredecessorRefiner: 0/253 constraints, Known Traps: 6/6 constraints]
After SMT, in 90307ms problems are : Problem set: 0 solved, 253 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 253 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1453/1453 transitions.
Ensure Unique test removed 3 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 7 rules applied. Total rules applied 7 place count 926 transition count 1449
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 920 transition count 1449
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 920 transition count 1445
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 916 transition count 1445
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 914 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 913 transition count 1439
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 913 transition count 1439
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 49 place count 901 transition count 1427
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 899 transition count 1425
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 899 transition count 1425
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 899 transition count 1423
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 897 transition count 1422
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 59 place count 897 transition count 1422
Applied a total of 59 rules in 398 ms. Remains 897 /929 variables (removed 32) and now considering 1422/1453 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 897/929 places, 1422/1453 transitions.
RANDOM walk for 4000000 steps (47484 resets) in 92824 ms. (43 steps per ms) remains 251/253 properties
BEST_FIRST walk for 40002 steps (91 resets) in 273 ms. (145 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (89 resets) in 271 ms. (147 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 428 ms. (93 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (94 resets) in 384 ms. (103 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (93 resets) in 372 ms. (107 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (88 resets) in 376 ms. (106 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (87 resets) in 458 ms. (87 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (95 resets) in 400 ms. (99 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 485 ms. (82 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (92 resets) in 497 ms. (80 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (91 resets) in 429 ms. (93 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (92 resets) in 410 ms. (97 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (85 resets) in 432 ms. (92 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 594 ms. (67 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (97 resets) in 406 ms. (98 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (82 resets) in 445 ms. (89 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (89 resets) in 395 ms. (101 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 412 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (82 resets) in 422 ms. (94 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (94 resets) in 487 ms. (81 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (87 resets) in 574 ms. (69 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 471 ms. (84 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (87 resets) in 448 ms. (89 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (88 resets) in 414 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 382 ms. (104 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (90 resets) in 424 ms. (94 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (83 resets) in 442 ms. (90 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (97 resets) in 338 ms. (118 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (91 resets) in 453 ms. (88 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (90 resets) in 447 ms. (89 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 636 ms. (62 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 412 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (92 resets) in 364 ms. (109 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (93 resets) in 381 ms. (104 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (88 resets) in 366 ms. (109 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (90 resets) in 470 ms. (84 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (89 resets) in 455 ms. (87 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (92 resets) in 511 ms. (78 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (89 resets) in 397 ms. (100 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (84 resets) in 407 ms. (98 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (85 resets) in 390 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (84 resets) in 423 ms. (94 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (86 resets) in 391 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (87 resets) in 577 ms. (69 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (85 resets) in 440 ms. (90 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (90 resets) in 308 ms. (129 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (90 resets) in 470 ms. (84 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (86 resets) in 427 ms. (93 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (84 resets) in 391 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (91 resets) in 398 ms. (100 steps per ms) remains 251/251 properties
Interrupted probabilistic random walk after 2388705 steps, run timeout after 93001 ms. (steps per millisecond=25 ) properties seen :16 out of 251
Probabilistic random walk after 2388705 steps, saw 806457 distinct states, run finished after 93011 ms. (steps per millisecond=25 ) properties seen :16
// Phase 1: matrix 1422 rows 897 cols
[2024-05-20 23:19:44] [INFO ] Computed 172 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 24/259 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/260 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 160/420 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 10/430 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 150/580 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 31/611 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 121/732 variables, 14/132 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/732 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 17 (OVERLAPS) 57/789 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/789 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 19 (OVERLAPS) 6/795 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/795 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 21 (OVERLAPS) 101/896 variables, 28/171 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/896 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 23 (OVERLAPS) 1/897 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/897 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 25 (OVERLAPS) 1422/2319 variables, 897/1069 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2319/2319 variables, and 1069 constraints, problems are : Problem set: 0 solved, 235 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 897/897 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 24/259 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/260 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 160/420 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-20 23:21:05] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 5 ms to minimize.
[2024-05-20 23:21:05] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:21:06] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:21:07] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-20 23:21:11] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 10/430 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 150/580 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 31/611 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 17 (OVERLAPS) 121/732 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/732 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 19 (OVERLAPS) 57/789 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/789 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 21 (OVERLAPS) 6/795 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/795 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 23 (OVERLAPS) 101/896 variables, 28/176 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/896 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 25 (OVERLAPS) 1/897 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2319 variables, and 177 constraints, problems are : Problem set: 0 solved, 235 unsolved in 75038 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 0/235 constraints, Known Traps: 5/5 constraints]
After SMT, in 150195ms problems are : Problem set: 0 solved, 235 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 235 out of 897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 897/897 places, 1422/1422 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 896 transition count 1418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 891 transition count 1418
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 891 transition count 1414
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 885 transition count 1414
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 884 transition count 1414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 883 transition count 1413
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 882 transition count 1412
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 882 transition count 1412
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 882 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 881 transition count 1411
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 28 place count 881 transition count 1411
Applied a total of 28 rules in 208 ms. Remains 881 /897 variables (removed 16) and now considering 1411/1422 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 881/897 places, 1411/1422 transitions.
RANDOM walk for 4000000 steps (47866 resets) in 87198 ms. (45 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (89 resets) in 255 ms. (156 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (87 resets) in 384 ms. (103 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (88 resets) in 307 ms. (129 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (85 resets) in 370 ms. (107 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (94 resets) in 290 ms. (137 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (88 resets) in 375 ms. (106 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (86 resets) in 554 ms. (72 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (83 resets) in 506 ms. (78 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (86 resets) in 448 ms. (89 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (83 resets) in 454 ms. (87 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (91 resets) in 329 ms. (121 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (87 resets) in 510 ms. (78 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (90 resets) in 318 ms. (125 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (90 resets) in 327 ms. (121 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (88 resets) in 476 ms. (83 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (92 resets) in 360 ms. (110 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (82 resets) in 498 ms. (80 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (88 resets) in 478 ms. (83 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (89 resets) in 477 ms. (83 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (85 resets) in 451 ms. (88 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (90 resets) in 406 ms. (98 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (92 resets) in 439 ms. (90 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (86 resets) in 521 ms. (76 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (90 resets) in 432 ms. (92 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (96 resets) in 443 ms. (90 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (89 resets) in 467 ms. (85 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (85 resets) in 418 ms. (95 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (95 resets) in 390 ms. (102 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (88 resets) in 474 ms. (84 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (89 resets) in 437 ms. (91 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40001 steps (86 resets) in 372 ms. (107 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (91 resets) in 431 ms. (92 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (87 resets) in 341 ms. (116 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (89 resets) in 370 ms. (107 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (88 resets) in 393 ms. (101 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (92 resets) in 361 ms. (110 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (87 resets) in 422 ms. (94 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (87 resets) in 448 ms. (89 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (85 resets) in 357 ms. (111 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (89 resets) in 380 ms. (104 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (88 resets) in 379 ms. (105 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (90 resets) in 380 ms. (104 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (90 resets) in 350 ms. (113 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (92 resets) in 327 ms. (121 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (93 resets) in 312 ms. (127 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (86 resets) in 362 ms. (110 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (93 resets) in 419 ms. (95 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (92 resets) in 457 ms. (87 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (90 resets) in 376 ms. (106 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (87 resets) in 428 ms. (93 steps per ms) remains 235/235 properties
Interrupted probabilistic random walk after 2511961 steps, run timeout after 87001 ms. (steps per millisecond=28 ) properties seen :0 out of 235
Probabilistic random walk after 2511961 steps, saw 794946 distinct states, run finished after 87003 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 1411 rows 881 cols
[2024-05-20 23:24:11] [INFO ] Computed 167 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 24/259 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/260 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 157/417 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 5/422 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 98/520 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 7/527 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 57/584 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/584 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 17 (OVERLAPS) 21/605 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/605 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 19 (OVERLAPS) 15/620 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/620 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 21 (OVERLAPS) 4/624 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 23 (OVERLAPS) 142/766 variables, 19/136 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/766 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 25 (OVERLAPS) 45/811 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/811 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 27 (OVERLAPS) 68/879 variables, 23/165 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/879 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 29 (OVERLAPS) 1/880 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/2292 variables, and 166 constraints, problems are : Problem set: 0 solved, 235 unsolved in 90020 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 114/115 constraints, State Equation: 0/881 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 24/259 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/260 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 157/417 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-20 23:25:50] [INFO ] Deduced a trap composed of 44 places in 397 ms of which 6 ms to minimize.
[2024-05-20 23:25:50] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 3 ms to minimize.
[2024-05-20 23:25:52] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-20 23:25:53] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-20 23:25:59] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 5/422 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 98/520 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 7/527 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 17 (OVERLAPS) 57/584 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/584 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 19 (OVERLAPS) 21/605 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/605 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 21 (OVERLAPS) 15/620 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 23 (OVERLAPS) 4/624 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/624 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 25 (OVERLAPS) 142/766 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/766 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 27 (OVERLAPS) 45/811 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/811 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 29 (OVERLAPS) 68/879 variables, 23/170 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/879 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 31 (OVERLAPS) 1/880 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 880/2292 variables, and 171 constraints, problems are : Problem set: 0 solved, 235 unsolved in 90032 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 114/115 constraints, State Equation: 0/881 constraints, PredecessorRefiner: 0/235 constraints, Known Traps: 5/5 constraints]
After SMT, in 180175ms problems are : Problem set: 0 solved, 235 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 235 out of 881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 1411/1411 transitions.
Applied a total of 0 rules in 26 ms. Remains 881 /881 variables (removed 0) and now considering 1411/1411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 881/881 places, 1411/1411 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 1411/1411 transitions.
Applied a total of 0 rules in 36 ms. Remains 881 /881 variables (removed 0) and now considering 1411/1411 (removed 0) transitions.
[2024-05-20 23:27:11] [INFO ] Invariant cache hit.
[2024-05-20 23:27:13] [INFO ] Implicit Places using invariants in 1328 ms returned [20, 53, 71, 163, 180, 185, 186, 206, 224, 316, 330, 334, 335, 355, 373, 464, 478, 482, 483, 484, 502, 520, 539, 589, 590, 601, 602, 603, 621, 639, 708, 712, 713, 716, 727, 728, 729, 747, 749, 752, 770, 771, 772, 773, 785, 791, 797, 803, 809, 815, 821, 827, 833, 839, 845]
[2024-05-20 23:27:13] [INFO ] Actually due to overlaps returned [747, 729, 53, 206, 355, 502, 603, 621, 752, 484, 186, 335, 483, 602, 728, 771, 185, 334, 482, 601, 727, 749, 770, 20, 316, 464, 589, 590, 712, 713, 71, 180, 224, 330, 373, 478, 639, 773, 815, 833, 845, 163, 520, 539, 716, 772, 785, 791, 797, 803, 809, 821, 827, 839]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1354 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 827/881 places, 1411/1411 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 826 transition count 1334
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 749 transition count 1334
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 155 place count 749 transition count 1307
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 210 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 222 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 230 place count 709 transition count 1299
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 245 place count 694 transition count 1284
Iterating global reduction 4 with 15 rules applied. Total rules applied 260 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 263 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 263 place count 694 transition count 1280
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 693 transition count 1280
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 268 place count 690 transition count 1277
Iterating global reduction 5 with 3 rules applied. Total rules applied 271 place count 690 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 272 place count 689 transition count 1276
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 689 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 274 place count 688 transition count 1275
Iterating global reduction 5 with 1 rules applied. Total rules applied 275 place count 688 transition count 1275
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 355 place count 648 transition count 1235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 648 transition count 1233
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 647 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 647 transition count 1232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 360 place count 647 transition count 1231
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 371 place count 647 transition count 1220
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 383 place count 635 transition count 1220
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 398 place count 635 transition count 1220
Applied a total of 398 rules in 256 ms. Remains 635 /827 variables (removed 192) and now considering 1220/1411 (removed 191) transitions.
// Phase 1: matrix 1220 rows 635 cols
[2024-05-20 23:27:13] [INFO ] Computed 106 invariants in 13 ms
[2024-05-20 23:27:14] [INFO ] Implicit Places using invariants in 792 ms returned [122, 128, 131, 133, 134, 155, 156, 251, 257, 260, 262, 263, 281, 282, 376, 382, 385, 387, 388, 404, 405, 475, 481, 484, 486, 491, 492, 544, 561, 567, 570, 572]
[2024-05-20 23:27:14] [INFO ] Actually due to overlaps returned [155, 281, 404, 491, 156, 282, 405, 492, 122, 128, 133, 251, 257, 262, 376, 382, 387, 475, 481, 486, 561, 567, 572, 134, 263, 388, 544]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 796 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 608/881 places, 1220/1411 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 587 transition count 1199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 587 transition count 1199
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 582 transition count 1194
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 582 transition count 1194
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 576 transition count 1188
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 576 transition count 1170
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 100 place count 558 transition count 1170
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 558 transition count 1169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 557 transition count 1169
Applied a total of 102 rules in 83 ms. Remains 557 /608 variables (removed 51) and now considering 1169/1220 (removed 51) transitions.
// Phase 1: matrix 1169 rows 557 cols
[2024-05-20 23:27:14] [INFO ] Computed 79 invariants in 17 ms
[2024-05-20 23:27:14] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-20 23:27:14] [INFO ] Invariant cache hit.
[2024-05-20 23:27:16] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 557/881 places, 1169/1411 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4301 ms. Remains : 557/881 places, 1169/1411 transitions.
RANDOM walk for 4000000 steps (70689 resets) in 84758 ms. (47 steps per ms) remains 233/235 properties
BEST_FIRST walk for 40003 steps (166 resets) in 326 ms. (122 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (158 resets) in 464 ms. (86 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (172 resets) in 513 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (179 resets) in 477 ms. (83 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (167 resets) in 433 ms. (92 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (170 resets) in 480 ms. (83 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (160 resets) in 475 ms. (84 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (182 resets) in 462 ms. (86 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (163 resets) in 710 ms. (56 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (163 resets) in 759 ms. (52 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (171 resets) in 357 ms. (111 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (177 resets) in 456 ms. (87 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (180 resets) in 453 ms. (88 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (162 resets) in 587 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (177 resets) in 423 ms. (94 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (170 resets) in 587 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (174 resets) in 414 ms. (96 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (166 resets) in 652 ms. (61 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (171 resets) in 583 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (173 resets) in 492 ms. (81 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (174 resets) in 488 ms. (81 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (168 resets) in 613 ms. (65 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (164 resets) in 551 ms. (72 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (174 resets) in 483 ms. (82 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (170 resets) in 506 ms. (78 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (166 resets) in 681 ms. (58 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (165 resets) in 611 ms. (65 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (171 resets) in 525 ms. (76 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (173 resets) in 435 ms. (91 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (163 resets) in 469 ms. (85 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (172 resets) in 477 ms. (83 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (169 resets) in 514 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40000 steps (176 resets) in 488 ms. (81 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (168 resets) in 457 ms. (87 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (173 resets) in 549 ms. (72 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (166 resets) in 565 ms. (70 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (168 resets) in 543 ms. (73 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (169 resets) in 585 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (157 resets) in 594 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (165 resets) in 597 ms. (66 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (169 resets) in 535 ms. (74 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40000 steps (169 resets) in 520 ms. (76 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (165 resets) in 521 ms. (76 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (170 resets) in 523 ms. (76 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (167 resets) in 513 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (170 resets) in 453 ms. (88 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (171 resets) in 571 ms. (69 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (166 resets) in 475 ms. (84 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (171 resets) in 585 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (176 resets) in 491 ms. (81 steps per ms) remains 233/233 properties
Interrupted probabilistic random walk after 2458607 steps, run timeout after 90001 ms. (steps per millisecond=27 ) properties seen :52 out of 233
Probabilistic random walk after 2458607 steps, saw 1179274 distinct states, run finished after 90001 ms. (steps per millisecond=27 ) properties seen :52
[2024-05-20 23:29:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 26/207 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 120/327 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 10/337 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 137/474 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 34/508 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (OVERLAPS) 49/557 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (OVERLAPS) 1169/1726 variables, 557/636 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1726 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (OVERLAPS) 0/1726 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1726/1726 variables, and 636 constraints, problems are : Problem set: 0 solved, 181 unsolved in 53657 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 26/207 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-20 23:30:12] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:30:13] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 120/327 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-20 23:30:19] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-20 23:30:20] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 10/337 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 137/474 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 34/508 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-20 23:30:34] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (OVERLAPS) 49/557 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 19 (OVERLAPS) 1169/1726 variables, 557/641 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1726 variables, 181/822 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1726/1726 variables, and 822 constraints, problems are : Problem set: 0 solved, 181 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
After SMT, in 158748ms problems are : Problem set: 0 solved, 181 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 181 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1169/1169 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 554 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 550 transition count 1166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 550 transition count 1163
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 547 transition count 1163
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 19 place count 546 transition count 1161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 544 transition count 1161
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 24 place count 541 transition count 1153
Iterating global reduction 4 with 3 rules applied. Total rules applied 27 place count 541 transition count 1153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 541 transition count 1152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 30 place count 540 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 31 place count 540 transition count 1150
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 32 place count 540 transition count 1150
Applied a total of 32 rules in 104 ms. Remains 540 /557 variables (removed 17) and now considering 1150/1169 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 540/557 places, 1150/1169 transitions.
RANDOM walk for 2998603 steps (54375 resets) in 120005 ms. (24 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (161 resets) in 590 ms. (67 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (181 resets) in 550 ms. (72 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (178 resets) in 602 ms. (66 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (179 resets) in 576 ms. (69 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (184 resets) in 443 ms. (90 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (180 resets) in 423 ms. (94 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (186 resets) in 453 ms. (88 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (180 resets) in 489 ms. (81 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (183 resets) in 384 ms. (103 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (173 resets) in 482 ms. (82 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (172 resets) in 497 ms. (80 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (173 resets) in 553 ms. (72 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (172 resets) in 510 ms. (78 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (185 resets) in 541 ms. (73 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (178 resets) in 463 ms. (86 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (179 resets) in 465 ms. (85 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (169 resets) in 524 ms. (76 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (182 resets) in 435 ms. (91 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (183 resets) in 455 ms. (87 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (191 resets) in 459 ms. (86 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (183 resets) in 399 ms. (100 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (187 resets) in 419 ms. (95 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (176 resets) in 577 ms. (69 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (181 resets) in 425 ms. (93 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (179 resets) in 458 ms. (87 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (184 resets) in 482 ms. (82 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (184 resets) in 581 ms. (68 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (164 resets) in 579 ms. (68 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40001 steps (178 resets) in 486 ms. (82 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (185 resets) in 479 ms. (83 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40001 steps (184 resets) in 457 ms. (87 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (174 resets) in 507 ms. (78 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (178 resets) in 434 ms. (91 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40000 steps (169 resets) in 434 ms. (91 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (177 resets) in 465 ms. (85 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (180 resets) in 490 ms. (81 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (181 resets) in 465 ms. (85 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (176 resets) in 398 ms. (100 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (171 resets) in 516 ms. (77 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (180 resets) in 447 ms. (89 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (177 resets) in 500 ms. (79 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (182 resets) in 505 ms. (79 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (186 resets) in 480 ms. (83 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40001 steps (170 resets) in 478 ms. (83 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (183 resets) in 445 ms. (89 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (189 resets) in 394 ms. (101 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (186 resets) in 475 ms. (84 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (188 resets) in 463 ms. (86 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (177 resets) in 427 ms. (93 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (183 resets) in 400 ms. (99 steps per ms) remains 181/181 properties
Interrupted probabilistic random walk after 3975625 steps, run timeout after 111001 ms. (steps per millisecond=35 ) properties seen :26 out of 181
Probabilistic random walk after 3975625 steps, saw 1445115 distinct states, run finished after 111002 ms. (steps per millisecond=35 ) properties seen :26
// Phase 1: matrix 1150 rows 540 cols
[2024-05-20 23:34:24] [INFO ] Computed 74 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 8/163 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 78/241 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 115/357 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 4/361 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 96/457 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 15 (OVERLAPS) 34/491 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 17 (OVERLAPS) 49/540 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 19 (OVERLAPS) 1150/1690 variables, 540/614 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1690 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 21 (OVERLAPS) 0/1690 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 614 constraints, problems are : Problem set: 0 solved, 155 unsolved in 37459 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 8/163 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 23:35:03] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:35:03] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 78/241 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 23:35:07] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 115/357 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 4/361 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 15 (OVERLAPS) 96/457 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 17 (OVERLAPS) 34/491 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 19 (OVERLAPS) 49/540 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/540 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 21 (OVERLAPS) 1150/1690 variables, 540/617 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1690 variables, 155/772 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 772 constraints, problems are : Problem set: 0 solved, 155 unsolved in 120025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 3/3 constraints]
After SMT, in 157546ms problems are : Problem set: 0 solved, 155 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1150/1150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 540 transition count 1146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 536 transition count 1146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 536 transition count 1141
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 529 transition count 1141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 529 transition count 1140
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 22 place count 528 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 527 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 527 transition count 1134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 526 transition count 1133
Applied a total of 26 rules in 68 ms. Remains 526 /540 variables (removed 14) and now considering 1133/1150 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 526/540 places, 1133/1150 transitions.
RANDOM walk for 3257462 steps (59166 resets) in 120004 ms. (27 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (168 resets) in 455 ms. (87 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (170 resets) in 435 ms. (91 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (175 resets) in 381 ms. (104 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (177 resets) in 391 ms. (102 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (180 resets) in 462 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (183 resets) in 473 ms. (84 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (191 resets) in 393 ms. (101 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (177 resets) in 551 ms. (72 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (179 resets) in 280 ms. (142 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (177 resets) in 396 ms. (100 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (185 resets) in 386 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (177 resets) in 416 ms. (95 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (188 resets) in 444 ms. (89 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (182 resets) in 395 ms. (101 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (174 resets) in 493 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (182 resets) in 366 ms. (109 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (186 resets) in 345 ms. (115 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (178 resets) in 728 ms. (54 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (174 resets) in 560 ms. (71 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (180 resets) in 523 ms. (76 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (174 resets) in 498 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (179 resets) in 385 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (187 resets) in 499 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (177 resets) in 597 ms. (66 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (164 resets) in 519 ms. (76 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (182 resets) in 514 ms. (77 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (165 resets) in 344 ms. (115 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (185 resets) in 418 ms. (95 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (176 resets) in 439 ms. (90 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (176 resets) in 495 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (188 resets) in 373 ms. (106 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (180 resets) in 411 ms. (97 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (178 resets) in 509 ms. (78 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (183 resets) in 384 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (177 resets) in 342 ms. (116 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (185 resets) in 298 ms. (133 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (176 resets) in 426 ms. (93 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (187 resets) in 475 ms. (84 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (185 resets) in 360 ms. (110 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (179 resets) in 474 ms. (84 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (193 resets) in 331 ms. (120 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (176 resets) in 520 ms. (76 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (180 resets) in 389 ms. (102 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (188 resets) in 433 ms. (92 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (183 resets) in 358 ms. (111 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (171 resets) in 355 ms. (112 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (179 resets) in 520 ms. (76 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (171 resets) in 325 ms. (122 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (183 resets) in 514 ms. (77 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (180 resets) in 360 ms. (110 steps per ms) remains 155/155 properties
Interrupted probabilistic random walk after 3504332 steps, run timeout after 111001 ms. (steps per millisecond=31 ) properties seen :47 out of 155
Probabilistic random walk after 3504332 steps, saw 1599246 distinct states, run finished after 111001 ms. (steps per millisecond=31 ) properties seen :47
// Phase 1: matrix 1133 rows 526 cols
[2024-05-20 23:39:29] [INFO ] Computed 72 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 23/131 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 99/230 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 4/234 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 108/342 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 7/349 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 13/362 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 33/395 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 97/492 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (OVERLAPS) 18/510 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/510 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 21 (OVERLAPS) 16/526 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 23 (OVERLAPS) 1133/1659 variables, 526/598 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1659 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 25 (OVERLAPS) 0/1659 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1659/1659 variables, and 598 constraints, problems are : Problem set: 0 solved, 108 unsolved in 26840 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 23/131 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 23:39:57] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-20 23:39:58] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 99/230 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 4/234 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 108/342 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 7/349 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 13/362 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 33/395 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (OVERLAPS) 97/492 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/492 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 20 (OVERLAPS) 18/510 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/510 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 22 (OVERLAPS) 16/526 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 24 (OVERLAPS) 1133/1659 variables, 526/600 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1659 variables, 108/708 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1659/1659 variables, and 708 constraints, problems are : Problem set: 0 solved, 108 unsolved in 135025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
After SMT, in 161921ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1133/1133 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 523 transition count 1130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 519 transition count 1130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 519 transition count 1127
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 516 transition count 1127
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 19 place count 515 transition count 1125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 513 transition count 1125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 23 place count 511 transition count 1123
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 511 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 511 transition count 1122
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 28 place count 510 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 29 place count 510 transition count 1120
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 30 place count 510 transition count 1120
Applied a total of 30 rules in 59 ms. Remains 510 /526 variables (removed 16) and now considering 1120/1133 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 510/526 places, 1120/1133 transitions.
RANDOM walk for 3901252 steps (72420 resets) in 115353 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (194 resets) in 452 ms. (88 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (196 resets) in 416 ms. (95 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (192 resets) in 435 ms. (91 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (190 resets) in 470 ms. (84 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (194 resets) in 298 ms. (133 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (188 resets) in 319 ms. (125 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (188 resets) in 392 ms. (101 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (179 resets) in 459 ms. (86 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (188 resets) in 470 ms. (84 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (185 resets) in 685 ms. (58 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (182 resets) in 501 ms. (79 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (188 resets) in 326 ms. (122 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (193 resets) in 481 ms. (82 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (192 resets) in 427 ms. (93 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (190 resets) in 337 ms. (118 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (199 resets) in 407 ms. (98 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (190 resets) in 396 ms. (100 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (185 resets) in 438 ms. (91 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (184 resets) in 330 ms. (120 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (176 resets) in 446 ms. (89 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (192 resets) in 411 ms. (97 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (181 resets) in 463 ms. (86 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (197 resets) in 391 ms. (102 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (190 resets) in 539 ms. (74 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (185 resets) in 531 ms. (75 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (192 resets) in 318 ms. (125 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (192 resets) in 372 ms. (107 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (192 resets) in 451 ms. (88 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (196 resets) in 419 ms. (95 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (194 resets) in 566 ms. (70 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (185 resets) in 455 ms. (87 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (201 resets) in 371 ms. (107 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (191 resets) in 396 ms. (100 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (186 resets) in 438 ms. (91 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (191 resets) in 297 ms. (134 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (184 resets) in 289 ms. (137 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (188 resets) in 288 ms. (138 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (190 resets) in 345 ms. (115 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (182 resets) in 372 ms. (107 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (196 resets) in 521 ms. (76 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (183 resets) in 352 ms. (113 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (179 resets) in 485 ms. (82 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (188 resets) in 475 ms. (84 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (185 resets) in 469 ms. (85 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (183 resets) in 479 ms. (83 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (190 resets) in 511 ms. (78 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (188 resets) in 488 ms. (81 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (185 resets) in 407 ms. (98 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (196 resets) in 333 ms. (119 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (177 resets) in 381 ms. (104 steps per ms) remains 108/108 properties
Interrupted probabilistic random walk after 3950054 steps, run timeout after 111001 ms. (steps per millisecond=35 ) properties seen :63 out of 108
Probabilistic random walk after 3950054 steps, saw 1417815 distinct states, run finished after 111004 ms. (steps per millisecond=35 ) properties seen :63
// Phase 1: matrix 1120 rows 510 cols
[2024-05-20 23:44:40] [INFO ] Computed 67 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 16/61 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 127/188 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/189 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 137/326 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 7/333 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 13/346 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 33/379 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (OVERLAPS) 98/477 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (OVERLAPS) 22/499 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 20 (OVERLAPS) 11/510 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/510 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 22 (OVERLAPS) 1120/1630 variables, 510/577 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1630 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 24 (OVERLAPS) 0/1630 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1630/1630 variables, and 577 constraints, problems are : Problem set: 0 solved, 45 unsolved in 9902 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 16/61 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 127/188 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-20 23:44:50] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 137/326 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 7/333 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 13/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (OVERLAPS) 33/379 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (OVERLAPS) 98/477 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 19 (OVERLAPS) 22/499 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 21 (OVERLAPS) 11/510 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/510 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 23 (OVERLAPS) 1120/1630 variables, 510/578 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1630 variables, 45/623 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1630 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 26 (OVERLAPS) 0/1630 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1630/1630 variables, and 623 constraints, problems are : Problem set: 0 solved, 45 unsolved in 19194 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 29134ms problems are : Problem set: 0 solved, 45 unsolved
Fused 45 Parikh solutions to 39 different solutions.

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="greatspnxred"
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 greatspnxred"
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 r012-smll-171620123800048"
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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;