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.r034-smll-171620174900122.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 AutoFlight-PT-48b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-smll-171620174900122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 22:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 956K 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 1716245290003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-48b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:48:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-20 22:48:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:48:12] [INFO ] Load time of PNML (sax parser for PT used): 526 ms
[2024-05-20 22:48:12] [INFO ] Transformed 3950 places.
[2024-05-20 22:48:12] [INFO ] Transformed 3936 transitions.
[2024-05-20 22:48:12] [INFO ] Found NUPN structural information;
[2024-05-20 22:48:12] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 874 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1708 transitions
Trivial Post-agglo rules discarded 1708 transitions
Performed 1708 trivial Post agglomeration. Transition count delta: 1708
Iterating post reduction 0 with 1708 rules applied. Total rules applied 1708 place count 3950 transition count 2228
Reduce places removed 1708 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1996 rules applied. Total rules applied 3704 place count 2242 transition count 1940
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 3800 place count 2146 transition count 1940
Performed 507 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 507 Pre rules applied. Total rules applied 3800 place count 2146 transition count 1433
Deduced a syphon composed of 507 places in 49 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 4814 place count 1639 transition count 1433
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 2 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 6214 place count 939 transition count 733
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 6214 rules in 707 ms. Remains 939 /3950 variables (removed 3011) and now considering 733/3936 (removed 3203) transitions.
// Phase 1: matrix 733 rows 939 cols
[2024-05-20 22:48:13] [INFO ] Computed 258 invariants in 60 ms
[2024-05-20 22:48:15] [INFO ] Implicit Places using invariants in 2470 ms returned [255, 258, 261, 264, 267, 270, 273, 276, 279, 282, 285, 288, 291, 294, 297, 300, 303, 306, 309, 312, 315, 318, 321, 324, 327, 330, 333, 336, 339, 342, 345, 348, 351, 354, 357, 360, 363, 366, 369, 372, 375, 378, 381, 384, 387, 390, 393, 396, 938]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 2522 ms to find 49 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 890/3950 places, 733/3936 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 890 transition count 685
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 842 transition count 685
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 0 with 104 rules applied. Total rules applied 200 place count 790 transition count 633
Applied a total of 200 rules in 43 ms. Remains 790 /890 variables (removed 100) and now considering 633/733 (removed 100) transitions.
// Phase 1: matrix 633 rows 790 cols
[2024-05-20 22:48:16] [INFO ] Computed 209 invariants in 6 ms
[2024-05-20 22:48:16] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-05-20 22:48:16] [INFO ] Invariant cache hit.
[2024-05-20 22:48:17] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-20 22:48:22] [INFO ] Implicit Places using invariants and state equation in 5984 ms returned []
Implicit Place search using SMT with State Equation took 6827 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 790/3950 places, 633/3936 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 10132 ms. Remains : 790/3950 places, 633/3936 transitions.
Discarding 144 transitions out of 633. Remains 489
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (338 resets) in 5347 ms. (7 steps per ms) remains 218/488 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
[2024-05-20 22:48:24] [INFO ] Invariant cache hit.
[2024-05-20 22:48:24] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 376/376 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 288/664 variables, 146/522 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/664 variables, 288/810 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/1423 variables, and 810 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5032 ms.
Refiners :[Domain max(s): 664/790 constraints, Positive P Invariants (semi-flows): 146/209 constraints, State Equation: 0/790 constraints, ReadFeed: 0/192 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 376/376 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 288/664 variables, 146/522 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/664 variables, 288/810 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 31 ms to minimize.
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 5 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 3 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 4 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 4 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 4 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 4 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 4 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 3 ms to minimize.
SMT process timed out in 10442ms, After SMT, problems are : Problem set: 0 solved, 218 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 376 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 633/633 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 763 transition count 606
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 763 transition count 606
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 111 place count 763 transition count 549
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 168 place count 706 transition count 549
Applied a total of 168 rules in 165 ms. Remains 706 /790 variables (removed 84) and now considering 549/633 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 706/790 places, 549/633 transitions.
RANDOM walk for 4000000 steps (59876 resets) in 107130 ms. (37 steps per ms) remains 102/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 288 ms. (138 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 276 ms. (144 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 270 ms. (147 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 197 ms. (202 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 193 ms. (206 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 192 ms. (207 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 200 ms. (199 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 192 ms. (207 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 196 ms. (203 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 196 ms. (203 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (12 resets) in 188 ms. (211 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 216 ms. (184 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 214 ms. (186 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 196 ms. (203 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (12 resets) in 189 ms. (210 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 204 ms. (195 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 196 ms. (203 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 192 ms. (207 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 194 ms. (205 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 188 ms. (211 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 187 ms. (212 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (12 resets) in 195 ms. (204 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 188 ms. (211 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 192 ms. (207 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 189 ms. (210 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 194 ms. (205 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 187 ms. (212 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 186 ms. (213 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 182 ms. (218 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (12 resets) in 184 ms. (216 steps per ms) remains 102/102 properties
// Phase 1: matrix 549 rows 706 cols
[2024-05-20 22:49:06] [INFO ] Computed 209 invariants in 6 ms
[2024-05-20 22:49:06] [INFO ] State equation strengthened by 249 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 289/454 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 252/706 variables, 168/209 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-20 22:49:11] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:49:11] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:49:11] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-20 22:49:11] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:49:11] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:49:12] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:49:12] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:49:12] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/706 variables, 8/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 549/1255 variables, 706/923 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 249/1172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1255 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1255/1255 variables, and 1172 constraints, problems are : Problem set: 0 solved, 102 unsolved in 31880 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 706/706 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 289/454 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 252/706 variables, 168/209 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/706 variables, 8/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-20 22:49:40] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:49:40] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:49:40] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-20 22:49:40] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:49:40] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 549/1255 variables, 706/928 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 249/1177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1255 variables, 102/1279 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1255 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1255/1255 variables, and 1279 constraints, problems are : Problem set: 0 solved, 102 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 706/706 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints]
After SMT, in 76989ms problems are : Problem set: 0 solved, 102 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 549/549 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 685 transition count 528
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 685 transition count 528
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 57 place count 685 transition count 513
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 72 place count 670 transition count 513
Applied a total of 72 rules in 149 ms. Remains 670 /706 variables (removed 36) and now considering 513/549 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 670/706 places, 513/549 transitions.
RANDOM walk for 4000000 steps (39684 resets) in 92216 ms. (43 steps per ms) remains 95/102 properties
BEST_FIRST walk for 400004 steps (100 resets) in 2181 ms. (183 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (99 resets) in 2453 ms. (163 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (101 resets) in 2323 ms. (172 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (97 resets) in 2503 ms. (159 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (169 resets) in 2476 ms. (161 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (165 resets) in 2367 ms. (168 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (164 resets) in 2389 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2305 ms. (173 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2410 ms. (165 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (152 resets) in 2327 ms. (171 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (167 resets) in 2383 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (154 resets) in 2335 ms. (171 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (162 resets) in 2375 ms. (168 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400002 steps (156 resets) in 2301 ms. (173 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (159 resets) in 2478 ms. (161 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (156 resets) in 2414 ms. (165 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (167 resets) in 2385 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (162 resets) in 2314 ms. (172 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (164 resets) in 2389 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2357 ms. (169 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (170 resets) in 2408 ms. (166 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (154 resets) in 2343 ms. (170 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (171 resets) in 2409 ms. (165 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (152 resets) in 2400 ms. (166 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (160 resets) in 2834 ms. (141 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (149 resets) in 2389 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (160 resets) in 2484 ms. (160 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2358 ms. (169 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (167 resets) in 2536 ms. (157 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (157 resets) in 2358 ms. (169 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (159 resets) in 2445 ms. (163 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (162 resets) in 2495 ms. (160 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (155 resets) in 2474 ms. (161 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (158 resets) in 2966 ms. (134 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (164 resets) in 2522 ms. (158 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (154 resets) in 2444 ms. (163 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (161 resets) in 2349 ms. (170 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (165 resets) in 2432 ms. (164 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (153 resets) in 2389 ms. (167 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (160 resets) in 2304 ms. (173 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (169 resets) in 2465 ms. (162 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (158 resets) in 2354 ms. (169 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2396 ms. (166 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (166 resets) in 2422 ms. (165 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (154 resets) in 2368 ms. (168 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (156 resets) in 2340 ms. (170 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (156 resets) in 2352 ms. (169 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2342 ms. (170 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (161 resets) in 2396 ms. (166 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (157 resets) in 2373 ms. (168 steps per ms) remains 95/95 properties
Interrupted probabilistic random walk after 15147692 steps, run timeout after 183001 ms. (steps per millisecond=82 ) properties seen :45 out of 95
Probabilistic random walk after 15147692 steps, saw 1759844 distinct states, run finished after 183016 ms. (steps per millisecond=82 ) properties seen :45
// Phase 1: matrix 513 rows 670 cols
[2024-05-20 22:54:28] [INFO ] Computed 209 invariants in 4 ms
[2024-05-20 22:54:28] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 351/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 220/670 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 513/1183 variables, 670/879 constraints. Problems are: Problem set: 0 solved, 50 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 264/1143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/1183 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1183/1183 variables, and 1143 constraints, problems are : Problem set: 0 solved, 50 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 670/670 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 351/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 220/670 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 513/1183 variables, 670/879 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 264/1143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 50/1193 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1183 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/1183 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1183/1183 variables, and 1193 constraints, problems are : Problem set: 0 solved, 50 unsolved in 36763 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 670/670 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 45510ms problems are : Problem set: 0 solved, 50 unsolved
Fused 50 Parikh solutions to 49 different solutions.
Parikh walk visited 25 properties in 7930 ms.
Support contains 49 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 513/513 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 668 transition count 511
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 668 transition count 511
Free-agglomeration rule applied 26 times.
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 668 transition count 485
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 56 place count 642 transition count 485
Applied a total of 56 rules in 115 ms. Remains 642 /670 variables (removed 28) and now considering 485/513 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 642/670 places, 485/513 transitions.
RANDOM walk for 4000000 steps (42418 resets) in 90031 ms. (44 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (159 resets) in 2852 ms. (140 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (152 resets) in 2187 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (245 resets) in 2446 ms. (163 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (251 resets) in 2464 ms. (162 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (236 resets) in 2608 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (245 resets) in 2560 ms. (156 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (238 resets) in 2291 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (242 resets) in 2421 ms. (165 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (242 resets) in 2624 ms. (152 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (240 resets) in 2625 ms. (152 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (244 resets) in 2833 ms. (141 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (241 resets) in 2393 ms. (167 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (235 resets) in 2208 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (221 resets) in 2624 ms. (152 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (235 resets) in 2684 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (238 resets) in 2785 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (232 resets) in 2332 ms. (171 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (245 resets) in 2413 ms. (165 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (258 resets) in 2253 ms. (177 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (251 resets) in 2594 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (248 resets) in 2847 ms. (140 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (234 resets) in 2530 ms. (158 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (237 resets) in 2856 ms. (140 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (235 resets) in 2398 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (246 resets) in 2418 ms. (165 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 11574725 steps, run timeout after 141001 ms. (steps per millisecond=82 ) properties seen :0 out of 25
Probabilistic random walk after 11574725 steps, saw 1431897 distinct states, run finished after 141002 ms. (steps per millisecond=82 ) properties seen :0
// Phase 1: matrix 485 rows 642 cols
[2024-05-20 22:58:30] [INFO ] Computed 209 invariants in 6 ms
[2024-05-20 22:58:30] [INFO ] State equation strengthened by 290 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 362/411 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 231/642 variables, 183/209 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 485/1127 variables, 642/851 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1127 variables, 290/1141 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1127 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/1127 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 1141 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 642/642 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 362/411 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 231/642 variables, 183/209 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 485/1127 variables, 642/851 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1127 variables, 290/1141 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1127 variables, 25/1166 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1127 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/1127 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 1166 constraints, problems are : Problem set: 0 solved, 25 unsolved in 9534 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 642/642 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 14413ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 12 properties in 28465 ms.
Support contains 26 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 485/485 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 641 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 641 transition count 484
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 641 transition count 462
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 46 place count 619 transition count 462
Applied a total of 46 rules in 130 ms. Remains 619 /642 variables (removed 23) and now considering 462/485 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 619/642 places, 462/485 transitions.
RANDOM walk for 4000000 steps (22929 resets) in 83368 ms. (47 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3243629 steps (1412 resets) in 20004 ms. (162 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3373755 steps (1463 resets) in 19983 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3224135 steps (1524 resets) in 20004 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3263326 steps (1484 resets) in 20004 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3497398 steps (1642 resets) in 19796 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3444060 steps (1556 resets) in 19941 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3496454 steps (1643 resets) in 19777 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3460067 steps (1561 resets) in 19756 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3491950 steps (1550 resets) in 19786 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3504309 steps (1615 resets) in 19756 ms. (177 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3408410 steps (1619 resets) in 19529 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3561873 steps (1672 resets) in 20004 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3449056 steps (1587 resets) in 19481 ms. (177 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 12541910 steps, run timeout after 276001 ms. (steps per millisecond=45 ) properties seen :0 out of 13
Probabilistic random walk after 12541910 steps, saw 3843294 distinct states, run finished after 276004 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 462 rows 619 cols
[2024-05-20 23:05:22] [INFO ] Computed 209 invariants in 3 ms
[2024-05-20 23:05:22] [INFO ] State equation strengthened by 312 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 350/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 243/619 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 462/1081 variables, 619/828 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 312/1140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/1081 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 1140 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2543 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 619/619 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 350/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 243/619 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 462/1081 variables, 619/828 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 312/1140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 13/1153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/1081 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 1153 constraints, problems are : Problem set: 0 solved, 13 unsolved in 7657 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 619/619 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10221ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 233 steps, including 0 resets, run visited all 13 properties in 23 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 43 ms.
Able to resolve query QuasiLiveness after proving 489 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 1040701 ms.
ITS solved all properties within timeout

BK_STOP 1716246332550

--------------------
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="AutoFlight-PT-48b"
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 AutoFlight-PT-48b, 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 r034-smll-171620174900122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b 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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;