fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r516-tajo-171654447000402
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PolyORBNT-COL-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 680308.00 0.00 0.00 ????T???T?TT???T normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447000402.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-COL-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447000402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258580469

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:16:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:16:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:16:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:16:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2024-06-01 16:16:22] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-06-01 16:16:22] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-06-01 16:16:22] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40013 steps (2282 resets) in 1473 ms. (27 steps per ms) remains 13/30 properties
BEST_FIRST walk for 40002 steps (801 resets) in 431 ms. (92 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40003 steps (816 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (798 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40005 steps (814 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (986 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (653 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:16:23] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 16:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/33 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 48/86 variables, and 13 constraints, problems are : Problem set: 5 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-COL-S10J20-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:23] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:16:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S10J20-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:23] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:16:23] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 247 ms.
[2024-06-01 16:16:23] [INFO ] Unfolded 13 HLPN properties in 11 ms.
[2024-06-01 16:16:23] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:16:23] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:16:23] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:16:23] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 16:16:23] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 16:16:23] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:16:24] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 16:16:24] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:16:24] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 20 places in 21 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 451 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 39 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-06-01 16:16:24] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-06-01 16:16:24] [INFO ] Computed 72 invariants in 92 ms
[2024-06-01 16:16:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
SMT process timed out in 36699ms, After SMT, problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 36731ms
[2024-06-01 16:17:00] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:17:00] [INFO ] Invariant cache hit.
[2024-06-01 16:17:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 16:17:01] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:17:01] [INFO ] Invariant cache hit.
[2024-06-01 16:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:17:01] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Running 1639 sub problems to find dead transitions.
[2024-06-01 16:17:01] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:17:01] [INFO ] Invariant cache hit.
[2024-06-01 16:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1146 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/472 variables, 19/70 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/70 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1092 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/474 variables, 2/72 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/2115 variables, and 72 constraints, problems are : Problem set: 615 solved, 1024 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
At refinement iteration 3 (OVERLAPS) 19/472 variables, 19/70 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/71 constraints. Problems are: Problem set: 615 solved, 1024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2115 variables, and 71 constraints, problems are : Problem set: 615 solved, 1024 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 77153ms problems are : Problem set: 615 solved, 1024 unsolved
Search for dead transitions found 615 dead transitions in 77192ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 6 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114935 ms. Remains : 474/474 places, 1035/1650 transitions.
Support contains 451 out of 474 places after structural reductions.
[2024-06-01 16:18:19] [INFO ] Flatten gal took : 200 ms
[2024-06-01 16:18:20] [INFO ] Flatten gal took : 183 ms
[2024-06-01 16:18:21] [INFO ] Input system was already deterministic with 1035 transitions.
Reduction of identical properties reduced properties to check from 50 to 48
RANDOM walk for 40000 steps (2241 resets) in 10995 ms. (3 steps per ms) remains 34/48 properties
BEST_FIRST walk for 4002 steps (40 resets) in 163 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 157 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 164 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (41 resets) in 160 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 165 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 349 ms. (11 steps per ms) remains 22/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 9/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 6/9 properties
BEST_FIRST walk for 4002 steps (39 resets) in 33 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (42 resets) in 23 ms. (166 steps per ms) remains 6/6 properties
[2024-06-01 16:18:24] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2024-06-01 16:18:24] [INFO ] Computed 72 invariants in 22 ms
[2024-06-01 16:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/446 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/45 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/468 variables, 22/67 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 225 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 4/71 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 229 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 231 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 247 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 231 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 5/76 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 8 (OVERLAPS) 6/474 variables, 5/81 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 10 (OVERLAPS) 1026/1500 variables, 474/555 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1500 variables, 1/556 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1500 variables, 0/556 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1500 variables, 0/556 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 556 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 167/171 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/215 variables, 23/25 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 210/425 variables, 21/46 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/461 variables, 18/64 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 4/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/472 variables, 7/75 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 4/79 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 207 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 217 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 209 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 213 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 211 places in 214 ms of which 2 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 213 places in 218 ms of which 2 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 207 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 201 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 213 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 205 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 217 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 215 places in 270 ms of which 7 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 211 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:18:32] [INFO ] Deduced a trap composed of 213 places in 344 ms of which 3 ms to minimize.
[2024-06-01 16:18:32] [INFO ] Deduced a trap composed of 219 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:18:32] [INFO ] Deduced a trap composed of 213 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 8373ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 60 place count 439 transition count 986
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 108 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 412 transition count 983
Applied a total of 114 rules in 189 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
Running 972 sub problems to find dead transitions.
[2024-06-01 16:18:33] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2024-06-01 16:18:33] [INFO ] Computed 62 invariants in 32 ms
[2024-06-01 16:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:18:43] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:18:43] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:18:43] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:18:43] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:18:43] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 16 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 5 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 118 places in 358 ms of which 2 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 16 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 128 places in 187 ms of which 2 ms to minimize.
[2024-06-01 16:18:50] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:18:55] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:18:55] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:18:55] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:18:57] [INFO ] Deduced a trap composed of 169 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:18:57] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:18:57] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:18:58] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:18:58] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 3 ms to minimize.
SMT process timed out in 25321ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 25338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25537 ms. Remains : 412/474 places, 983/1035 transitions.
RANDOM walk for 40000 steps (2798 resets) in 1355 ms. (29 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (385 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
[2024-06-01 16:18:58] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-06-01 16:18:58] [INFO ] Invariant cache hit.
[2024-06-01 16:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/401 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/410 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 161 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/411 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 974/1385 variables, 411/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1385 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1385 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1386 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1386 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1386 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1386/1386 variables, and 480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/401 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/410 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 159 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 161 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 165 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 163 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 163 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 2 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 163 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 161 places in 241 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 161 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:19:06] [INFO ] Deduced a trap composed of 159 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:19:06] [INFO ] Deduced a trap composed of 155 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:19:06] [INFO ] Deduced a trap composed of 159 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 159 places in 229 ms of which 2 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 163 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 2 ms to minimize.
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 159 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:19:09] [INFO ] Deduced a trap composed of 155 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:19:09] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:19:09] [INFO ] Deduced a trap composed of 167 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:19:09] [INFO ] Deduced a trap composed of 163 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 159 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 159 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 159 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 2 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 159 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 159 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 167 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 161 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 157 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 159 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 159 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 169 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 163 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 167 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 159 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 163 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 171 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 171 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 157 places in 256 ms of which 2 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 165 places in 262 ms of which 2 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 161 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 157 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 165 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 161 places in 286 ms of which 2 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 161 places in 255 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 161 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 167 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 167 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 165 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 155 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:19:29] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:19:29] [INFO ] Deduced a trap composed of 157 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:19:29] [INFO ] Deduced a trap composed of 161 places in 258 ms of which 5 ms to minimize.
[2024-06-01 16:19:29] [INFO ] Deduced a trap composed of 165 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:19:30] [INFO ] Deduced a trap composed of 159 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:19:30] [INFO ] Deduced a trap composed of 169 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:19:30] [INFO ] Deduced a trap composed of 157 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 171 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 2 ms to minimize.
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 171 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 161 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 159 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 159 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 161 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 159 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 159 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 159 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 2 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 159 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 161 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 169 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 161 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 159 places in 262 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:38] [INFO ] Deduced a trap composed of 159 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:19:38] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:19:40] [INFO ] Deduced a trap composed of 175 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:19:40] [INFO ] Deduced a trap composed of 155 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:19:41] [INFO ] Deduced a trap composed of 159 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:19:41] [INFO ] Deduced a trap composed of 163 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:19:41] [INFO ] Deduced a trap composed of 161 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:19:42] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:19:42] [INFO ] Deduced a trap composed of 163 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:19:42] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:19:42] [INFO ] Deduced a trap composed of 163 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:19:43] [INFO ] Deduced a trap composed of 169 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:19:43] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:19:43] [INFO ] Deduced a trap composed of 165 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 161 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 167 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 171 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:19:45] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:19:45] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 46675ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 983/983 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 412 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 411 transition count 982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 411 transition count 981
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 410 transition count 981
Applied a total of 4 rules in 44 ms. Remains 410 /412 variables (removed 2) and now considering 981/983 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 410/412 places, 981/983 transitions.
RANDOM walk for 40000 steps (2918 resets) in 640 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (367 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 494011 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 494011 steps, saw 80444 distinct states, run finished after 3004 ms. (steps per millisecond=164 ) properties seen :0
[2024-06-01 16:19:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2024-06-01 16:19:48] [INFO ] Computed 62 invariants in 35 ms
[2024-06-01 16:19:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:49] [INFO ] Deduced a trap composed of 172 places in 238 ms of which 5 ms to minimize.
[2024-06-01 16:19:49] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:19:50] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:19:50] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:19:50] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:19:50] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:19:51] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:19:51] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:19:51] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2024-06-01 16:19:51] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:19:51] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:19:52] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:19:52] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:19:52] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:19:52] [INFO ] Deduced a trap composed of 162 places in 276 ms of which 7 ms to minimize.
[2024-06-01 16:19:53] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:19:53] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:19:53] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:19:53] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:19:54] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:54] [INFO ] Deduced a trap composed of 172 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:19:54] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:19:55] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
[2024-06-01 16:19:55] [INFO ] Deduced a trap composed of 168 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:19:55] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:19:55] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:19:56] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:19:56] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:19:56] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:19:56] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 174 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:20:02] [INFO ] Deduced a trap composed of 161 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:20:02] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:20:02] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:20:02] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:20:03] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:20:04] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:20:04] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:20:04] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:20:04] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:20:05] [INFO ] Deduced a trap composed of 158 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:20:05] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:20:06] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:20:06] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:06] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:20:06] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 2 ms to minimize.
[2024-06-01 16:20:07] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2024-06-01 16:20:08] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:20:08] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:20:08] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:20:09] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:20:09] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:20:09] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 2 ms to minimize.
[2024-06-01 16:20:09] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:10] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:20:10] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:20:10] [INFO ] Deduced a trap composed of 172 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:20:11] [INFO ] Deduced a trap composed of 162 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:20:11] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:20:11] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:20:11] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:20:12] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:20:12] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 2 ms to minimize.
[2024-06-01 16:20:12] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:20:12] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:20:12] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 2 ms to minimize.
[2024-06-01 16:20:13] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 2 ms to minimize.
[2024-06-01 16:20:13] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:20:13] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:20:14] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:20:14] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:20:14] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:20:14] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:20:15] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:15] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:20:16] [INFO ] Deduced a trap composed of 168 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:20:16] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:16] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:20:17] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:20:17] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:20:17] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 172 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 2 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:20:20] [INFO ] Deduced a trap composed of 168 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:20:20] [INFO ] Deduced a trap composed of 176 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:20:20] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:20:20] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 172 places in 261 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 164 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:20:26] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:20:26] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 160 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 2 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 2 ms to minimize.
[2024-06-01 16:20:30] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:20:30] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:20:30] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:20:30] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:20:31] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:20:31] [INFO ] Deduced a trap composed of 172 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:20:31] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:20:31] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:20:31] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:32] [INFO ] Deduced a trap composed of 170 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:20:32] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:20:33] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:20:33] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:20:33] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:20:33] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:20:34] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:20:34] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2024-06-01 16:20:34] [INFO ] Deduced a trap composed of 168 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:20:35] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:35] [INFO ] Deduced a trap composed of 166 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:20:36] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 2 ms to minimize.
[2024-06-01 16:20:36] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:20:36] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:20:36] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:20:37] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:20:37] [INFO ] Deduced a trap composed of 154 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:20:37] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:20:37] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:20:38] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:39] [INFO ] Deduced a trap composed of 168 places in 272 ms of which 2 ms to minimize.
[2024-06-01 16:20:39] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:20:39] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:20:40] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 2 ms to minimize.
[2024-06-01 16:20:40] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:20:40] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:20:40] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:20:41] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:20:41] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:20:41] [INFO ] Deduced a trap composed of 172 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:20:41] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:20:41] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:20:42] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:20:42] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:20:42] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:20:43] [INFO ] Deduced a trap composed of 158 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:20:43] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:20:43] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:20:43] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:20:44] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/408 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:44] [INFO ] Deduced a trap composed of 162 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:20:44] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:20:44] [INFO ] Deduced a trap composed of 168 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:20:45] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:20:45] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:20:45] [INFO ] Deduced a trap composed of 168 places in 239 ms of which 2 ms to minimize.
[2024-06-01 16:20:45] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:20:46] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:20:46] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:20:46] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 2 ms to minimize.
[2024-06-01 16:20:47] [INFO ] Deduced a trap composed of 162 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:20:47] [INFO ] Deduced a trap composed of 162 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:20:48] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:20:48] [INFO ] Deduced a trap composed of 170 places in 251 ms of which 2 ms to minimize.
[2024-06-01 16:20:49] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 2 ms to minimize.
[2024-06-01 16:20:51] [INFO ] Deduced a trap composed of 170 places in 283 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/408 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:51] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 160 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 2 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:20:55] [INFO ] Deduced a trap composed of 166 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:20:55] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 156 places in 304 ms of which 3 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 154 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 165 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/408 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:20:58] [INFO ] Deduced a trap composed of 170 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:20:58] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:21:03] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:21:04] [INFO ] Deduced a trap composed of 154 places in 287 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 247/247 constraints]
After SMT, in 75549ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 38 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 35 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-06-01 16:21:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-06-01 16:21:04] [INFO ] Invariant cache hit.
[2024-06-01 16:21:04] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-01 16:21:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-06-01 16:21:04] [INFO ] Invariant cache hit.
[2024-06-01 16:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:21:06] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2024-06-01 16:21:06] [INFO ] Redundant transitions in 68 ms returned []
Running 970 sub problems to find dead transitions.
[2024-06-01 16:21:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-06-01 16:21:06] [INFO ] Invariant cache hit.
[2024-06-01 16:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:16] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:21:16] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:21:17] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:21:17] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:21:17] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:21:17] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:26] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:21:27] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:21:27] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:21:27] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:21:28] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 126 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 5 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 121 places in 193 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 87 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:42] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 173 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 170 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 175 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 175 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 175 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:21:46] [INFO ] Deduced a trap composed of 168 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:21:46] [INFO ] Deduced a trap composed of 166 places in 295 ms of which 2 ms to minimize.
[2024-06-01 16:21:46] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:21:47] [INFO ] Deduced a trap composed of 173 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:21:47] [INFO ] Deduced a trap composed of 175 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:21:47] [INFO ] Deduced a trap composed of 175 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:21:47] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 2 ms to minimize.
[2024-06-01 16:21:48] [INFO ] Deduced a trap composed of 170 places in 234 ms of which 2 ms to minimize.
[2024-06-01 16:21:48] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:21:48] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:50] [INFO ] Deduced a trap composed of 168 places in 324 ms of which 3 ms to minimize.
[2024-06-01 16:21:50] [INFO ] Deduced a trap composed of 164 places in 309 ms of which 2 ms to minimize.
[2024-06-01 16:21:50] [INFO ] Deduced a trap composed of 173 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:21:51] [INFO ] Deduced a trap composed of 162 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:21:51] [INFO ] Deduced a trap composed of 160 places in 269 ms of which 2 ms to minimize.
[2024-06-01 16:21:51] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 2 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 158 places in 301 ms of which 3 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 162 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 167 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 162 places in 266 ms of which 2 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 175 places in 275 ms of which 2 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 168 places in 267 ms of which 2 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 2 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 16:21:59] [INFO ] Deduced a trap composed of 167 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 2 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 173 places in 332 ms of which 3 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 171 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 2 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 168 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 2 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 160 places in 311 ms of which 3 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 2 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 164 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 177 places in 312 ms of which 3 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 2 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 160 places in 313 ms of which 3 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 164 places in 324 ms of which 3 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 166 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:22:06] [INFO ] Deduced a trap composed of 168 places in 319 ms of which 3 ms to minimize.
[2024-06-01 16:22:06] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1382 variables, and 147 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/970 constraints, Known Traps: 95/95 constraints]
After SMT, in 64664ms problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 64678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66987 ms. Remains : 410/410 places, 981/981 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-01 16:22:11] [INFO ] Flatten gal took : 139 ms
[2024-06-01 16:22:12] [INFO ] Flatten gal took : 117 ms
[2024-06-01 16:22:12] [INFO ] Input system was already deterministic with 1035 transitions.
Support contains 219 out of 474 places (down from 450) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 24 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:22:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-06-01 16:22:13] [INFO ] Computed 62 invariants in 14 ms
[2024-06-01 16:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 174 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 221 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 25515ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 25525ms
Finished structural reductions in LTL mode , in 1 iterations and 25552 ms. Remains : 463/474 places, 1034/1035 transitions.
[2024-06-01 16:22:38] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:22:38] [INFO ] Flatten gal took : 58 ms
[2024-06-01 16:22:38] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 35 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:22:38] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-06-01 16:22:38] [INFO ] Invariant cache hit.
[2024-06-01 16:22:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-06-01 16:23:03] [INFO ] Deduced a trap composed of 215 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:23:03] [INFO ] Deduced a trap composed of 204 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:23:03] [INFO ] Deduced a trap composed of 178 places in 292 ms of which 3 ms to minimize.
SMT process timed out in 24980ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 24991ms
Finished structural reductions in LTL mode , in 1 iterations and 25028 ms. Remains : 463/474 places, 1034/1035 transitions.
[2024-06-01 16:23:03] [INFO ] Flatten gal took : 74 ms
[2024-06-01 16:23:04] [INFO ] Flatten gal took : 88 ms
[2024-06-01 16:23:04] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 25 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:23:04] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-06-01 16:23:04] [INFO ] Invariant cache hit.
[2024-06-01 16:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-06-01 16:23:27] [INFO ] Deduced a trap composed of 215 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:23:27] [INFO ] Deduced a trap composed of 204 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:23:27] [INFO ] Deduced a trap composed of 178 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 178 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 213 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 221 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 203 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 217 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 198 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 198 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 25223ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 25253ms
Finished structural reductions in LTL mode , in 1 iterations and 25283 ms. Remains : 463/474 places, 1034/1035 transitions.
[2024-06-01 16:23:29] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:23:29] [INFO ] Flatten gal took : 48 ms
[2024-06-01 16:23:29] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1034
Applied a total of 2 rules in 15 ms. Remains 473 /474 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:23:29] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2024-06-01 16:23:29] [INFO ] Computed 72 invariants in 28 ms
[2024-06-01 16:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 19/471 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 189 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 169 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 4 ms to minimize.
SMT process timed out in 25889ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 25901ms
Finished structural reductions in LTL mode , in 1 iterations and 25918 ms. Remains : 473/474 places, 1034/1035 transitions.
[2024-06-01 16:23:55] [INFO ] Flatten gal took : 75 ms
[2024-06-01 16:23:55] [INFO ] Flatten gal took : 90 ms
[2024-06-01 16:23:55] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 985
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 411 transition count 982
Applied a total of 106 rules in 107 ms. Remains 411 /474 variables (removed 63) and now considering 982/1035 (removed 53) transitions.
Running 971 sub problems to find dead transitions.
[2024-06-01 16:23:56] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-06-01 16:23:56] [INFO ] Computed 62 invariants in 31 ms
[2024-06-01 16:23:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 3 (OVERLAPS) 9/409 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-06-01 16:24:17] [INFO ] Deduced a trap composed of 125 places in 221 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 115 places in 192 ms of which 2 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 115 places in 210 ms of which 2 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 115 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 120 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 2 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 125 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:24:21] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:24:21] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 2 ms to minimize.
[2024-06-01 16:24:21] [INFO ] Deduced a trap composed of 115 places in 217 ms of which 2 ms to minimize.
SMT process timed out in 25418ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 25434ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25545 ms. Remains : 411/474 places, 982/1035 transitions.
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:24:21] [INFO ] Input system was already deterministic with 982 transitions.
RANDOM walk for 3748 steps (277 resets) in 104 ms. (35 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S10J20-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 50 place count 439 transition count 987
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 96 place count 416 transition count 987
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 415 transition count 986
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 415 transition count 986
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 413 transition count 984
Applied a total of 102 rules in 114 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
Running 973 sub problems to find dead transitions.
[2024-06-01 16:24:21] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2024-06-01 16:24:22] [INFO ] Computed 62 invariants in 25 ms
[2024-06-01 16:24:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 973 unsolved
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 134 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 134 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 124 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 129 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 124 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 124 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 119 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 973 unsolved
[2024-06-01 16:24:41] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:24:42] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:24:42] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 4 ms to minimize.
[2024-06-01 16:24:42] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:24:42] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:24:42] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:24:43] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:24:43] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:24:43] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:24:43] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 2 ms to minimize.
[2024-06-01 16:24:43] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:24:45] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:24:45] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:24:45] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 (/ 2.0 3.0))
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 (/ 1.0 3.0))
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 1.0 3.0))
(s88 0.0)
(s89 0.0)
(s90 (/ 2.0 3.0))
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1388 variables, and 92 constraints, problems are : Problem set: 0 solved, 973 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 973/973 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 973 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 973 unsolved
[2024-06-01 16:24:48] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-06-01 16:24:49] [INFO ] Deduced a trap composed of 120 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:24:49] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:24:49] [INFO ] Deduced a trap composed of 114 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:24:49] [INFO ] Deduced a trap composed of 114 places in 232 ms of which 2 ms to minimize.
[2024-06-01 16:24:50] [INFO ] Deduced a trap composed of 114 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:24:50] [INFO ] Deduced a trap composed of 114 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:24:50] [INFO ] Deduced a trap composed of 132 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:24:51] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 2 ms to minimize.
[2024-06-01 16:24:51] [INFO ] Deduced a trap composed of 120 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:24:51] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 2 ms to minimize.
[2024-06-01 16:24:51] [INFO ] Deduced a trap composed of 129 places in 225 ms of which 2 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 114 places in 224 ms of which 2 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 135 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 135 places in 226 ms of which 2 ms to minimize.
[2024-06-01 16:24:53] [INFO ] Deduced a trap composed of 126 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:24:53] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:24:53] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 2 ms to minimize.
[2024-06-01 16:24:53] [INFO ] Deduced a trap composed of 176 places in 226 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 973 unsolved
[2024-06-01 16:24:55] [INFO ] Deduced a trap composed of 142 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:24:57] [INFO ] Deduced a trap composed of 176 places in 260 ms of which 2 ms to minimize.
[2024-06-01 16:24:58] [INFO ] Deduced a trap composed of 178 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 174 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:25:03] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 158 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 162 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 160 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1388 variables, and 132 constraints, problems are : Problem set: 0 solved, 973 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/973 constraints, Known Traps: 80/80 constraints]
After SMT, in 45128ms problems are : Problem set: 0 solved, 973 unsolved
Search for dead transitions found 0 dead transitions in 45141ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45260 ms. Remains : 413/474 places, 984/1035 transitions.
[2024-06-01 16:25:07] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:25:07] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:25:07] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 474 transition count 1011
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 450 transition count 1011
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 48 place count 450 transition count 988
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 94 place count 427 transition count 988
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 426 transition count 987
Applied a total of 96 rules in 53 ms. Remains 426 /474 variables (removed 48) and now considering 987/1035 (removed 48) transitions.
Running 976 sub problems to find dead transitions.
[2024-06-01 16:25:07] [INFO ] Flow matrix only has 978 transitions (discarded 9 similar events)
// Phase 1: matrix 978 rows 426 cols
[2024-06-01 16:25:07] [INFO ] Computed 72 invariants in 9 ms
[2024-06-01 16:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 3 (OVERLAPS) 18/423 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 103 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 98 places in 213 ms of which 2 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 108 places in 197 ms of which 2 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 1 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 1 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 128 places in 205 ms of which 2 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:25:29] [INFO ] Deduced a trap composed of 103 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:25:29] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:25:29] [INFO ] Deduced a trap composed of 118 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:25:29] [INFO ] Deduced a trap composed of 118 places in 229 ms of which 2 ms to minimize.
[2024-06-01 16:25:30] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 2 ms to minimize.
[2024-06-01 16:25:30] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 2 ms to minimize.
[2024-06-01 16:25:30] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-06-01 16:25:31] [INFO ] Deduced a trap composed of 103 places in 274 ms of which 2 ms to minimize.
[2024-06-01 16:25:31] [INFO ] Deduced a trap composed of 98 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:25:31] [INFO ] Deduced a trap composed of 98 places in 224 ms of which 2 ms to minimize.
[2024-06-01 16:25:31] [INFO ] Deduced a trap composed of 108 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:25:32] [INFO ] Deduced a trap composed of 108 places in 245 ms of which 1 ms to minimize.
SMT process timed out in 24772ms, After SMT, problems are : Problem set: 0 solved, 976 unsolved
Search for dead transitions found 0 dead transitions in 24790ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 24847 ms. Remains : 426/474 places, 987/1035 transitions.
[2024-06-01 16:25:32] [INFO ] Flatten gal took : 64 ms
[2024-06-01 16:25:32] [INFO ] Flatten gal took : 74 ms
[2024-06-01 16:25:32] [INFO ] Input system was already deterministic with 987 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 11 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
Running 1024 sub problems to find dead transitions.
[2024-06-01 16:25:32] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2024-06-01 16:25:32] [INFO ] Computed 62 invariants in 23 ms
[2024-06-01 16:25:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 3 (OVERLAPS) 10/463 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-06-01 16:25:54] [INFO ] Deduced a trap composed of 163 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:25:55] [INFO ] Deduced a trap composed of 219 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:25:55] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:25:55] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:25:55] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:25:55] [INFO ] Deduced a trap composed of 221 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:25:56] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:25:56] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:25:56] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:25:56] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:25:56] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:25:57] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:25:57] [INFO ] Deduced a trap composed of 176 places in 196 ms of which 3 ms to minimize.
SMT process timed out in 24850ms, After SMT, problems are : Problem set: 0 solved, 1024 unsolved
Search for dead transitions found 0 dead transitions in 24866ms
Finished structural reductions in LTL mode , in 1 iterations and 24880 ms. Remains : 464/474 places, 1035/1035 transitions.
[2024-06-01 16:25:57] [INFO ] Flatten gal took : 72 ms
[2024-06-01 16:25:57] [INFO ] Flatten gal took : 87 ms
[2024-06-01 16:25:57] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Applied a total of 0 rules in 6 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Running 1024 sub problems to find dead transitions.
[2024-06-01 16:25:57] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2024-06-01 16:25:57] [INFO ] Computed 72 invariants in 24 ms
[2024-06-01 16:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 3 (OVERLAPS) 19/472 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 185 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 215 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 175 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:26:23] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 25235ms, After SMT, problems are : Problem set: 0 solved, 1024 unsolved
Search for dead transitions found 0 dead transitions in 25251ms
Finished structural reductions in LTL mode , in 1 iterations and 25261 ms. Remains : 474/474 places, 1035/1035 transitions.
[2024-06-01 16:26:23] [INFO ] Flatten gal took : 79 ms
[2024-06-01 16:26:23] [INFO ] Flatten gal took : 62 ms
[2024-06-01 16:26:23] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 64 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
Running 972 sub problems to find dead transitions.
[2024-06-01 16:26:23] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2024-06-01 16:26:23] [INFO ] Computed 62 invariants in 15 ms
[2024-06-01 16:26:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 172 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 176 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 174 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 170 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 172 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 178 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 170 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:45] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1386 variables, and 93 constraints, problems are : Problem set: 0 solved, 972 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 160 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 160 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 168 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 131 places in 238 ms of which 2 ms to minimize.
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 123 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 2 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 174 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 2 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 2 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-06-01 16:26:57] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 2 ms to minimize.
[2024-06-01 16:26:57] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 2 ms to minimize.
[2024-06-01 16:26:57] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:26:58] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:26:58] [INFO ] Deduced a trap composed of 123 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:26:59] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:27:00] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 136 places in 262 ms of which 2 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 2 ms to minimize.
[2024-06-01 16:27:02] [INFO ] Deduced a trap composed of 174 places in 263 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 16:27:03] [INFO ] Deduced a trap composed of 108 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:27:03] [INFO ] Deduced a trap composed of 133 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:27:03] [INFO ] Deduced a trap composed of 113 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 6 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 118 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:27:05] [INFO ] Deduced a trap composed of 132 places in 304 ms of which 2 ms to minimize.
[2024-06-01 16:27:05] [INFO ] Deduced a trap composed of 131 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 128 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 121 places in 218 ms of which 2 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 123 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 128 places in 225 ms of which 2 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 128 places in 223 ms of which 2 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 2 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 128 places in 233 ms of which 2 ms to minimize.
[2024-06-01 16:27:08] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:27:08] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1386 variables, and 173 constraints, problems are : Problem set: 0 solved, 972 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/972 constraints, Known Traps: 121/121 constraints]
After SMT, in 44871ms problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 44883ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44952 ms. Remains : 412/474 places, 983/1035 transitions.
[2024-06-01 16:27:08] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:27:08] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:27:08] [INFO ] Input system was already deterministic with 983 transitions.
RANDOM walk for 1063 steps (74 resets) in 76 ms. (13 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S10J20-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 50 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:27:08] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-06-01 16:27:08] [INFO ] Computed 62 invariants in 23 ms
[2024-06-01 16:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-06-01 16:27:31] [INFO ] Deduced a trap composed of 174 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 221 places in 311 ms of which 3 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 220 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 220 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 174 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 174 places in 247 ms of which 2 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 159 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 25315ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 25329ms
Finished structural reductions in LTL mode , in 1 iterations and 25383 ms. Remains : 463/474 places, 1034/1035 transitions.
[2024-06-01 16:27:34] [INFO ] Flatten gal took : 73 ms
[2024-06-01 16:27:34] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:27:34] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 16 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
Running 1023 sub problems to find dead transitions.
[2024-06-01 16:27:34] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-06-01 16:27:34] [INFO ] Invariant cache hit.
[2024-06-01 16:27:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-06
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLFireability-2024-15

BK_STOP 1717259260777

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447000402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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