About the Execution of GreatSPN+red for Anderson-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11236.712 | 3600000.00 | 7797143.00 | 10342.90 | ????T?T????T???? | 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.r003-smll-171620117600378.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-12-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-12-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-12-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-12-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-12-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716471692383
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:41:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 13:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:41:34] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-23 13:41:34] [INFO ] Transformed 889 places.
[2024-05-23 13:41:34] [INFO ] Transformed 4152 transitions.
[2024-05-23 13:41:34] [INFO ] Found NUPN structural information;
[2024-05-23 13:41:34] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 646 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 102 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 682 transition count 2229
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 682 transition count 2229
Applied a total of 414 rules in 227 ms. Remains 682 /889 variables (removed 207) and now considering 2229/4152 (removed 1923) transitions.
// Phase 1: matrix 2229 rows 682 cols
[2024-05-23 13:41:35] [INFO ] Computed 27 invariants in 115 ms
[2024-05-23 13:41:36] [INFO ] Implicit Places using invariants in 1429 ms returned []
[2024-05-23 13:41:36] [INFO ] Invariant cache hit.
[2024-05-23 13:41:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 13:41:47] [INFO ] Implicit Places using invariants and state equation in 10906 ms returned []
Implicit Place search using SMT with State Equation took 12535 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-05-23 13:41:47] [INFO ] Invariant cache hit.
[2024-05-23 13:41:47] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
SMT process timed out in 37449ms, After SMT, problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 37525ms
Starting structural reductions in LTL mode, iteration 1 : 682/889 places, 2229/4152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50341 ms. Remains : 682/889 places, 2229/4152 transitions.
Support contains 102 out of 682 places after structural reductions.
[2024-05-23 13:42:25] [INFO ] Flatten gal took : 297 ms
[2024-05-23 13:42:26] [INFO ] Flatten gal took : 208 ms
[2024-05-23 13:42:26] [INFO ] Input system was already deterministic with 2229 transitions.
RANDOM walk for 40000 steps (8 resets) in 4680 ms. (8 steps per ms) remains 44/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
[2024-05-23 13:42:28] [INFO ] Invariant cache hit.
[2024-05-23 13:42:28] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 612/678 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 8/21 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/682 variables, 6/27 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-05-23 13:42:30] [INFO ] Deduced a trap composed of 399 places in 817 ms of which 69 ms to minimize.
[2024-05-23 13:42:31] [INFO ] Deduced a trap composed of 246 places in 788 ms of which 8 ms to minimize.
[2024-05-23 13:42:32] [INFO ] Deduced a trap composed of 251 places in 818 ms of which 8 ms to minimize.
[2024-05-23 13:42:33] [INFO ] Deduced a trap composed of 151 places in 766 ms of which 16 ms to minimize.
[2024-05-23 13:42:34] [INFO ] Deduced a trap composed of 347 places in 726 ms of which 7 ms to minimize.
SMT process timed out in 5806ms, After SMT, problems are : Problem set: 3 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 682 transition count 2098
Deduced a syphon composed of 131 places in 2 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 551 transition count 2098
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 288 place count 525 transition count 1544
Iterating global reduction 0 with 26 rules applied. Total rules applied 314 place count 525 transition count 1544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 316 place count 524 transition count 1543
Applied a total of 316 rules in 229 ms. Remains 524 /682 variables (removed 158) and now considering 1543/2229 (removed 686) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 524/682 places, 1543/2229 transitions.
RANDOM walk for 40000 steps (8 resets) in 636 ms. (62 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/24 properties
// Phase 1: matrix 1543 rows 524 cols
[2024-05-23 13:42:35] [INFO ] Computed 27 invariants in 53 ms
[2024-05-23 13:42:35] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 425/463 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 24/487 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 27/514 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 10/524 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:42:36] [INFO ] Deduced a trap composed of 291 places in 598 ms of which 6 ms to minimize.
[2024-05-23 13:42:37] [INFO ] Deduced a trap composed of 119 places in 610 ms of which 5 ms to minimize.
[2024-05-23 13:42:38] [INFO ] Deduced a trap composed of 245 places in 622 ms of which 6 ms to minimize.
[2024-05-23 13:42:38] [INFO ] Deduced a trap composed of 167 places in 534 ms of which 6 ms to minimize.
[2024-05-23 13:42:39] [INFO ] Deduced a trap composed of 178 places in 651 ms of which 10 ms to minimize.
[2024-05-23 13:42:40] [INFO ] Deduced a trap composed of 171 places in 618 ms of which 5 ms to minimize.
[2024-05-23 13:42:40] [INFO ] Deduced a trap composed of 154 places in 622 ms of which 5 ms to minimize.
[2024-05-23 13:42:41] [INFO ] Deduced a trap composed of 166 places in 654 ms of which 5 ms to minimize.
[2024-05-23 13:42:41] [INFO ] Deduced a trap composed of 141 places in 622 ms of which 5 ms to minimize.
[2024-05-23 13:42:42] [INFO ] Deduced a trap composed of 114 places in 592 ms of which 6 ms to minimize.
[2024-05-23 13:42:43] [INFO ] Deduced a trap composed of 248 places in 584 ms of which 5 ms to minimize.
[2024-05-23 13:42:43] [INFO ] Deduced a trap composed of 180 places in 573 ms of which 6 ms to minimize.
[2024-05-23 13:42:44] [INFO ] Deduced a trap composed of 150 places in 601 ms of which 6 ms to minimize.
[2024-05-23 13:42:45] [INFO ] Deduced a trap composed of 223 places in 567 ms of which 5 ms to minimize.
[2024-05-23 13:42:45] [INFO ] Deduced a trap composed of 145 places in 564 ms of which 5 ms to minimize.
[2024-05-23 13:42:46] [INFO ] Deduced a trap composed of 175 places in 564 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:42:47] [INFO ] Deduced a trap composed of 250 places in 606 ms of which 5 ms to minimize.
[2024-05-23 13:42:47] [INFO ] Deduced a trap composed of 194 places in 608 ms of which 5 ms to minimize.
[2024-05-23 13:42:48] [INFO ] Deduced a trap composed of 282 places in 608 ms of which 6 ms to minimize.
[2024-05-23 13:42:49] [INFO ] Deduced a trap composed of 292 places in 610 ms of which 6 ms to minimize.
[2024-05-23 13:42:49] [INFO ] Deduced a trap composed of 261 places in 610 ms of which 6 ms to minimize.
[2024-05-23 13:42:50] [INFO ] Deduced a trap composed of 322 places in 608 ms of which 5 ms to minimize.
[2024-05-23 13:42:50] [INFO ] Deduced a trap composed of 337 places in 712 ms of which 6 ms to minimize.
[2024-05-23 13:42:51] [INFO ] Deduced a trap composed of 242 places in 641 ms of which 6 ms to minimize.
[2024-05-23 13:42:52] [INFO ] Deduced a trap composed of 143 places in 611 ms of which 6 ms to minimize.
[2024-05-23 13:42:52] [INFO ] Deduced a trap composed of 172 places in 585 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:42:54] [INFO ] Deduced a trap composed of 92 places in 662 ms of which 6 ms to minimize.
[2024-05-23 13:42:54] [INFO ] Deduced a trap composed of 168 places in 536 ms of which 5 ms to minimize.
[2024-05-23 13:42:55] [INFO ] Deduced a trap composed of 88 places in 570 ms of which 6 ms to minimize.
[2024-05-23 13:42:56] [INFO ] Deduced a trap composed of 103 places in 626 ms of which 5 ms to minimize.
[2024-05-23 13:42:56] [INFO ] Deduced a trap composed of 145 places in 545 ms of which 5 ms to minimize.
[2024-05-23 13:42:57] [INFO ] Deduced a trap composed of 210 places in 589 ms of which 6 ms to minimize.
[2024-05-23 13:42:57] [INFO ] Deduced a trap composed of 143 places in 603 ms of which 5 ms to minimize.
[2024-05-23 13:42:58] [INFO ] Deduced a trap composed of 254 places in 575 ms of which 5 ms to minimize.
[2024-05-23 13:42:59] [INFO ] Deduced a trap composed of 249 places in 598 ms of which 7 ms to minimize.
[2024-05-23 13:42:59] [INFO ] Deduced a trap composed of 169 places in 589 ms of which 5 ms to minimize.
[2024-05-23 13:43:00] [INFO ] Deduced a trap composed of 301 places in 614 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:43:01] [INFO ] Deduced a trap composed of 184 places in 555 ms of which 5 ms to minimize.
[2024-05-23 13:43:02] [INFO ] Deduced a trap composed of 188 places in 578 ms of which 5 ms to minimize.
[2024-05-23 13:43:02] [INFO ] Deduced a trap composed of 108 places in 619 ms of which 5 ms to minimize.
[2024-05-23 13:43:03] [INFO ] Deduced a trap composed of 125 places in 585 ms of which 5 ms to minimize.
[2024-05-23 13:43:04] [INFO ] Deduced a trap composed of 195 places in 590 ms of which 5 ms to minimize.
[2024-05-23 13:43:04] [INFO ] Deduced a trap composed of 155 places in 604 ms of which 6 ms to minimize.
[2024-05-23 13:43:05] [INFO ] Deduced a trap composed of 107 places in 576 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:43:06] [INFO ] Deduced a trap composed of 68 places in 604 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:43:07] [INFO ] Deduced a trap composed of 287 places in 591 ms of which 5 ms to minimize.
[2024-05-23 13:43:08] [INFO ] Deduced a trap composed of 103 places in 525 ms of which 5 ms to minimize.
[2024-05-23 13:43:09] [INFO ] Deduced a trap composed of 213 places in 593 ms of which 6 ms to minimize.
[2024-05-23 13:43:09] [INFO ] Deduced a trap composed of 190 places in 542 ms of which 5 ms to minimize.
[2024-05-23 13:43:10] [INFO ] Deduced a trap composed of 229 places in 631 ms of which 5 ms to minimize.
[2024-05-23 13:43:11] [INFO ] Deduced a trap composed of 236 places in 628 ms of which 6 ms to minimize.
[2024-05-23 13:43:11] [INFO ] Deduced a trap composed of 197 places in 601 ms of which 6 ms to minimize.
[2024-05-23 13:43:12] [INFO ] Deduced a trap composed of 191 places in 617 ms of which 6 ms to minimize.
[2024-05-23 13:43:13] [INFO ] Deduced a trap composed of 179 places in 595 ms of which 6 ms to minimize.
[2024-05-23 13:43:13] [INFO ] Deduced a trap composed of 124 places in 603 ms of which 5 ms to minimize.
[2024-05-23 13:43:14] [INFO ] Deduced a trap composed of 217 places in 624 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:43:15] [INFO ] Deduced a trap composed of 153 places in 615 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-23 13:43:17] [INFO ] Deduced a trap composed of 197 places in 621 ms of which 5 ms to minimize.
[2024-05-23 13:43:17] [INFO ] Deduced a trap composed of 143 places in 614 ms of which 7 ms to minimize.
[2024-05-23 13:43:18] [INFO ] Deduced a trap composed of 225 places in 528 ms of which 6 ms to minimize.
[2024-05-23 13:43:19] [INFO ] Deduced a trap composed of 246 places in 605 ms of which 5 ms to minimize.
[2024-05-23 13:43:19] [INFO ] Deduced a trap composed of 168 places in 608 ms of which 6 ms to minimize.
[2024-05-23 13:43:20] [INFO ] Deduced a trap composed of 185 places in 664 ms of which 5 ms to minimize.
SMT process timed out in 45383ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1543/1543 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 515 transition count 1336
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 515 transition count 1336
Applied a total of 18 rules in 69 ms. Remains 515 /524 variables (removed 9) and now considering 1336/1543 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 515/524 places, 1336/1543 transitions.
RANDOM walk for 40000 steps (8 resets) in 550 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/20 properties
// Phase 1: matrix 1336 rows 515 cols
[2024-05-23 13:43:20] [INFO ] Computed 27 invariants in 13 ms
[2024-05-23 13:43:20] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 462/492 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 13/505 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 10/515 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:43:22] [INFO ] Deduced a trap composed of 176 places in 547 ms of which 6 ms to minimize.
[2024-05-23 13:43:22] [INFO ] Deduced a trap composed of 136 places in 495 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1336/1851 variables, 515/544 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1851 variables, 132/676 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1851 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1851 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1851/1851 variables, and 676 constraints, problems are : Problem set: 0 solved, 19 unsolved in 6257 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 515/515 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 462/492 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 13/505 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:43:28] [INFO ] Deduced a trap composed of 408 places in 372 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 10/515 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:43:29] [INFO ] Deduced a trap composed of 126 places in 592 ms of which 6 ms to minimize.
[2024-05-23 13:43:30] [INFO ] Deduced a trap composed of 238 places in 597 ms of which 6 ms to minimize.
[2024-05-23 13:43:30] [INFO ] Deduced a trap composed of 127 places in 552 ms of which 5 ms to minimize.
[2024-05-23 13:43:31] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 6 ms to minimize.
[2024-05-23 13:43:31] [INFO ] Deduced a trap composed of 119 places in 544 ms of which 5 ms to minimize.
[2024-05-23 13:43:32] [INFO ] Deduced a trap composed of 187 places in 552 ms of which 6 ms to minimize.
[2024-05-23 13:43:32] [INFO ] Deduced a trap composed of 281 places in 541 ms of which 5 ms to minimize.
[2024-05-23 13:43:33] [INFO ] Deduced a trap composed of 262 places in 605 ms of which 5 ms to minimize.
[2024-05-23 13:43:34] [INFO ] Deduced a trap composed of 237 places in 607 ms of which 5 ms to minimize.
[2024-05-23 13:43:34] [INFO ] Deduced a trap composed of 264 places in 572 ms of which 5 ms to minimize.
[2024-05-23 13:43:35] [INFO ] Deduced a trap composed of 134 places in 560 ms of which 5 ms to minimize.
[2024-05-23 13:43:35] [INFO ] Deduced a trap composed of 132 places in 574 ms of which 6 ms to minimize.
[2024-05-23 13:43:36] [INFO ] Deduced a trap composed of 145 places in 545 ms of which 5 ms to minimize.
[2024-05-23 13:43:37] [INFO ] Deduced a trap composed of 263 places in 526 ms of which 5 ms to minimize.
[2024-05-23 13:43:37] [INFO ] Deduced a trap composed of 137 places in 490 ms of which 5 ms to minimize.
[2024-05-23 13:43:38] [INFO ] Deduced a trap composed of 112 places in 530 ms of which 6 ms to minimize.
[2024-05-23 13:43:38] [INFO ] Deduced a trap composed of 136 places in 499 ms of which 5 ms to minimize.
[2024-05-23 13:43:39] [INFO ] Deduced a trap composed of 137 places in 489 ms of which 5 ms to minimize.
[2024-05-23 13:43:39] [INFO ] Deduced a trap composed of 146 places in 547 ms of which 5 ms to minimize.
[2024-05-23 13:43:40] [INFO ] Deduced a trap composed of 133 places in 524 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:43:41] [INFO ] Deduced a trap composed of 137 places in 488 ms of which 9 ms to minimize.
[2024-05-23 13:43:41] [INFO ] Deduced a trap composed of 146 places in 507 ms of which 5 ms to minimize.
[2024-05-23 13:43:42] [INFO ] Deduced a trap composed of 136 places in 556 ms of which 6 ms to minimize.
[2024-05-23 13:43:42] [INFO ] Deduced a trap composed of 127 places in 561 ms of which 6 ms to minimize.
[2024-05-23 13:43:43] [INFO ] Deduced a trap composed of 131 places in 568 ms of which 6 ms to minimize.
[2024-05-23 13:43:44] [INFO ] Deduced a trap composed of 129 places in 585 ms of which 6 ms to minimize.
[2024-05-23 13:43:44] [INFO ] Deduced a trap composed of 268 places in 570 ms of which 5 ms to minimize.
[2024-05-23 13:43:45] [INFO ] Deduced a trap composed of 313 places in 573 ms of which 5 ms to minimize.
[2024-05-23 13:43:46] [INFO ] Deduced a trap composed of 195 places in 604 ms of which 6 ms to minimize.
[2024-05-23 13:43:46] [INFO ] Deduced a trap composed of 222 places in 610 ms of which 6 ms to minimize.
[2024-05-23 13:43:47] [INFO ] Deduced a trap composed of 265 places in 553 ms of which 5 ms to minimize.
[2024-05-23 13:43:47] [INFO ] Deduced a trap composed of 211 places in 585 ms of which 5 ms to minimize.
[2024-05-23 13:43:48] [INFO ] Deduced a trap composed of 174 places in 535 ms of which 5 ms to minimize.
[2024-05-23 13:43:49] [INFO ] Deduced a trap composed of 212 places in 593 ms of which 5 ms to minimize.
[2024-05-23 13:43:49] [INFO ] Deduced a trap composed of 151 places in 563 ms of which 5 ms to minimize.
[2024-05-23 13:43:50] [INFO ] Deduced a trap composed of 205 places in 605 ms of which 5 ms to minimize.
[2024-05-23 13:43:50] [INFO ] Deduced a trap composed of 140 places in 567 ms of which 5 ms to minimize.
[2024-05-23 13:43:51] [INFO ] Deduced a trap composed of 125 places in 546 ms of which 5 ms to minimize.
[2024-05-23 13:43:52] [INFO ] Deduced a trap composed of 157 places in 581 ms of which 5 ms to minimize.
[2024-05-23 13:43:52] [INFO ] Deduced a trap composed of 209 places in 491 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:43:53] [INFO ] Deduced a trap composed of 103 places in 535 ms of which 5 ms to minimize.
[2024-05-23 13:43:54] [INFO ] Deduced a trap composed of 122 places in 513 ms of which 5 ms to minimize.
[2024-05-23 13:43:54] [INFO ] Deduced a trap composed of 64 places in 529 ms of which 6 ms to minimize.
[2024-05-23 13:43:55] [INFO ] Deduced a trap composed of 148 places in 519 ms of which 5 ms to minimize.
[2024-05-23 13:43:55] [INFO ] Deduced a trap composed of 114 places in 537 ms of which 5 ms to minimize.
[2024-05-23 13:43:56] [INFO ] Deduced a trap composed of 211 places in 510 ms of which 5 ms to minimize.
[2024-05-23 13:43:57] [INFO ] Deduced a trap composed of 205 places in 537 ms of which 5 ms to minimize.
[2024-05-23 13:43:57] [INFO ] Deduced a trap composed of 168 places in 521 ms of which 5 ms to minimize.
[2024-05-23 13:43:58] [INFO ] Deduced a trap composed of 155 places in 599 ms of which 6 ms to minimize.
[2024-05-23 13:43:59] [INFO ] Deduced a trap composed of 230 places in 530 ms of which 6 ms to minimize.
[2024-05-23 13:43:59] [INFO ] Deduced a trap composed of 173 places in 636 ms of which 5 ms to minimize.
[2024-05-23 13:44:00] [INFO ] Deduced a trap composed of 119 places in 674 ms of which 6 ms to minimize.
[2024-05-23 13:44:01] [INFO ] Deduced a trap composed of 167 places in 624 ms of which 6 ms to minimize.
[2024-05-23 13:44:01] [INFO ] Deduced a trap composed of 155 places in 556 ms of which 5 ms to minimize.
[2024-05-23 13:44:02] [INFO ] Deduced a trap composed of 156 places in 519 ms of which 5 ms to minimize.
[2024-05-23 13:44:02] [INFO ] Deduced a trap composed of 146 places in 621 ms of which 5 ms to minimize.
[2024-05-23 13:44:03] [INFO ] Deduced a trap composed of 256 places in 529 ms of which 5 ms to minimize.
[2024-05-23 13:44:04] [INFO ] Deduced a trap composed of 245 places in 586 ms of which 5 ms to minimize.
[2024-05-23 13:44:04] [INFO ] Deduced a trap composed of 234 places in 473 ms of which 5 ms to minimize.
[2024-05-23 13:44:05] [INFO ] Deduced a trap composed of 198 places in 636 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:44:06] [INFO ] Deduced a trap composed of 172 places in 619 ms of which 6 ms to minimize.
[2024-05-23 13:44:07] [INFO ] Deduced a trap composed of 86 places in 445 ms of which 6 ms to minimize.
[2024-05-23 13:44:08] [INFO ] Deduced a trap composed of 114 places in 536 ms of which 5 ms to minimize.
[2024-05-23 13:44:08] [INFO ] Deduced a trap composed of 100 places in 505 ms of which 6 ms to minimize.
[2024-05-23 13:44:09] [INFO ] Deduced a trap composed of 140 places in 511 ms of which 5 ms to minimize.
[2024-05-23 13:44:09] [INFO ] Deduced a trap composed of 115 places in 506 ms of which 5 ms to minimize.
[2024-05-23 13:44:10] [INFO ] Deduced a trap composed of 123 places in 517 ms of which 5 ms to minimize.
[2024-05-23 13:44:11] [INFO ] Deduced a trap composed of 184 places in 517 ms of which 5 ms to minimize.
[2024-05-23 13:44:11] [INFO ] Deduced a trap composed of 223 places in 517 ms of which 5 ms to minimize.
[2024-05-23 13:44:12] [INFO ] Deduced a trap composed of 240 places in 511 ms of which 5 ms to minimize.
[2024-05-23 13:44:12] [INFO ] Deduced a trap composed of 239 places in 527 ms of which 6 ms to minimize.
[2024-05-23 13:44:13] [INFO ] Deduced a trap composed of 236 places in 540 ms of which 5 ms to minimize.
[2024-05-23 13:44:13] [INFO ] Deduced a trap composed of 233 places in 540 ms of which 6 ms to minimize.
[2024-05-23 13:44:14] [INFO ] Deduced a trap composed of 221 places in 503 ms of which 6 ms to minimize.
[2024-05-23 13:44:15] [INFO ] Deduced a trap composed of 194 places in 538 ms of which 5 ms to minimize.
[2024-05-23 13:44:15] [INFO ] Deduced a trap composed of 151 places in 573 ms of which 6 ms to minimize.
[2024-05-23 13:44:16] [INFO ] Deduced a trap composed of 264 places in 567 ms of which 5 ms to minimize.
[2024-05-23 13:44:16] [INFO ] Deduced a trap composed of 245 places in 546 ms of which 5 ms to minimize.
[2024-05-23 13:44:17] [INFO ] Deduced a trap composed of 232 places in 623 ms of which 6 ms to minimize.
[2024-05-23 13:44:18] [INFO ] Deduced a trap composed of 280 places in 541 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:44:20] [INFO ] Deduced a trap composed of 187 places in 604 ms of which 5 ms to minimize.
[2024-05-23 13:44:20] [INFO ] Deduced a trap composed of 61 places in 542 ms of which 6 ms to minimize.
[2024-05-23 13:44:21] [INFO ] Deduced a trap composed of 212 places in 568 ms of which 5 ms to minimize.
[2024-05-23 13:44:22] [INFO ] Deduced a trap composed of 94 places in 588 ms of which 6 ms to minimize.
[2024-05-23 13:44:23] [INFO ] Deduced a trap composed of 143 places in 560 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:44:24] [INFO ] Deduced a trap composed of 60 places in 524 ms of which 5 ms to minimize.
[2024-05-23 13:44:25] [INFO ] Deduced a trap composed of 263 places in 562 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 13:44:27] [INFO ] Deduced a trap composed of 164 places in 559 ms of which 5 ms to minimize.
[2024-05-23 13:44:27] [INFO ] Deduced a trap composed of 149 places in 531 ms of which 5 ms to minimize.
[2024-05-23 13:44:28] [INFO ] Deduced a trap composed of 152 places in 533 ms of which 5 ms to minimize.
[2024-05-23 13:44:28] [INFO ] Deduced a trap composed of 127 places in 515 ms of which 5 ms to minimize.
[2024-05-23 13:44:29] [INFO ] Deduced a trap composed of 129 places in 530 ms of which 5 ms to minimize.
[2024-05-23 13:44:30] [INFO ] Deduced a trap composed of 141 places in 530 ms of which 5 ms to minimize.
[2024-05-23 13:44:30] [INFO ] Deduced a trap composed of 209 places in 519 ms of which 5 ms to minimize.
[2024-05-23 13:44:31] [INFO ] Deduced a trap composed of 150 places in 521 ms of which 5 ms to minimize.
[2024-05-23 13:44:32] [INFO ] Deduced a trap composed of 269 places in 626 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 1336/1851 variables, 515/641 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1851 variables, 132/773 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1851 variables, 19/792 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1851/1851 variables, and 792 constraints, problems are : Problem set: 0 solved, 19 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 515/515 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 99/99 constraints]
After SMT, in 81347ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1336/1336 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1244
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1244
Applied a total of 8 rules in 56 ms. Remains 511 /515 variables (removed 4) and now considering 1244/1336 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 511/515 places, 1244/1336 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 13:44:42] [INFO ] Flatten gal took : 98 ms
[2024-05-23 13:44:42] [INFO ] Flatten gal took : 110 ms
[2024-05-23 13:44:42] [INFO ] Input system was already deterministic with 2229 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 632 transition count 1145
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 632 transition count 1145
Applied a total of 100 rules in 32 ms. Remains 632 /682 variables (removed 50) and now considering 1145/2229 (removed 1084) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 632/682 places, 1145/2229 transitions.
[2024-05-23 13:44:42] [INFO ] Flatten gal took : 42 ms
[2024-05-23 13:44:42] [INFO ] Flatten gal took : 47 ms
[2024-05-23 13:44:43] [INFO ] Input system was already deterministic with 1145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 2 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 320 place count 494 transition count 875
Iterating global reduction 0 with 56 rules applied. Total rules applied 376 place count 494 transition count 875
Applied a total of 376 rules in 81 ms. Remains 494 /682 variables (removed 188) and now considering 875/2229 (removed 1354) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 494/682 places, 875/2229 transitions.
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 32 ms
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 35 ms
[2024-05-23 13:44:43] [INFO ] Input system was already deterministic with 875 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 33 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 39 ms
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 43 ms
[2024-05-23 13:44:43] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 638 transition count 1261
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 638 transition count 1261
Applied a total of 88 rules in 34 ms. Remains 638 /682 variables (removed 44) and now considering 1261/2229 (removed 968) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 638/682 places, 1261/2229 transitions.
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 46 ms
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 51 ms
[2024-05-23 13:44:43] [INFO ] Input system was already deterministic with 1261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 628 transition count 1031
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 628 transition count 1031
Applied a total of 108 rules in 40 ms. Remains 628 /682 variables (removed 54) and now considering 1031/2229 (removed 1198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 628/682 places, 1031/2229 transitions.
[2024-05-23 13:44:43] [INFO ] Flatten gal took : 35 ms
[2024-05-23 13:44:44] [INFO ] Flatten gal took : 38 ms
[2024-05-23 13:44:44] [INFO ] Input system was already deterministic with 1031 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 320 place count 494 transition count 875
Iterating global reduction 0 with 56 rules applied. Total rules applied 376 place count 494 transition count 875
Applied a total of 376 rules in 63 ms. Remains 494 /682 variables (removed 188) and now considering 875/2229 (removed 1354) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 494/682 places, 875/2229 transitions.
[2024-05-23 13:44:44] [INFO ] Flatten gal took : 27 ms
[2024-05-23 13:44:44] [INFO ] Flatten gal took : 33 ms
[2024-05-23 13:44:44] [INFO ] Input system was already deterministic with 875 transitions.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 836086 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836086 steps, saw 656031 distinct states, run finished after 3007 ms. (steps per millisecond=278 ) properties seen :0
// Phase 1: matrix 875 rows 494 cols
[2024-05-23 13:44:47] [INFO ] Computed 27 invariants in 9 ms
[2024-05-23 13:44:47] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/494 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 875/1369 variables, 494/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1369 variables, 132/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1369 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/494 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 875/1369 variables, 494/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1369 variables, 132/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2080ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 25 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 494/494 places, 875/875 transitions.
RANDOM walk for 400000 steps (8 resets) in 2717 ms. (147 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 13:44:50] [INFO ] Invariant cache hit.
[2024-05-23 13:44:50] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-23 13:44:50] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 28 ms returned sat
[2024-05-23 13:44:51] [INFO ] After 553ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 13:44:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 13:44:51] [INFO ] After 54ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 13:44:51] [INFO ] After 181ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 13:44:51] [INFO ] After 902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 13:44:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-23 13:44:51] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 23 ms returned sat
[2024-05-23 13:44:52] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 13:44:52] [INFO ] After 201ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 13:44:52] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 13:44:52] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 15986 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4899 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3690339 steps, run timeout after 15001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 3690339 steps, saw 2793471 distinct states, run finished after 15001 ms. (steps per millisecond=246 ) properties seen :0
[2024-05-23 13:45:12] [INFO ] Invariant cache hit.
[2024-05-23 13:45:12] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 13:45:13] [INFO ] Deduced a trap composed of 412 places in 424 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/494 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 875/1369 variables, 494/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 132/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/494 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 875/1369 variables, 494/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 132/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 655 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 26 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 494/494 places, 875/875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 23 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
[2024-05-23 13:45:15] [INFO ] Invariant cache hit.
[2024-05-23 13:45:16] [INFO ] Implicit Places using invariants in 1091 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 493/494 places, 875/875 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 349 transition count 731
Applied a total of 288 rules in 41 ms. Remains 349 /493 variables (removed 144) and now considering 731/875 (removed 144) transitions.
// Phase 1: matrix 731 rows 349 cols
[2024-05-23 13:45:16] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 13:45:17] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-23 13:45:17] [INFO ] Invariant cache hit.
[2024-05-23 13:45:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 13:45:19] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 349/494 places, 731/875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3812 ms. Remains : 349/494 places, 731/875 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9610 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1611648 steps (3 resets) in 1912 ms. (842 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-12-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 38 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-05-23 13:45:22] [INFO ] Flatten gal took : 33 ms
[2024-05-23 13:45:22] [INFO ] Flatten gal took : 39 ms
[2024-05-23 13:45:22] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 635 transition count 1214
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 635 transition count 1214
Applied a total of 94 rules in 41 ms. Remains 635 /682 variables (removed 47) and now considering 1214/2229 (removed 1015) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 635/682 places, 1214/2229 transitions.
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 36 ms
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 44 ms
[2024-05-23 13:45:23] [INFO ] Input system was already deterministic with 1214 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 682 transition count 2098
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 551 transition count 2098
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 312 place count 501 transition count 1014
Iterating global reduction 0 with 50 rules applied. Total rules applied 362 place count 501 transition count 1014
Applied a total of 362 rules in 57 ms. Remains 501 /682 variables (removed 181) and now considering 1014/2229 (removed 1215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 501/682 places, 1014/2229 transitions.
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 30 ms
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 31 ms
[2024-05-23 13:45:23] [INFO ] Input system was already deterministic with 1014 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 625 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 625 transition count 984
Applied a total of 114 rules in 37 ms. Remains 625 /682 variables (removed 57) and now considering 984/2229 (removed 1245) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 625/682 places, 984/2229 transitions.
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 37 ms
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 28 ms
[2024-05-23 13:45:23] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 318 place count 496 transition count 921
Iterating global reduction 0 with 54 rules applied. Total rules applied 372 place count 496 transition count 921
Applied a total of 372 rules in 56 ms. Remains 496 /682 variables (removed 186) and now considering 921/2229 (removed 1308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 496/682 places, 921/2229 transitions.
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 25 ms
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 28 ms
[2024-05-23 13:45:23] [INFO ] Input system was already deterministic with 921 transitions.
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 7158 steps (0 resets) in 20 ms. (340 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-12-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 38 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 28 ms
[2024-05-23 13:45:23] [INFO ] Flatten gal took : 32 ms
[2024-05-23 13:45:23] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 626 transition count 985
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 626 transition count 985
Applied a total of 112 rules in 37 ms. Remains 626 /682 variables (removed 56) and now considering 985/2229 (removed 1244) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 626/682 places, 985/2229 transitions.
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 26 ms
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 29 ms
[2024-05-23 13:45:24] [INFO ] Input system was already deterministic with 985 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 625 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 625 transition count 984
Applied a total of 114 rules in 37 ms. Remains 625 /682 variables (removed 57) and now considering 984/2229 (removed 1245) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 625/682 places, 984/2229 transitions.
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 25 ms
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 29 ms
[2024-05-23 13:45:24] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 627 transition count 1030
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 627 transition count 1030
Applied a total of 110 rules in 37 ms. Remains 627 /682 variables (removed 55) and now considering 1030/2229 (removed 1199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 627/682 places, 1030/2229 transitions.
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 26 ms
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 30 ms
[2024-05-23 13:45:24] [INFO ] Input system was already deterministic with 1030 transitions.
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 73 ms
[2024-05-23 13:45:24] [INFO ] Flatten gal took : 76 ms
[2024-05-23 13:45:24] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-23 13:45:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 2229 transitions and 8646 arcs took 20 ms.
Total runtime 230558 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-12
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 682
TRANSITIONS: 2229
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.068s, Sys 0.002s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1117
MODEL NAME: /home/mcc/execution/415/model
682 places, 2229 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="Anderson-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Anderson-PT-12, 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 r003-smll-171620117600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 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 '
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 ;