MCC'2024- Execution of r579-smll-171734921400170

About the Execution of LTSMin+red for MedleyA-PT-22

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1700.239	220451.00	337838.00	691.00	??F?TFTT????FT??	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717364490061

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:41:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:41:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:41:33] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-06-02 21:41:33] [INFO ] Transformed 307 places.
[2024-06-02 21:41:33] [INFO ] Transformed 740 transitions.
[2024-06-02 21:41:33] [INFO ] Found NUPN structural information;
[2024-06-02 21:41:33] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 91 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 78 place count 229 transition count 652
Iterating global reduction 1 with 74 rules applied. Total rules applied 152 place count 229 transition count 652
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 159 place count 229 transition count 645
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 171 place count 217 transition count 630
Iterating global reduction 2 with 12 rules applied. Total rules applied 183 place count 217 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 216 transition count 627
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 216 transition count 627
Applied a total of 185 rules in 132 ms. Remains 216 /307 variables (removed 91) and now considering 627/740 (removed 113) transitions.
// Phase 1: matrix 627 rows 216 cols
[2024-06-02 21:41:33] [INFO ] Computed 22 invariants in 36 ms
[2024-06-02 21:41:34] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-02 21:41:34] [INFO ] Invariant cache hit.
[2024-06-02 21:41:34] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 626 sub problems to find dead transitions.
[2024-06-02 21:41:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 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 TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/216 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 482 unsolved
[2024-06-02 21:41:49] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 36 ms to minimize.
[2024-06-02 21:41:49] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-06-02 21:41:49] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-06-02 21:41:50] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:41:50] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 3 ms to minimize.
[2024-06-02 21:41:50] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:41:50] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:41:51] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:41:51] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:41:52] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 10/32 constraints. Problems are: Problem set: 144 solved, 482 unsolved
[2024-06-02 21:42:00] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
[2024-06-02 21:42:00] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 3 ms to minimize.
[2024-06-02 21:42:00] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 3 ms to minimize.
[2024-06-02 21:42:01] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2024-06-02 21:42:01] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-02 21:42:02] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 6/38 constraints. Problems are: Problem set: 144 solved, 482 unsolved
[2024-06-02 21:42:07] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 216/843 variables, and 39 constraints, problems are : Problem set: 144 solved, 482 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 144 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 17/39 constraints. Problems are: Problem set: 144 solved, 482 unsolved
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 4 ms to minimize.
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 2/41 constraints. Problems are: Problem set: 144 solved, 482 unsolved
[2024-06-02 21:42:19] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 3 ms to minimize.
[2024-06-02 21:42:20] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 3 ms to minimize.
[2024-06-02 21:42:20] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 3/44 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/44 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 627/843 variables, 216/260 constraints. Problems are: Problem set: 144 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 482/742 constraints. Problems are: Problem set: 144 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 742 constraints, problems are : Problem set: 144 solved, 482 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 482/626 constraints, Known Traps: 22/22 constraints]
After SMT, in 63368ms problems are : Problem set: 144 solved, 482 unsolved
Search for dead transitions found 144 dead transitions in 63432ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/307 places, 483/740 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64631 ms. Remains : 216/307 places, 483/740 transitions.
Support contains 91 out of 216 places after structural reductions.
[2024-06-02 21:42:38] [INFO ] Flatten gal took : 122 ms
[2024-06-02 21:42:38] [INFO ] Flatten gal took : 58 ms
[2024-06-02 21:42:38] [INFO ] Input system was already deterministic with 483 transitions.
Reduction of identical properties reduced properties to check from 72 to 71
RANDOM walk for 40000 steps (1158 resets) in 3609 ms. (11 steps per ms) remains 57/71 properties
BEST_FIRST walk for 4003 steps (20 resets) in 54 ms. (72 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (21 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (21 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (19 resets) in 41 ms. (95 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (21 resets) in 55 ms. (71 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (24 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (23 resets) in 51 ms. (76 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (24 resets) in 40 ms. (97 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (21 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (23 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (21 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (18 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (22 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (19 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (21 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (25 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (21 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 54/57 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (18 resets) in 27 ms. (143 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (17 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (22 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (20 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (27 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (18 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
// Phase 1: matrix 483 rows 216 cols
[2024-06-02 21:42:40] [INFO ] Computed 22 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/132 variables, 6/6 constraints. Problems are: Problem set: 13 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 41 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/203 variables, 16/22 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 473/676 variables, 203/225 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/225 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 17/693 variables, 10/235 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 0/235 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 5/698 variables, 2/237 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/237 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/699 variables, 1/238 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 0/238 constraints. Problems are: Problem set: 17 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/699 variables, 0/238 constraints. Problems are: Problem set: 17 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 238 constraints, problems are : Problem set: 17 solved, 37 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 37 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/126 variables, 6/6 constraints. Problems are: Problem set: 21 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 21 solved, 33 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 77/203 variables, 16/22 constraints. Problems are: Problem set: 22 solved, 32 unsolved
[2024-06-02 21:42:46] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:42:46] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/24 constraints. Problems are: Problem set: 22 solved, 32 unsolved
[2024-06-02 21:42:46] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:42:46] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:42:46] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/27 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/27 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 473/676 variables, 203/230 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 13/243 constraints. Problems are: Problem set: 22 solved, 32 unsolved
[2024-06-02 21:42:47] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:42:47] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:42:48] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:42:48] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 4/247 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/247 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 17/693 variables, 10/257 constraints. Problems are: Problem set: 22 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/693 variables, 19/276 constraints. Problems are: Problem set: 22 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/699 variables, and 276 constraints, problems are : Problem set: 22 solved, 32 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 213/216 constraints, PredecessorRefiner: 32/54 constraints, Known Traps: 9/9 constraints]
After SMT, in 9910ms problems are : Problem set: 22 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 213 transition count 465
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 199 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 198 transition count 464
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 32 place count 198 transition count 453
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 54 place count 187 transition count 453
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 67 place count 174 transition count 438
Iterating global reduction 3 with 13 rules applied. Total rules applied 80 place count 174 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 174 transition count 437
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 172 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 172 transition count 432
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 99 place count 165 transition count 425
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 117 place count 156 transition count 542
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 133 place count 156 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 5 with 107 rules applied. Total rules applied 240 place count 156 transition count 419
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 243 place count 156 transition count 416
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 246 place count 153 transition count 416
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 257 place count 153 transition count 435
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 268 place count 142 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 142 transition count 434
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 272 place count 142 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 141 transition count 433
Applied a total of 273 rules in 183 ms. Remains 141 /216 variables (removed 75) and now considering 433/483 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 141/216 places, 433/483 transitions.
RANDOM walk for 40000 steps (2125 resets) in 1969 ms. (20 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
// Phase 1: matrix 433 rows 141 cols
[2024-06-02 21:42:51] [INFO ] Computed 23 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 43/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 48/137 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 3/140 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 433/573 variables, 140/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 1/574 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 164 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 43/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 48/137 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:42:54] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:42:54] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:42:54] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 3/140 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:42:55] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 433/573 variables, 140/167 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 12/179 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 1/574 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 15/195 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:42:57] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:42:57] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:42:58] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 0/574 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 198 constraints, problems are : Problem set: 0 solved, 27 unsolved in 9574 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 7/7 constraints]
After SMT, in 11961ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 21 properties in 31314 ms.
Support contains 16 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 433/433 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 139 transition count 431
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 15 place count 128 transition count 393
Iterating global reduction 2 with 11 rules applied. Total rules applied 26 place count 128 transition count 393
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 123 transition count 375
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 123 transition count 375
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 61 place count 110 transition count 363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 108 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 108 transition count 361
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 103 transition count 424
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 91 place count 103 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 103 transition count 400
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 103 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 102 transition count 399
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 101 transition count 393
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 101 transition count 393
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 101 transition count 409
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 116 place count 95 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 95 transition count 407
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 127 place count 95 transition count 407
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 93 transition count 405
Applied a total of 129 rules in 127 ms. Remains 93 /141 variables (removed 48) and now considering 405/433 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 93/141 places, 405/433 transitions.
RANDOM walk for 40000 steps (2787 resets) in 315 ms. (126 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (267 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (337 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (270 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (217 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (249 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
// Phase 1: matrix 405 rows 93 cols
[2024-06-02 21:43:35] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:43:35] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/80 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 395/475 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 23/498 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/498 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 171 constraints, problems are : Problem set: 0 solved, 5 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/80 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 395/475 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 23/498 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/498 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 176 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2251ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 5091 ms.
Support contains 13 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 405/405 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 92 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 91 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 91 transition count 398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 90 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 89 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 89 transition count 396
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 89 transition count 454
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 86 transition count 454
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 86 transition count 454
Applied a total of 17 rules in 36 ms. Remains 86 /93 variables (removed 7) and now considering 454/405 (removed -49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 86/93 places, 454/405 transitions.
RANDOM walk for 40000 steps (2892 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (342 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (311 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (275 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (271 resets) in 58 ms. (678 steps per ms) remains 3/4 properties
// Phase 1: matrix 454 rows 86 cols
[2024-06-02 21:43:42] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:43:42] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/69 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 444/517 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 48/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/540 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/540 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 86/86 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/69 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 444/517 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 48/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/540 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/540 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 86/86 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1494 ms.
Support contains 9 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 454/454 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 446
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 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 445
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 84 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 82 transition count 443
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 82 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 81 transition count 502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 80 transition count 501
Applied a total of 11 rules in 44 ms. Remains 80 /86 variables (removed 6) and now considering 501/454 (removed -47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 80/86 places, 501/454 transitions.
RANDOM walk for 40000 steps (3323 resets) in 329 ms. (121 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (295 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
// Phase 1: matrix 501 rows 80 cols
[2024-06-02 21:43:45] [INFO ] Computed 22 invariants in 10 ms
[2024-06-02 21:43:45] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/40 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/67 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/558 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/581 variables, 13/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/581 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 80/80 constraints, ReadFeed: 56/56 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/40 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/67 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/558 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/581 variables, 13/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/581 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 80/80 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 501/501 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 80 transition count 500
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 500
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 76 transition count 498
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 75 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 75 transition count 474
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 75 transition count 494
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 22 place count 74 transition count 483
Applied a total of 22 rules in 40 ms. Remains 74 /80 variables (removed 6) and now considering 483/501 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 74/80 places, 483/501 transitions.
RANDOM walk for 40000 steps (3836 resets) in 1133 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (394 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 745277 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 1
Probabilistic random walk after 745277 steps, saw 179484 distinct states, run finished after 3007 ms. (steps per millisecond=247 ) properties seen :0
[2024-06-02 21:43:49] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
// Phase 1: matrix 479 rows 74 cols
[2024-06-02 21:43:49] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:43:49] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/46 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/59 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 465/526 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 52/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/553 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 64/64 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/46 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/59 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 465/526 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 52/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/553 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 483/483 transitions.
Applied a total of 0 rules in 10 ms. Remains 74 /74 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 74/74 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 483/483 transitions.
Applied a total of 0 rules in 10 ms. Remains 74 /74 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-02 21:43:50] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
[2024-06-02 21:43:50] [INFO ] Invariant cache hit.
[2024-06-02 21:43:50] [INFO ] Implicit Places using invariants in 149 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/74 places, 483/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 174 ms. Remains : 73/74 places, 483/483 transitions.
RANDOM walk for 40000 steps (3844 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (391 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 801642 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 801642 steps, saw 191798 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2024-06-02 21:43:53] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
// Phase 1: matrix 479 rows 73 cols
[2024-06-02 21:43:53] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:43:53] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/60 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 465/525 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/552 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/552 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/60 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 465/525 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/552 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/552 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 483/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 73/73 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 483/483 transitions.
Applied a total of 0 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-02 21:43:54] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
[2024-06-02 21:43:54] [INFO ] Invariant cache hit.
[2024-06-02 21:43:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 21:43:54] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
[2024-06-02 21:43:54] [INFO ] Invariant cache hit.
[2024-06-02 21:43:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:43:55] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-06-02 21:43:55] [INFO ] Redundant transitions in 50 ms returned []
Running 477 sub problems to find dead transitions.
[2024-06-02 21:43:55] [INFO ] Flow matrix only has 479 transitions (discarded 4 similar events)
[2024-06-02 21:43:55] [INFO ] Invariant cache hit.
[2024-06-02 21:43:55] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (OVERLAPS) 3/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 21:44:04] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (OVERLAPS) 479/552 variables, 73/94 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 60/154 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 9 (OVERLAPS) 0/552 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 477 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 154 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 3/73 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (OVERLAPS) 479/552 variables, 73/94 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 60/154 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 477/631 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 631 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 1/1 constraints]
After SMT, in 62137ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 62146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62850 ms. Remains : 73/73 places, 483/483 transitions.
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-22-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:44:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 21:44:57] [INFO ] Flatten gal took : 84 ms
FORMULA MedleyA-PT-22-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:44:57] [INFO ] Flatten gal took : 64 ms
[2024-06-02 21:44:57] [INFO ] Input system was already deterministic with 483 transitions.
Support contains 57 out of 216 places (down from 61) after GAL structural reductions.
Computed a total of 18 stabilizing places and 19 stable transitions
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 182 transition count 415
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 182 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 182 transition count 413
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 169 transition count 381
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 169 transition count 381
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 161 transition count 357
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 161 transition count 357
Applied a total of 112 rules in 23 ms. Remains 161 /216 variables (removed 55) and now considering 357/483 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 161/216 places, 357/483 transitions.
[2024-06-02 21:44:57] [INFO ] Flatten gal took : 39 ms
[2024-06-02 21:44:57] [INFO ] Flatten gal took : 40 ms
[2024-06-02 21:44:58] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 183 transition count 420
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 183 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 183 transition count 418
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 80 place count 171 transition count 388
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 171 transition count 388
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 163 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 163 transition count 364
Applied a total of 108 rules in 26 ms. Remains 163 /216 variables (removed 53) and now considering 364/483 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 163/216 places, 364/483 transitions.
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:44:58] [INFO ] Input system was already deterministic with 364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 191 transition count 436
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 191 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 191 transition count 435
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 182 transition count 414
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 182 transition count 414
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 178 transition count 402
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 178 transition count 402
Applied a total of 77 rules in 15 ms. Remains 178 /216 variables (removed 38) and now considering 402/483 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 178/216 places, 402/483 transitions.
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:44:58] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 212 transition count 450
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 183 transition count 450
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 59 place count 183 transition count 446
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 179 transition count 446
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 94 place count 152 transition count 389
Iterating global reduction 2 with 27 rules applied. Total rules applied 121 place count 152 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 121 place count 152 transition count 388
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 123 place count 151 transition count 388
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 135 place count 139 transition count 358
Iterating global reduction 2 with 12 rules applied. Total rules applied 147 place count 139 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 134 transition count 343
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 134 transition count 343
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 206 place count 108 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 108 transition count 318
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 214 place count 102 transition count 306
Iterating global reduction 3 with 6 rules applied. Total rules applied 220 place count 102 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 223 place count 102 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 229 place count 99 transition count 300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 97 transition count 298
Applied a total of 231 rules in 80 ms. Remains 97 /216 variables (removed 119) and now considering 298/483 (removed 185) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 97/216 places, 298/483 transitions.
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:44:58] [INFO ] Input system was already deterministic with 298 transitions.
RANDOM walk for 40000 steps (3791 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (493 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1483906 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1483906 steps, saw 287990 distinct states, run finished after 3003 ms. (steps per millisecond=494 ) properties seen :0
// Phase 1: matrix 298 rows 97 cols
[2024-06-02 21:45:01] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:45:01] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/165 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 152/317 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/345 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/359 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/395 variables, 41/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/395 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/165 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 152/317 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/345 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/359 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/395 variables, 41/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/395 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 95 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 21 place count 95 transition count 293
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 95 transition count 287
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 89 transition count 287
Free-agglomeration rule (complex) applied 22 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 89 transition count 663
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 86 place count 67 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 67 transition count 653
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 92 place count 67 transition count 653
Applied a total of 92 rules in 174 ms. Remains 67 /97 variables (removed 30) and now considering 653/298 (removed -355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 67/97 places, 653/298 transitions.
RANDOM walk for 2414384 steps (295083 resets) in 16383 ms. (147 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 449
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 182 transition count 449
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 61 place count 182 transition count 445
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 178 transition count 445
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 96 place count 151 transition count 384
Iterating global reduction 2 with 27 rules applied. Total rules applied 123 place count 151 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 123 place count 151 transition count 382
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 127 place count 149 transition count 382
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 139 place count 137 transition count 351
Iterating global reduction 2 with 12 rules applied. Total rules applied 151 place count 137 transition count 351
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 131 transition count 333
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 131 transition count 333
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 211 place count 106 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 213 place count 106 transition count 308
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 219 place count 100 transition count 296
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 100 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 228 place count 100 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 234 place count 97 transition count 290
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 95 transition count 288
Applied a total of 236 rules in 70 ms. Remains 95 /216 variables (removed 121) and now considering 288/483 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 95/216 places, 288/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 288 transitions.
RANDOM walk for 40000 steps (4220 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (599 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15309 steps, run visited all 1 properties in 47 ms. (steps per millisecond=325 )
Probabilistic random walk after 15309 steps, saw 4614 distinct states, run finished after 52 ms. (steps per millisecond=294 ) properties seen :1
FORMULA MedleyA-PT-22-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 188 transition count 430
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 188 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 188 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 179 transition count 406
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 179 transition count 406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 174 transition count 391
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 174 transition count 391
Applied a total of 86 rules in 10 ms. Remains 174 /216 variables (removed 42) and now considering 391/483 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 174/216 places, 391/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 182 transition count 415
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 182 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 182 transition count 413
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 169 transition count 381
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 169 transition count 381
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 160 transition count 354
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 160 transition count 354
Applied a total of 114 rules in 10 ms. Remains 160 /216 variables (removed 56) and now considering 354/483 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 160/216 places, 354/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 182 transition count 415
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 182 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 182 transition count 413
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 169 transition count 381
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 169 transition count 381
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 160 transition count 354
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 160 transition count 354
Applied a total of 114 rules in 9 ms. Remains 160 /216 variables (removed 56) and now considering 354/483 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 160/216 places, 354/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 212 transition count 452
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 185 transition count 452
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 55 place count 185 transition count 449
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 182 transition count 449
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 87 place count 156 transition count 393
Iterating global reduction 2 with 26 rules applied. Total rules applied 113 place count 156 transition count 393
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 125 place count 144 transition count 363
Iterating global reduction 2 with 12 rules applied. Total rules applied 137 place count 144 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 139 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 139 transition count 348
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 192 place count 115 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 115 transition count 325
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 200 place count 109 transition count 313
Iterating global reduction 3 with 6 rules applied. Total rules applied 206 place count 109 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 109 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 106 transition count 307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 104 transition count 305
Applied a total of 217 rules in 54 ms. Remains 104 /216 variables (removed 112) and now considering 305/483 (removed 178) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 104/216 places, 305/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 212 transition count 452
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 185 transition count 452
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 55 place count 185 transition count 447
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 65 place count 180 transition count 447
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 92 place count 153 transition count 390
Iterating global reduction 2 with 27 rules applied. Total rules applied 119 place count 153 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 119 place count 153 transition count 388
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 123 place count 151 transition count 388
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 135 place count 139 transition count 358
Iterating global reduction 2 with 12 rules applied. Total rules applied 147 place count 139 transition count 358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 133 transition count 340
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 133 transition count 340
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 204 place count 109 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 109 transition count 317
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 211 place count 104 transition count 308
Iterating global reduction 3 with 5 rules applied. Total rules applied 216 place count 104 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 104 transition count 306
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 222 place count 102 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 100 transition count 302
Applied a total of 224 rules in 55 ms. Remains 100 /216 variables (removed 116) and now considering 302/483 (removed 181) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 100/216 places, 302/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:45:09] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 483/483 transitions.
Graph (complete) has 902 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 449
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 182 transition count 449
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 61 place count 182 transition count 445
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 178 transition count 445
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 96 place count 151 transition count 388
Iterating global reduction 2 with 27 rules applied. Total rules applied 123 place count 151 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 123 place count 151 transition count 386
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 127 place count 149 transition count 386
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 139 place count 137 transition count 356
Iterating global reduction 2 with 12 rules applied. Total rules applied 151 place count 137 transition count 356
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 132 transition count 341
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 132 transition count 341
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 210 place count 106 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 106 transition count 316
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 218 place count 100 transition count 304
Iterating global reduction 3 with 6 rules applied. Total rules applied 224 place count 100 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 100 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 233 place count 97 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 95 transition count 296
Applied a total of 235 rules in 58 ms. Remains 95 /216 variables (removed 121) and now considering 296/483 (removed 187) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 95/216 places, 296/483 transitions.
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:45:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:45:10] [INFO ] Input system was already deterministic with 296 transitions.
[2024-06-02 21:45:10] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:45:10] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:45:10] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-02 21:45:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 216 places, 483 transitions and 2409 arcs took 6 ms.
Total runtime 217355 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-22-CTLFireability-2024-15

BK_STOP 1717364710512

--------------------
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 MedleyA-PT-22-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/726/ctl_0_
ctl formula name MedleyA-PT-22-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/726/ctl_1_
ctl formula name MedleyA-PT-22-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/726/ctl_2_
ctl formula name MedleyA-PT-22-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/726/ctl_3_
ctl formula name MedleyA-PT-22-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/726/ctl_4_
ctl formula name MedleyA-PT-22-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/726/ctl_5_
ctl formula name MedleyA-PT-22-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/726/ctl_6_
ctl formula name MedleyA-PT-22-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/726/ctl_7_
ctl formula name MedleyA-PT-22-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/726/ctl_8_
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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r579-smll-171734921400170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 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 ;