About the Execution of GreatSPN+red for Anderson-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2306.455 | 142069.00 | 344294.00 | 242.60 | 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.r012-smll-171620124200222.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-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124200222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 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:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 927K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1716264154038
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:02:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-21 04:02:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:02:36] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-05-21 04:02:36] [INFO ] Transformed 505 places.
[2024-05-21 04:02:36] [INFO ] Transformed 1845 transitions.
[2024-05-21 04:02:36] [INFO ] Found NUPN structural information;
[2024-05-21 04:02:36] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 472 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 10 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 134 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2024-05-21 04:02:36] [INFO ] Computed 21 invariants in 90 ms
[2024-05-21 04:02:38] [INFO ] Implicit Places using invariants in 2308 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2361 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 32 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2024-05-21 04:02:38] [INFO ] Computed 20 invariants in 26 ms
[2024-05-21 04:02:40] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-21 04:02:40] [INFO ] Invariant cache hit.
[2024-05-21 04:02:40] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 04:02:44] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 5940 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 8499 ms. Remains : 351/505 places, 1692/1845 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 5852 ms. (6 steps per ms) remains 786/1683 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 786/786 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 786/786 properties
[2024-05-21 04:02:46] [INFO ] Invariant cache hit.
[2024-05-21 04:02:46] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/2043 variables, and 154 constraints, problems are : Problem set: 0 solved, 786 unsolved in 5068 ms.
Refiners :[Domain max(s): 153/351 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 1/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/2043 variables, and 154 constraints, problems are : Problem set: 0 solved, 786 unsolved in 5029 ms.
Refiners :[Domain max(s): 153/351 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 1/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 0/0 constraints]
After SMT, in 13284ms problems are : Problem set: 0 solved, 786 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 153 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 1692/1692 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 319 transition count 1660
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 319 transition count 1660
Applied a total of 64 rules in 149 ms. Remains 319 /351 variables (removed 32) and now considering 1660/1692 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 319/351 places, 1660/1692 transitions.
RANDOM walk for 3059499 steps (8 resets) in 120004 ms. (25 steps per ms) remains 272/786 properties
BEST_FIRST walk for 40002 steps (8 resets) in 337 ms. (118 steps per ms) remains 271/272 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40002 steps (8 resets) in 467 ms. (85 steps per ms) remains 264/271 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 259/264 properties
BEST_FIRST walk for 40000 steps (8 resets) in 322 ms. (123 steps per ms) remains 259/259 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 257/259 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 241/257 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 241/241 properties
BEST_FIRST walk for 40002 steps (8 resets) in 312 ms. (127 steps per ms) remains 241/241 properties
BEST_FIRST walk for 40001 steps (8 resets) in 264 ms. (150 steps per ms) remains 241/241 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 240/241 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40001 steps (8 resets) in 260 ms. (153 steps per ms) remains 204/240 properties
BEST_FIRST walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 203/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40001 steps (8 resets) in 225 ms. (176 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 201/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 200/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 199/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40001 steps (8 resets) in 338 ms. (117 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 198/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 193/198 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 128/193 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 124/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 123/124 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 120/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 119/120 properties
BEST_FIRST walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 114/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 111/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 108/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 106/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 102/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 99/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 98/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 58/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 56/58 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 55/56 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 51/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 50/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 49/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 49/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 45/49 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 45/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 45/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 45/45 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 41/45 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 41/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 40/41 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 40/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 40/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 40/40 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 36/40 properties
// Phase 1: matrix 1660 rows 319 cols
[2024-05-21 04:03:35] [INFO ] Computed 20 invariants in 14 ms
[2024-05-21 04:03:35] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 267/295 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 23/318 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-21 04:03:37] [INFO ] Deduced a trap composed of 80 places in 795 ms of which 52 ms to minimize.
[2024-05-21 04:03:38] [INFO ] Deduced a trap composed of 75 places in 696 ms of which 8 ms to minimize.
[2024-05-21 04:03:39] [INFO ] Deduced a trap composed of 102 places in 745 ms of which 6 ms to minimize.
[2024-05-21 04:03:40] [INFO ] Deduced a trap composed of 110 places in 617 ms of which 6 ms to minimize.
[2024-05-21 04:03:40] [INFO ] Deduced a trap composed of 138 places in 643 ms of which 6 ms to minimize.
[2024-05-21 04:03:41] [INFO ] Deduced a trap composed of 123 places in 678 ms of which 6 ms to minimize.
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 110 places in 666 ms of which 6 ms to minimize.
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 90 places in 660 ms of which 5 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 103 places in 555 ms of which 5 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 140 places in 695 ms of which 5 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 40 places in 682 ms of which 6 ms to minimize.
[2024-05-21 04:03:45] [INFO ] Deduced a trap composed of 117 places in 594 ms of which 5 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 102 places in 675 ms of which 5 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 74 places in 673 ms of which 5 ms to minimize.
[2024-05-21 04:03:47] [INFO ] Deduced a trap composed of 105 places in 701 ms of which 6 ms to minimize.
[2024-05-21 04:03:48] [INFO ] Deduced a trap composed of 101 places in 709 ms of which 5 ms to minimize.
[2024-05-21 04:03:49] [INFO ] Deduced a trap composed of 137 places in 711 ms of which 6 ms to minimize.
[2024-05-21 04:03:49] [INFO ] Deduced a trap composed of 124 places in 695 ms of which 5 ms to minimize.
[2024-05-21 04:03:50] [INFO ] Deduced a trap composed of 82 places in 680 ms of which 6 ms to minimize.
[2024-05-21 04:03:51] [INFO ] Deduced a trap composed of 106 places in 712 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-21 04:03:52] [INFO ] Deduced a trap composed of 194 places in 695 ms of which 5 ms to minimize.
[2024-05-21 04:03:52] [INFO ] Deduced a trap composed of 89 places in 692 ms of which 5 ms to minimize.
[2024-05-21 04:03:53] [INFO ] Deduced a trap composed of 79 places in 618 ms of which 6 ms to minimize.
[2024-05-21 04:03:54] [INFO ] Deduced a trap composed of 99 places in 624 ms of which 5 ms to minimize.
[2024-05-21 04:03:54] [INFO ] Deduced a trap composed of 134 places in 487 ms of which 4 ms to minimize.
[2024-05-21 04:03:55] [INFO ] Deduced a trap composed of 98 places in 537 ms of which 6 ms to minimize.
[2024-05-21 04:03:55] [INFO ] Deduced a trap composed of 80 places in 613 ms of which 5 ms to minimize.
[2024-05-21 04:03:56] [INFO ] Deduced a trap composed of 76 places in 537 ms of which 4 ms to minimize.
[2024-05-21 04:03:56] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 4 ms to minimize.
[2024-05-21 04:03:57] [INFO ] Deduced a trap composed of 84 places in 399 ms of which 3 ms to minimize.
[2024-05-21 04:03:57] [INFO ] Deduced a trap composed of 100 places in 395 ms of which 3 ms to minimize.
[2024-05-21 04:03:58] [INFO ] Deduced a trap composed of 90 places in 369 ms of which 3 ms to minimize.
[2024-05-21 04:03:58] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 3 ms to minimize.
[2024-05-21 04:03:59] [INFO ] Deduced a trap composed of 110 places in 486 ms of which 5 ms to minimize.
[2024-05-21 04:03:59] [INFO ] Deduced a trap composed of 126 places in 680 ms of which 5 ms to minimize.
[2024-05-21 04:04:00] [INFO ] Deduced a trap composed of 80 places in 604 ms of which 4 ms to minimize.
[2024-05-21 04:04:00] [INFO ] Deduced a trap composed of 111 places in 470 ms of which 5 ms to minimize.
[2024-05-21 04:04:01] [INFO ] Deduced a trap composed of 111 places in 586 ms of which 3 ms to minimize.
[2024-05-21 04:04:02] [INFO ] Deduced a trap composed of 109 places in 448 ms of which 4 ms to minimize.
[2024-05-21 04:04:02] [INFO ] Deduced a trap composed of 66 places in 443 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-21 04:04:03] [INFO ] Deduced a trap composed of 126 places in 478 ms of which 4 ms to minimize.
[2024-05-21 04:04:03] [INFO ] Deduced a trap composed of 178 places in 435 ms of which 3 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 138 places in 423 ms of which 3 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 159 places in 449 ms of which 4 ms to minimize.
[2024-05-21 04:04:05] [INFO ] Deduced a trap composed of 156 places in 460 ms of which 3 ms to minimize.
[2024-05-21 04:04:05] [INFO ] Deduced a trap composed of 106 places in 446 ms of which 3 ms to minimize.
[2024-05-21 04:04:05] [INFO ] Deduced a trap composed of 176 places in 452 ms of which 3 ms to minimize.
[2024-05-21 04:04:06] [INFO ] Deduced a trap composed of 125 places in 455 ms of which 3 ms to minimize.
[2024-05-21 04:04:06] [INFO ] Deduced a trap composed of 109 places in 441 ms of which 3 ms to minimize.
[2024-05-21 04:04:07] [INFO ] Deduced a trap composed of 138 places in 367 ms of which 3 ms to minimize.
[2024-05-21 04:04:07] [INFO ] Deduced a trap composed of 157 places in 453 ms of which 4 ms to minimize.
[2024-05-21 04:04:08] [INFO ] Deduced a trap composed of 126 places in 445 ms of which 4 ms to minimize.
[2024-05-21 04:04:08] [INFO ] Deduced a trap composed of 155 places in 463 ms of which 5 ms to minimize.
[2024-05-21 04:04:09] [INFO ] Deduced a trap composed of 136 places in 448 ms of which 4 ms to minimize.
[2024-05-21 04:04:09] [INFO ] Deduced a trap composed of 183 places in 451 ms of which 4 ms to minimize.
[2024-05-21 04:04:10] [INFO ] Deduced a trap composed of 56 places in 488 ms of which 4 ms to minimize.
[2024-05-21 04:04:10] [INFO ] Deduced a trap composed of 57 places in 577 ms of which 5 ms to minimize.
[2024-05-21 04:04:11] [INFO ] Deduced a trap composed of 116 places in 458 ms of which 3 ms to minimize.
[2024-05-21 04:04:12] [INFO ] Deduced a trap composed of 64 places in 648 ms of which 4 ms to minimize.
[2024-05-21 04:04:12] [INFO ] Deduced a trap composed of 118 places in 494 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-21 04:04:14] [INFO ] Deduced a trap composed of 106 places in 365 ms of which 3 ms to minimize.
[2024-05-21 04:04:14] [INFO ] Deduced a trap composed of 57 places in 588 ms of which 5 ms to minimize.
[2024-05-21 04:04:15] [INFO ] Deduced a trap composed of 106 places in 456 ms of which 4 ms to minimize.
[2024-05-21 04:04:16] [INFO ] Deduced a trap composed of 128 places in 654 ms of which 5 ms to minimize.
[2024-05-21 04:04:16] [INFO ] Deduced a trap composed of 138 places in 590 ms of which 4 ms to minimize.
[2024-05-21 04:04:17] [INFO ] Deduced a trap composed of 122 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:04:17] [INFO ] Deduced a trap composed of 86 places in 487 ms of which 4 ms to minimize.
[2024-05-21 04:04:18] [INFO ] Deduced a trap composed of 89 places in 443 ms of which 3 ms to minimize.
[2024-05-21 04:04:18] [INFO ] Deduced a trap composed of 111 places in 355 ms of which 5 ms to minimize.
[2024-05-21 04:04:19] [INFO ] Deduced a trap composed of 136 places in 670 ms of which 6 ms to minimize.
[2024-05-21 04:04:20] [INFO ] Deduced a trap composed of 126 places in 532 ms of which 3 ms to minimize.
[2024-05-21 04:04:20] [INFO ] Deduced a trap composed of 139 places in 545 ms of which 5 ms to minimize.
SMT process timed out in 45458ms, After SMT, problems are : Problem set: 0 solved, 36 unsolved
Fused 36 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1660/1660 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 232 transition count 821
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 232 transition count 821
Applied a total of 174 rules in 79 ms. Remains 232 /319 variables (removed 87) and now considering 821/1660 (removed 839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 232/319 places, 821/1660 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25783 ms. (155 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 831 ms. (480 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 782 ms. (510 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 771 ms. (518 steps per ms) remains 29/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 717 ms. (557 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 719 ms. (555 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 740 ms. (539 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (8 resets) in 718 ms. (556 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 711 ms. (561 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 777 ms. (514 steps per ms) remains 23/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 781 ms. (511 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 759 ms. (526 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 784 ms. (509 steps per ms) remains 20/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 691 ms. (578 steps per ms) remains 17/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 701 ms. (569 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 637 ms. (626 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 611 ms. (653 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 620 ms. (644 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 546 ms. (731 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 559 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 508 ms. (785 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400002 steps (8 resets) in 526 ms. (759 steps per ms) remains 9/9 properties
// Phase 1: matrix 821 rows 232 cols
[2024-05-21 04:04:32] [INFO ] Computed 20 invariants in 8 ms
[2024-05-21 04:04:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 106/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 108/224 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 8/232 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 04:04:33] [INFO ] Deduced a trap composed of 116 places in 280 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 04:04:33] [INFO ] Deduced a trap composed of 93 places in 369 ms of which 4 ms to minimize.
[2024-05-21 04:04:34] [INFO ] Deduced a trap composed of 76 places in 400 ms of which 4 ms to minimize.
[2024-05-21 04:04:34] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 4 ms to minimize.
[2024-05-21 04:04:34] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 04:04:35] [INFO ] Deduced a trap composed of 105 places in 343 ms of which 3 ms to minimize.
[2024-05-21 04:04:35] [INFO ] Deduced a trap composed of 87 places in 391 ms of which 4 ms to minimize.
[2024-05-21 04:04:36] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 3 ms to minimize.
[2024-05-21 04:04:36] [INFO ] Deduced a trap composed of 103 places in 283 ms of which 3 ms to minimize.
[2024-05-21 04:04:36] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 3 ms to minimize.
[2024-05-21 04:04:36] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 2 ms to minimize.
[2024-05-21 04:04:37] [INFO ] Deduced a trap composed of 81 places in 243 ms of which 2 ms to minimize.
[2024-05-21 04:04:37] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 3 ms to minimize.
[2024-05-21 04:04:37] [INFO ] Deduced a trap composed of 78 places in 390 ms of which 4 ms to minimize.
[2024-05-21 04:04:38] [INFO ] Deduced a trap composed of 60 places in 397 ms of which 4 ms to minimize.
[2024-05-21 04:04:38] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 4 ms to minimize.
[2024-05-21 04:04:38] [INFO ] Deduced a trap composed of 59 places in 339 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 04:04:39] [INFO ] Deduced a trap composed of 90 places in 231 ms of which 2 ms to minimize.
[2024-05-21 04:04:39] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-05-21 04:04:39] [INFO ] Deduced a trap composed of 87 places in 269 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 821/1053 variables, 232/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1053 variables, 72/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1053 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1053 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 344 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8472 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 232/232 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 106/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 108/224 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 8/232 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 04:04:41] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 3 ms to minimize.
[2024-05-21 04:04:41] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-05-21 04:04:41] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 3 ms to minimize.
[2024-05-21 04:04:42] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 4 ms to minimize.
[2024-05-21 04:04:42] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-05-21 04:04:42] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 2 ms to minimize.
[2024-05-21 04:04:42] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 4 ms to minimize.
[2024-05-21 04:04:43] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 821/1053 variables, 232/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1053 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1053 variables, 9/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1053 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1053 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 361 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3682 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 232/232 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 28/28 constraints]
After SMT, in 12192ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 10 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 821/821 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 216 transition count 549
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 216 transition count 549
Applied a total of 32 rules in 29 ms. Remains 216 /232 variables (removed 16) and now considering 549/821 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 216/232 places, 549/821 transitions.
RANDOM walk for 4000000 steps (8 resets) in 13330 ms. (300 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 4073 ms. (981 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3952 ms. (1011 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3638 ms. (1099 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3532 ms. (1132 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3308 ms. (1208 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3168 ms. (1262 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3005 ms. (1330 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3610597 steps (8 resets) in 2485 ms. (1452 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1692 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 140164 ms.
ITS solved all properties within timeout
BK_STOP 1716264296107
--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-09, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124200222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;