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.r482-tall-171624201800352.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201800352
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 1717179454246

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:17:35] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-31 18:17:35] [INFO ] Transformed 4763 places.
[2024-05-31 18:17:35] [INFO ] Transformed 2478 transitions.
[2024-05-31 18:17:35] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 370 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 4763/4763 places, 2478/2478 transitions.
Reduce places removed 3626 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 3825 rules applied. Total rules applied 3825 place count 1137 transition count 2279
Applied a total of 3825 rules in 145 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2024-05-31 18:17:35] [INFO ] Computed 2 invariants in 66 ms
[2024-05-31 18:17:36] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-31 18:17:36] [INFO ] Invariant cache hit.
[2024-05-31 18:17:37] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2024-05-31 18:17:51] [INFO ] Implicit Places using invariants and state equation in 14299 ms returned []
Implicit Place search using SMT with State Equation took 15302 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2024-05-31 18:17:51] [INFO ] Invariant cache hit.
[2024-05-31 18:17:51] [INFO ] State equation strengthened by 1389 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 2278/2270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 8/2270 constraints, Known Traps: 0/0 constraints]
After SMT, in 85750ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 85812ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 101302 ms. Remains : 1137/4763 places, 2279/2478 transitions.
Discarding 1145 transitions out of 2279. Remains 1134
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9129 resets) in 4592 ms. (8 steps per ms) remains 1053/1133 properties
BEST_FIRST walk for 123 steps (10 resets) in 14 ms. (8 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 121 steps (11 resets) in 16 ms. (7 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 14 ms. (8 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 36 ms. (3 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 30 ms. (3 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 124 steps (9 resets) in 20 ms. (5 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 15 ms. (7 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (11 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 124 steps (9 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 12 ms. (9 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 24 ms. (4 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 120 steps (12 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 121 steps (11 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 124 steps (10 resets) in 8 ms. (13 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (11 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 121 steps (11 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 14 ms. (8 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1053/1053 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1053/1053 properties
Probabilistic random walk after 30000 steps, saw 13922 distinct states, run finished after 1240 ms. (steps per millisecond=24 ) properties seen :326
[2024-05-31 18:19:19] [INFO ] Invariant cache hit.
[2024-05-31 18:19:20] [INFO ] State equation strengthened by 1389 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 727 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 727 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 0/0 constraints]
After SMT, in 16678ms problems are : Problem set: 0 solved, 727 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 746 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1076 transition count 2080
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1076 transition count 2080
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 140 place count 1076 transition count 2062
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 181 place count 1035 transition count 2021
Iterating global reduction 1 with 41 rules applied. Total rules applied 222 place count 1035 transition count 2021
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 249 place count 1008 transition count 1987
Iterating global reduction 1 with 27 rules applied. Total rules applied 276 place count 1008 transition count 1987
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 297 place count 1008 transition count 1966
Applied a total of 297 rules in 445 ms. Remains 1008 /1137 variables (removed 129) and now considering 1966/2279 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 1008/1137 places, 1966/2279 transitions.
RANDOM walk for 2821307 steps (646853 resets) in 120004 ms. (23 steps per ms) remains 703/727 properties
BEST_FIRST walk for 4002 steps (165 resets) in 86 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (181 resets) in 55 ms. (71 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (164 resets) in 50 ms. (78 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (174 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (169 resets) in 49 ms. (80 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (177 resets) in 53 ms. (74 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (147 resets) in 45 ms. (87 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (180 resets) in 61 ms. (64 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (182 resets) in 51 ms. (77 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (183 resets) in 54 ms. (72 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (164 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (177 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (182 resets) in 85 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (165 resets) in 74 ms. (53 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (187 resets) in 70 ms. (56 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (193 resets) in 73 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (177 resets) in 75 ms. (52 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (188 resets) in 73 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (188 resets) in 67 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (190 resets) in 73 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (194 resets) in 84 ms. (47 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (172 resets) in 67 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (193 resets) in 74 ms. (53 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (164 resets) in 50 ms. (78 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (175 resets) in 65 ms. (60 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (185 resets) in 58 ms. (67 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (164 resets) in 72 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (156 resets) in 62 ms. (63 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (176 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (175 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (175 resets) in 71 ms. (55 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (182 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (183 resets) in 63 ms. (62 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (205 resets) in 86 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (187 resets) in 84 ms. (47 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (178 resets) in 71 ms. (55 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (175 resets) in 79 ms. (50 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (170 resets) in 65 ms. (60 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (172 resets) in 74 ms. (53 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (176 resets) in 72 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (161 resets) in 54 ms. (72 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (172 resets) in 51 ms. (76 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4000 steps (176 resets) in 81 ms. (48 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (172 resets) in 71 ms. (55 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (176 resets) in 79 ms. (50 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (178 resets) in 78 ms. (50 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (156 resets) in 80 ms. (49 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (170 resets) in 67 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (186 resets) in 59 ms. (66 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (200 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
Probabilistic random walk after 1000000 steps, saw 395674 distinct states, run finished after 16898 ms. (steps per millisecond=59 ) properties seen :600
// Phase 1: matrix 1966 rows 1008 cols
[2024-05-31 18:20:25] [INFO ] Computed 2 invariants in 27 ms
[2024-05-31 18:20:25] [INFO ] State equation strengthened by 1160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:20:29] [INFO ] Deduced a trap composed of 271 places in 293 ms of which 36 ms to minimize.
[2024-05-31 18:20:29] [INFO ] Deduced a trap composed of 279 places in 249 ms of which 4 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 279 places in 239 ms of which 5 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 279 places in 251 ms of which 4 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 280 places in 248 ms of which 4 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 280 places in 241 ms of which 4 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 271 places in 244 ms of which 4 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 316 places in 241 ms of which 5 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 290 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1070/1758 variables, 688/699 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 264/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1166/2924 variables, 295/1258 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2924 variables, 871/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2924 variables, 0/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 50/2974 variables, 25/2154 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2974 variables, 25/2179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2974/2974 variables, and 2179 constraints, problems are : Problem set: 0 solved, 103 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1008/1008 constraints, ReadFeed: 1160/1160 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:13] [INFO ] Deduced a trap composed of 309 places in 231 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1070/1758 variables, 688/700 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 264/964 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1758 variables, 11/975 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:20] [INFO ] Deduced a trap composed of 206 places in 179 ms of which 4 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 207 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 202 places in 184 ms of which 8 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 206 places in 187 ms of which 4 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 201 places in 182 ms of which 4 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 252 places in 176 ms of which 5 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 207 places in 191 ms of which 4 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 215 places in 178 ms of which 5 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 226 places in 175 ms of which 4 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 210 places in 184 ms of which 4 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 221 places in 172 ms of which 4 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 220 places in 179 ms of which 4 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 269 places in 160 ms of which 4 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 269 places in 165 ms of which 4 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 224 places in 173 ms of which 3 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 250 places in 172 ms of which 4 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 250 places in 170 ms of which 4 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 292 places in 162 ms of which 4 ms to minimize.
[2024-05-31 18:21:25] [INFO ] Deduced a trap composed of 266 places in 165 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1758 variables, 20/995 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 207 places in 170 ms of which 4 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 203 places in 172 ms of which 4 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 253 places in 160 ms of which 4 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 253 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 290 places in 157 ms of which 3 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 295 places in 170 ms of which 4 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 293 places in 161 ms of which 4 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 252 places in 175 ms of which 4 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 245 places in 171 ms of which 4 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 240 places in 170 ms of which 5 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 288 places in 159 ms of which 4 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 247 places in 167 ms of which 6 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 261 places in 159 ms of which 4 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 287 places in 166 ms of which 4 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 243 places in 173 ms of which 3 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 244 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 285 places in 164 ms of which 4 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 290 places in 162 ms of which 4 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 259 places in 165 ms of which 4 ms to minimize.
[2024-05-31 18:21:35] [INFO ] Deduced a trap composed of 217 places in 179 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 20/1015 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:40] [INFO ] Deduced a trap composed of 306 places in 159 ms of which 4 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 302 places in 158 ms of which 4 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 263 places in 171 ms of which 4 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 263 places in 172 ms of which 3 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 304 places in 159 ms of which 4 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 252 places in 168 ms of which 4 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 295 places in 163 ms of which 5 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 291 places in 154 ms of which 4 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 293 places in 160 ms of which 4 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 244 places in 171 ms of which 4 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 245 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 218 places in 180 ms of which 3 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 264 places in 165 ms of which 4 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 311 places in 163 ms of which 4 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 315 places in 162 ms of which 4 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 264 places in 168 ms of which 4 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 253 places in 158 ms of which 4 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 227 places in 172 ms of which 3 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 258 places in 165 ms of which 4 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 251 places in 161 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 20/1035 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:51] [INFO ] Deduced a trap composed of 190 places in 193 ms of which 4 ms to minimize.
[2024-05-31 18:21:51] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 3 ms to minimize.
[2024-05-31 18:21:51] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 4 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 199 places in 181 ms of which 4 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 199 places in 180 ms of which 4 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 210 places in 174 ms of which 4 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 236 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 187 places in 175 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 192 places in 196 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 186 places in 185 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 192 places in 182 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 191 places in 179 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 4 ms to minimize.
[2024-05-31 18:21:54] [INFO ] Deduced a trap composed of 192 places in 175 ms of which 3 ms to minimize.
[2024-05-31 18:21:54] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 4 ms to minimize.
[2024-05-31 18:21:54] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 4 ms to minimize.
[2024-05-31 18:21:54] [INFO ] Deduced a trap composed of 190 places in 182 ms of which 3 ms to minimize.
[2024-05-31 18:21:55] [INFO ] Deduced a trap composed of 192 places in 178 ms of which 4 ms to minimize.
[2024-05-31 18:21:55] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 4 ms to minimize.
[2024-05-31 18:21:55] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 20/1055 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1758/2974 variables, and 1055 constraints, problems are : Problem set: 0 solved, 103 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 688/1008 constraints, ReadFeed: 264/1160 constraints, PredecessorRefiner: 11/103 constraints, Known Traps: 90/90 constraints]
After SMT, in 90820ms problems are : Problem set: 0 solved, 103 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1966/1966 transitions.
Graph (complete) has 3634 edges and 1008 vertex of which 1007 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1007 transition count 1949
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 299 place count 726 transition count 1170
Iterating global reduction 1 with 281 rules applied. Total rules applied 580 place count 726 transition count 1170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 588 place count 726 transition count 1162
Discarding 226 places :
Symmetric choice reduction at 2 with 226 rule applications. Total rules 814 place count 500 transition count 936
Iterating global reduction 2 with 226 rules applied. Total rules applied 1040 place count 500 transition count 936
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1052 place count 500 transition count 924
Discarding 177 places :
Symmetric choice reduction at 3 with 177 rule applications. Total rules 1229 place count 323 transition count 672
Iterating global reduction 3 with 177 rules applied. Total rules applied 1406 place count 323 transition count 672
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 1574 place count 323 transition count 504
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1594 place count 303 transition count 473
Iterating global reduction 4 with 20 rules applied. Total rules applied 1614 place count 303 transition count 473
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1620 place count 303 transition count 467
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1632 place count 291 transition count 455
Iterating global reduction 5 with 12 rules applied. Total rules applied 1644 place count 291 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 291 transition count 454
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1656 place count 280 transition count 443
Iterating global reduction 6 with 11 rules applied. Total rules applied 1667 place count 280 transition count 443
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1680 place count 280 transition count 430
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1684 place count 276 transition count 404
Iterating global reduction 7 with 4 rules applied. Total rules applied 1688 place count 276 transition count 404
Applied a total of 1688 rules in 137 ms. Remains 276 /1008 variables (removed 732) and now considering 404/1966 (removed 1562) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 276/1008 places, 404/1966 transitions.
RANDOM walk for 4000000 steps (919094 resets) in 36216 ms. (110 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1792 resets) in 124 ms. (320 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1780 resets) in 164 ms. (242 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 261 ms. (152 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 147 ms. (270 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 224 ms. (177 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 166 ms. (239 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 145 ms. (274 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 157 ms. (253 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1728 resets) in 216 ms. (184 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1787 resets) in 133 ms. (298 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1808 resets) in 153 ms. (259 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1733 resets) in 141 ms. (281 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1821 resets) in 242 ms. (164 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1814 resets) in 150 ms. (264 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1733 resets) in 203 ms. (196 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1770 resets) in 228 ms. (174 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 202 ms. (197 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (1809 resets) in 269 ms. (148 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 117 ms. (339 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1747 resets) in 209 ms. (190 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (1715 resets) in 165 ms. (240 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1779 resets) in 158 ms. (251 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1812 resets) in 134 ms. (296 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1748 resets) in 235 ms. (169 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1762 resets) in 281 ms. (141 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1797 resets) in 263 ms. (151 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1761 resets) in 175 ms. (227 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1749 resets) in 192 ms. (207 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 259 ms. (153 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1741 resets) in 201 ms. (198 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1821 resets) in 135 ms. (294 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1693 resets) in 226 ms. (176 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1728 resets) in 128 ms. (310 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1752 resets) in 156 ms. (254 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1768 resets) in 220 ms. (181 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1775 resets) in 177 ms. (224 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1760 resets) in 222 ms. (179 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1735 resets) in 162 ms. (245 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1756 resets) in 177 ms. (224 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1813 resets) in 168 ms. (236 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 180 ms. (221 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1740 resets) in 240 ms. (165 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1771 resets) in 145 ms. (273 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 131 ms. (303 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1751 resets) in 199 ms. (200 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1780 resets) in 170 ms. (233 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1748 resets) in 257 ms. (155 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 186 ms. (213 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (3852 resets) in 379 ms. (105 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (3901 resets) in 247 ms. (161 steps per ms) remains 103/103 properties
Finished probabilistic random walk after 342297 steps, run visited all 103 properties in 3295 ms. (steps per millisecond=103 )
Probabilistic random walk after 342297 steps, saw 138308 distinct states, run finished after 3311 ms. (steps per millisecond=103 ) properties seen :103
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 277858 ms.
ITS solved all properties within timeout

BK_STOP 1717179733260

--------------------
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="DBSingleClientW-PT-d2m06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m06, 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 r482-tall-171624201800352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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