About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 280003.00 | 0.00 | 0.00 | [undef] | Cannot compute |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399000218.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399000218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716327600487
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:40:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:40:02] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-21 21:40:02] [INFO ] Transformed 108 places.
[2024-05-21 21:40:02] [INFO ] Transformed 2228 transitions.
[2024-05-21 21:40:02] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 67 ms.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 38 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 21:40:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 21:40:02] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 21:40:02] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:40:25] [INFO ] Deduced a trap composed of 5 places in 474 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20145 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:40:55] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55214ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 55279ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 21:40:57] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 21:40:57] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 21:40:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 21:40:57] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:40:57] [INFO ] Invariant cache hit.
[2024-05-21 21:40:58] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:40:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55571 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 21:40:59] [INFO ] Flatten gal took : 377 ms
[2024-05-21 21:41:01] [INFO ] Flatten gal took : 384 ms
[2024-05-21 21:41:04] [INFO ] Input system was already deterministic with 2208 transitions.
Reduction of identical properties reduced properties to check from 70 to 67
RANDOM walk for 40000 steps (228 resets) in 5667 ms. (7 steps per ms) remains 42/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 320 ms. (12 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 118 ms. (33 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 89 ms. (44 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 397 ms. (10 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 41/41 properties
[2024-05-21 21:41:08] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:41:08] [INFO ] Invariant cache hit.
[2024-05-21 21:41:08] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp67 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 289/392 variables, 103/108 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 101/209 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/209 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 3/395 variables, 3/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 5 solved, 36 unsolved in 2956 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 30/100 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 8/395 variables, 6/211 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 36/248 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/248 constraints. Problems are: Problem set: 5 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 248 constraints, problems are : Problem set: 5 solved, 36 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 36/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 8846ms problems are : Problem set: 5 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Applied a total of 5 rules in 396 ms. Remains 103 /106 variables (removed 3) and now considering 2206/2208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 103/106 places, 2206/2208 transitions.
RANDOM walk for 40000 steps (316 resets) in 910 ms. (43 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (14 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (12 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 68 ms. (57 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 53 ms. (74 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4001 steps (12 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (13 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (13 resets) in 51 ms. (76 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 55 ms. (71 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 173839 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :3 out of 35
Probabilistic random walk after 173839 steps, saw 50589 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :3
[2024-05-21 21:41:21] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 103 cols
[2024-05-21 21:41:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 21:41:21] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 35/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2709 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 35/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 29/240 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 240 constraints, problems are : Problem set: 0 solved, 32 unsolved in 8747 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 11667ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 1 properties in 4893 ms.
Support contains 63 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 244 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 103/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 1069 ms. (37 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (11 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (12 resets) in 28 ms. (137 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (11 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (12 resets) in 28 ms. (137 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (13 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (12 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (16 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (13 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (13 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 213487 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :1 out of 31
Probabilistic random walk after 213487 steps, saw 61440 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :1
[2024-05-21 21:41:42] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:41:42] [INFO ] Invariant cache hit.
[2024-05-21 21:41:42] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3632 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 27/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 238 constraints, problems are : Problem set: 0 solved, 30 unsolved in 9762 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 13573ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 6118 ms.
Support contains 62 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 158 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 103/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 703 ms. (56 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (13 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (13 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (13 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 183332 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 30
Probabilistic random walk after 183332 steps, saw 53197 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-21 21:42:05] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:42:05] [INFO ] Invariant cache hit.
[2024-05-21 21:42:05] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 27/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 238 constraints, problems are : Problem set: 0 solved, 30 unsolved in 9437 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 12345ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 6590 ms.
Support contains 62 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 153 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 103/103 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 150 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 21:42:25] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:42:25] [INFO ] Invariant cache hit.
[2024-05-21 21:42:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 21:42:25] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:42:25] [INFO ] Invariant cache hit.
[2024-05-21 21:42:25] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:42:25] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 716 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 243 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1111 ms. Remains : 101/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 809 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (16 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (11 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (11 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (13 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 189594 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 30
Probabilistic random walk after 189594 steps, saw 54944 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-21 21:42:29] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-05-21 21:42:29] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 21:42:29] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 206 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3785 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 38/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 30/235 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 236 constraints, problems are : Problem set: 0 solved, 30 unsolved in 17711 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 21673ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 11565 ms.
Support contains 62 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 152 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 101/101 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 149 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 21:43:03] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:43:03] [INFO ] Invariant cache hit.
[2024-05-21 21:43:03] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 21:43:03] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:43:03] [INFO ] Invariant cache hit.
[2024-05-21 21:43:03] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:43:03] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-21 21:43:03] [INFO ] Redundant transitions in 112 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-05-21 21:43:03] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:43:03] [INFO ] Invariant cache hit.
[2024-05-21 21:43:03] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-05-21 21:43:24] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 287/388 variables, 101/106 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 101/207 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 2408 constraints, problems are : Problem set: 2 solved, 2201 unsolved in 34645 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2201/2203 constraints, Known Traps: 1/1 constraints]
After SMT, in 79189ms problems are : Problem set: 2 solved, 2201 unsolved
Search for dead transitions found 2 dead transitions in 79209ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 2204/2206 transitions.
Applied a total of 0 rules in 151 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-05-21 21:44:23] [INFO ] Redundant transitions in 100 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80175 ms. Remains : 101/101 places, 2204/2206 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 21:44:23] [INFO ] Flatten gal took : 205 ms
[2024-05-21 21:44:26] [INFO ] Flatten gal took : 318 ms
[2024-05-21 21:44:28] [INFO ] Input system was already deterministic with 2208 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 21:44:28] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 21:44:28] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 21:44:28] [INFO ] State equation strengthened by 101 read => feed constraints.
BK_STOP 1716327880490
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="BridgeAndVehicles-PT-V20P20N50"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;