About the Execution of LTSMin+red for ShieldIIPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3136.676 | 352710.00 | 533938.00 | 590.90 | ??TTTTTF?FFTF?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760500167.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 ShieldIIPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500167
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 868K May 18 16:43 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 ShieldIIPs-PT-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717233077113
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:11:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:11:18] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-06-01 09:11:18] [INFO ] Transformed 2503 places.
[2024-06-01 09:11:18] [INFO ] Transformed 2403 transitions.
[2024-06-01 09:11:18] [INFO ] Found NUPN structural information;
[2024-06-01 09:11:18] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3723 ms. (10 steps per ms) remains 8/16 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 969 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1736 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 754 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 698 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 8/8 properties
// Phase 1: matrix 2403 rows 2503 cols
[2024-06-01 09:11:22] [INFO ] Computed 901 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3952 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 26 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 8/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5915 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4906/4906 variables, and 5923 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5020 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 9282ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 329 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 551 times.
Drop transitions (Partial Free agglomeration) removed 551 transitions
Iterating global reduction 0 with 551 rules applied. Total rules applied 555 place count 2501 transition count 2401
Applied a total of 555 rules in 811 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 820 ms. Remains : 2501/2503 places, 2401/2403 transitions.
RANDOM walk for 40000 steps (8 resets) in 1716 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 656 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 675 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 822 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 784 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 639 ms. (62 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 119886 steps, run timeout after 6002 ms. (steps per millisecond=19 ) properties seen :1 out of 8
Probabilistic random walk after 119886 steps, saw 113614 distinct states, run finished after 6015 ms. (steps per millisecond=19 ) properties seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2401 rows 2501 cols
[2024-06-01 09:11:40] [INFO ] Computed 901 invariants in 56 ms
[2024-06-01 09:11:40] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 568/896 variables, 284/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 568/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1554/2450 variables, 591/1771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2450 variables, 1554/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2450 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 51/2501 variables, 26/3351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 51/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3956 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 568/896 variables, 284/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 568/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:44] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
[2024-06-01 09:11:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:11:45] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:11:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 4/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 1/1185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1554/2450 variables, 591/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2450 variables, 1554/3330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:11:46] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 13/3343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:47] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2450 variables, 1/3344 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2450 variables, 1/3345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/3345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 51/2501 variables, 26/3371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2501 variables, 51/3422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:11:49] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:11:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2501 variables, 2/3424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2501 variables, 0/3424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2401/4902 variables, 2501/5925 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 4/5929 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 7/5936 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:12:01] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:12:01] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 6 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:12:03] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:12:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:12:03] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:12:04] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-06-01 09:12:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 16/5952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:12:11] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:12:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 2/5954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4902 variables, 3/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5957 constraints, problems are : Problem set: 0 solved, 7 unsolved in 44634 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 43/43 constraints]
After SMT, in 48951ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 30643 ms.
Support contains 159 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 69 times.
Drop transitions (Partial Free agglomeration) removed 69 transitions
Iterating global reduction 0 with 69 rules applied. Total rules applied 69 place count 2501 transition count 2401
Applied a total of 69 rules in 265 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 2501/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1679 ms. (23 steps per ms) remains 4/5 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 942 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 924 ms. (43 steps per ms) remains 4/4 properties
// Phase 1: matrix 2401 rows 2501 cols
[2024-06-01 09:13:01] [INFO ] Computed 901 invariants in 93 ms
[2024-06-01 09:13:01] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1968/2459 variables, 726/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2459 variables, 1968/3339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2459 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 42/2501 variables, 21/3360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 42/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2230 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:04] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1968/2459 variables, 726/1372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2459 variables, 1968/3340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2459 variables, 6/3346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2459 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/2501 variables, 21/3367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 42/3409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:05] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:13:06] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:13:06] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:13:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 4/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2501 variables, 0/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2401/4902 variables, 2501/5914 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 4/5918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 4/5922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 3 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 20/5942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:13:21] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:13:21] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 3/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:13:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 1/5946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 0/5946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/4902 variables, 0/5946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5946 constraints, problems are : Problem set: 0 solved, 4 unsolved in 25084 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 35/35 constraints]
After SMT, in 27564ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 30081 ms.
Support contains 156 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2501 transition count 2401
Applied a total of 3 rules in 160 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 2501/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1655 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 988 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 998 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 864 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 914 ms. (43 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 96562 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 96562 steps, saw 92894 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2401 rows 2501 cols
[2024-06-01 09:14:04] [INFO ] Computed 901 invariants in 18 ms
[2024-06-01 09:14:04] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1970/2461 variables, 727/1372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2461 variables, 1970/3342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2461 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 40/2501 variables, 20/3362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 40/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2201 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 881/881 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1970/2461 variables, 727/1373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2461 variables, 1970/3343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2461 variables, 10/3353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2461 variables, 0/3353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/2501 variables, 20/3373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 40/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:14:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 5/3418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2501 variables, 0/3418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2401/4902 variables, 2501/5919 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 4/5923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 4/5927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:15] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 3 ms to minimize.
[2024-06-01 09:14:15] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 3 ms to minimize.
[2024-06-01 09:14:15] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 3 ms to minimize.
[2024-06-01 09:14:16] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 3 ms to minimize.
[2024-06-01 09:14:16] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 3 ms to minimize.
[2024-06-01 09:14:17] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 3 ms to minimize.
[2024-06-01 09:14:17] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-06-01 09:14:17] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 2 ms to minimize.
[2024-06-01 09:14:18] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-06-01 09:14:18] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2024-06-01 09:14:18] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 2 ms to minimize.
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 2 ms to minimize.
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:14:21] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 09:14:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 20/5947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:14:23] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 09:14:23] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:14:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:14:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:14:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:14:24] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:14:24] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:14:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 9/5956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 0/5956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:14:28] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/4902 variables, 2/5958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 0/5958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:31] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/4902 variables, 1/5959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:32] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:14:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/4902 variables, 2/5961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:14:35] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/4902 variables, 2/5963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4902 variables, 0/5963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/4902 variables, 0/5963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32693 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 881/881 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 52/52 constraints]
After SMT, in 34966ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 32245 ms.
Support contains 156 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 84 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 152 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-06-01 09:15:11] [INFO ] Invariant cache hit.
[2024-06-01 09:15:13] [INFO ] Implicit Places using invariants in 2072 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2095 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 110 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2359 ms. Remains : 2500/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1971 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1001 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1033 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 938 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 935 ms. (42 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 97206 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 97206 steps, saw 93523 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2401 rows 2500 cols
[2024-06-01 09:15:18] [INFO ] Computed 900 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1969/2460 variables, 726/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2460 variables, 1969/3340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2460 variables, 0/3340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 40/2500 variables, 20/3360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2500 variables, 40/3400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 0/3400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4901 variables, 2500/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5900 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2136 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:20] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1969/2460 variables, 726/1372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2460 variables, 1969/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:15:21] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:15:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:15:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:15:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2460 variables, 10/3351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2460 variables, 0/3351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/2500 variables, 20/3371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2500 variables, 40/3411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:22] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:15:22] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 2/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2500 variables, 0/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2401/4901 variables, 2500/5913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4901 variables, 4/5917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:29] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:15:30] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:15:30] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:15:30] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:15:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:15:31] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:15:31] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:15:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:15:32] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:15:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:15:33] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4901 variables, 11/5928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:15:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:15:36] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:15:36] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4901 variables, 4/5932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:38] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:15:39] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4901 variables, 2/5934 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4901 variables, 0/5934 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:43] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/4901 variables, 1/5935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4901 variables, 0/5935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:15:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/4901 variables, 1/5936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4901 variables, 0/5936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/4901 variables, 0/5936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5936 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31965 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 32/32 constraints]
After SMT, in 34190ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 37289 ms.
Support contains 156 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 66 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 66 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-06-01 09:16:29] [INFO ] Invariant cache hit.
[2024-06-01 09:16:31] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2024-06-01 09:16:31] [INFO ] Invariant cache hit.
[2024-06-01 09:16:35] [INFO ] Implicit Places using invariants and state equation in 4169 ms returned []
Implicit Place search using SMT with State Equation took 6005 ms to find 0 implicit places.
[2024-06-01 09:16:36] [INFO ] Redundant transitions in 329 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-06-01 09:16:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2499 variables, 2499/2499 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
SMT process timed out in 31966ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 32021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38464 ms. Remains : 2500/2500 places, 2401/2401 transitions.
[2024-06-01 09:17:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 09:17:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12131 arcs took 32 ms.
[2024-06-01 09:17:09] [INFO ] Flatten gal took : 598 ms
Total runtime 351155 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldIIPs-PT-100A-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-100A-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-100A-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-100A-ReachabilityFireability-2024-13
BK_STOP 1717233429823
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-100A-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1076/inv_0_
rfs formula name ShieldIIPs-PT-100A-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1076/inv_1_
rfs formula name ShieldIIPs-PT-100A-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1076/inv_2_
rfs formula name ShieldIIPs-PT-100A-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1076/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760500167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;