About the Execution of LTSMin+red for CANConstruction-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4188.647 | 421933.00 | 497571.00 | 961.30 | T?T?FFTFTTFFTTTF | 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.r476-tall-171620505000046.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 CANConstruction-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717179354254
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:15:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:15:55] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-31 18:15:55] [INFO ] Transformed 5602 places.
[2024-05-31 18:15:55] [INFO ] Transformed 10400 transitions.
[2024-05-31 18:15:55] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (43 resets) in 3063 ms. (13 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 764 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
// Phase 1: matrix 10400 rows 5602 cols
[2024-05-31 18:15:57] [INFO ] Computed 101 invariants in 127 ms
[2024-05-31 18:15:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5376/5552 variables, 50/50 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5552 variables, 2/52 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/5553 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5553 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 48/5601 variables, 48/101 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10400/16001 variables, 5601/5702 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16001 variables, 4950/10652 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16001/16002 variables, and 10652 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 5601/5602 constraints, ReadFeed: 4950/4950 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5450/5545 variables, 43/43 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5545 variables, 2/45 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-31 18:16:09] [INFO ] Deduced a trap composed of 5 places in 5686 ms of which 225 ms to minimize.
SMT process timed out in 12031ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 95 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 5602 transition count 10072
Reduce places removed 328 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 335 rules applied. Total rules applied 663 place count 5274 transition count 10065
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 670 place count 5267 transition count 10065
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 670 place count 5267 transition count 10060
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 680 place count 5262 transition count 10060
Discarding 2363 places :
Symmetric choice reduction at 3 with 2363 rule applications. Total rules 3043 place count 2899 transition count 5334
Iterating global reduction 3 with 2363 rules applied. Total rules applied 5406 place count 2899 transition count 5334
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 5494 place count 2855 transition count 5290
Free-agglomeration rule applied 41 times.
Iterating global reduction 3 with 41 rules applied. Total rules applied 5535 place count 2855 transition count 5249
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 5576 place count 2814 transition count 5249
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 5581 place count 2814 transition count 5244
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 5586 place count 2809 transition count 5244
Partial Free-agglomeration rule applied 59 times.
Drop transitions (Partial Free agglomeration) removed 59 transitions
Iterating global reduction 5 with 59 rules applied. Total rules applied 5645 place count 2809 transition count 5244
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5646 place count 2809 transition count 5244
Applied a total of 5646 rules in 2951 ms. Remains 2809 /5602 variables (removed 2793) and now considering 5244/10400 (removed 5156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2960 ms. Remains : 2809/5602 places, 5244/10400 transitions.
RANDOM walk for 40000 steps (111 resets) in 888 ms. (44 steps per ms) remains 2/4 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
// Phase 1: matrix 5244 rows 2809 cols
[2024-05-31 18:16:13] [INFO ] Computed 101 invariants in 34 ms
[2024-05-31 18:16:13] [INFO ] State equation strengthened by 5022 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2674/2745 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2745 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2745 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2759 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2759 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2808 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2808 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5244/8052 variables, 2808/2909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8052 variables, 5022/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8052 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8053 variables, 1/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8053 variables, 0/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8053 variables, 0/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8053/8053 variables, and 7932 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3129 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2809/2809 constraints, ReadFeed: 5022/5022 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2674/2745 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2745 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:16:18] [INFO ] Deduced a trap composed of 2 places in 1895 ms of which 17 ms to minimize.
[2024-05-31 18:16:19] [INFO ] Deduced a trap composed of 56 places in 1193 ms of which 16 ms to minimize.
[2024-05-31 18:16:21] [INFO ] Deduced a trap composed of 56 places in 1166 ms of which 13 ms to minimize.
[2024-05-31 18:16:22] [INFO ] Deduced a trap composed of 57 places in 1205 ms of which 11 ms to minimize.
[2024-05-31 18:16:23] [INFO ] Deduced a trap composed of 53 places in 1197 ms of which 13 ms to minimize.
[2024-05-31 18:16:24] [INFO ] Deduced a trap composed of 56 places in 1079 ms of which 11 ms to minimize.
[2024-05-31 18:16:25] [INFO ] Deduced a trap composed of 55 places in 1019 ms of which 12 ms to minimize.
[2024-05-31 18:16:26] [INFO ] Deduced a trap composed of 56 places in 1102 ms of which 13 ms to minimize.
[2024-05-31 18:16:28] [INFO ] Deduced a trap composed of 53 places in 1145 ms of which 12 ms to minimize.
[2024-05-31 18:16:29] [INFO ] Deduced a trap composed of 57 places in 982 ms of which 11 ms to minimize.
[2024-05-31 18:16:30] [INFO ] Deduced a trap composed of 53 places in 1065 ms of which 12 ms to minimize.
[2024-05-31 18:16:31] [INFO ] Deduced a trap composed of 57 places in 1029 ms of which 11 ms to minimize.
[2024-05-31 18:16:32] [INFO ] Deduced a trap composed of 57 places in 1074 ms of which 12 ms to minimize.
[2024-05-31 18:16:33] [INFO ] Deduced a trap composed of 56 places in 1019 ms of which 11 ms to minimize.
[2024-05-31 18:16:34] [INFO ] Deduced a trap composed of 56 places in 1051 ms of which 12 ms to minimize.
[2024-05-31 18:16:35] [INFO ] Deduced a trap composed of 56 places in 967 ms of which 12 ms to minimize.
[2024-05-31 18:16:36] [INFO ] Deduced a trap composed of 56 places in 960 ms of which 11 ms to minimize.
[2024-05-31 18:16:37] [INFO ] Deduced a trap composed of 56 places in 1036 ms of which 12 ms to minimize.
[2024-05-31 18:16:38] [INFO ] Deduced a trap composed of 53 places in 926 ms of which 10 ms to minimize.
[2024-05-31 18:16:39] [INFO ] Deduced a trap composed of 56 places in 953 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2745 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:16:40] [INFO ] Deduced a trap composed of 53 places in 907 ms of which 11 ms to minimize.
[2024-05-31 18:16:41] [INFO ] Deduced a trap composed of 56 places in 974 ms of which 11 ms to minimize.
[2024-05-31 18:16:42] [INFO ] Deduced a trap composed of 56 places in 1012 ms of which 11 ms to minimize.
[2024-05-31 18:16:43] [INFO ] Deduced a trap composed of 53 places in 845 ms of which 11 ms to minimize.
[2024-05-31 18:16:44] [INFO ] Deduced a trap composed of 53 places in 759 ms of which 9 ms to minimize.
[2024-05-31 18:16:45] [INFO ] Deduced a trap composed of 56 places in 816 ms of which 10 ms to minimize.
[2024-05-31 18:16:46] [INFO ] Deduced a trap composed of 56 places in 995 ms of which 14 ms to minimize.
[2024-05-31 18:16:47] [INFO ] Deduced a trap composed of 56 places in 888 ms of which 10 ms to minimize.
[2024-05-31 18:16:48] [INFO ] Deduced a trap composed of 56 places in 870 ms of which 10 ms to minimize.
[2024-05-31 18:16:49] [INFO ] Deduced a trap composed of 56 places in 911 ms of which 11 ms to minimize.
[2024-05-31 18:16:50] [INFO ] Deduced a trap composed of 59 places in 850 ms of which 11 ms to minimize.
[2024-05-31 18:16:50] [INFO ] Deduced a trap composed of 56 places in 798 ms of which 10 ms to minimize.
[2024-05-31 18:16:51] [INFO ] Deduced a trap composed of 56 places in 868 ms of which 11 ms to minimize.
[2024-05-31 18:16:52] [INFO ] Deduced a trap composed of 56 places in 840 ms of which 10 ms to minimize.
[2024-05-31 18:16:53] [INFO ] Deduced a trap composed of 56 places in 914 ms of which 11 ms to minimize.
[2024-05-31 18:16:54] [INFO ] Deduced a trap composed of 53 places in 779 ms of which 10 ms to minimize.
[2024-05-31 18:16:55] [INFO ] Deduced a trap composed of 56 places in 734 ms of which 10 ms to minimize.
[2024-05-31 18:16:56] [INFO ] Deduced a trap composed of 53 places in 757 ms of which 10 ms to minimize.
[2024-05-31 18:16:56] [INFO ] Deduced a trap composed of 53 places in 693 ms of which 11 ms to minimize.
[2024-05-31 18:16:57] [INFO ] Deduced a trap composed of 56 places in 683 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2745 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:16:58] [INFO ] Deduced a trap composed of 57 places in 646 ms of which 9 ms to minimize.
[2024-05-31 18:16:59] [INFO ] Deduced a trap composed of 53 places in 662 ms of which 9 ms to minimize.
[2024-05-31 18:16:59] [INFO ] Deduced a trap composed of 53 places in 664 ms of which 9 ms to minimize.
[2024-05-31 18:17:00] [INFO ] Deduced a trap composed of 56 places in 703 ms of which 9 ms to minimize.
[2024-05-31 18:17:01] [INFO ] Deduced a trap composed of 56 places in 648 ms of which 22 ms to minimize.
[2024-05-31 18:17:01] [INFO ] Deduced a trap composed of 56 places in 622 ms of which 8 ms to minimize.
SMT process timed out in 48831ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2809/2809 places, 5244/5244 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2800 transition count 5235
Applied a total of 18 rules in 414 ms. Remains 2800 /2809 variables (removed 9) and now considering 5235/5244 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 2800/2809 places, 5235/5244 transitions.
RANDOM walk for 40000 steps (110 resets) in 905 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81407 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81407 steps, saw 41780 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 5235 rows 2800 cols
[2024-05-31 18:17:05] [INFO ] Computed 101 invariants in 26 ms
[2024-05-31 18:17:05] [INFO ] State equation strengthened by 5031 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2736 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2736 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2736 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2750 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2750 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2799 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2799 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5235/8034 variables, 2799/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8034 variables, 5031/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8034 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8035 variables, 1/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8035 variables, 0/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8035 variables, 0/7932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8035/8035 variables, and 7932 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2800/2800 constraints, ReadFeed: 5031/5031 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2736 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2736 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:17:11] [INFO ] Deduced a trap composed of 2 places in 2053 ms of which 15 ms to minimize.
[2024-05-31 18:17:12] [INFO ] Deduced a trap composed of 56 places in 1070 ms of which 12 ms to minimize.
[2024-05-31 18:17:13] [INFO ] Deduced a trap composed of 53 places in 1080 ms of which 12 ms to minimize.
[2024-05-31 18:17:14] [INFO ] Deduced a trap composed of 56 places in 972 ms of which 10 ms to minimize.
[2024-05-31 18:17:15] [INFO ] Deduced a trap composed of 53 places in 894 ms of which 11 ms to minimize.
[2024-05-31 18:17:16] [INFO ] Deduced a trap composed of 53 places in 885 ms of which 10 ms to minimize.
[2024-05-31 18:17:18] [INFO ] Deduced a trap composed of 2 places in 1809 ms of which 15 ms to minimize.
[2024-05-31 18:17:19] [INFO ] Deduced a trap composed of 55 places in 903 ms of which 10 ms to minimize.
[2024-05-31 18:17:20] [INFO ] Deduced a trap composed of 53 places in 870 ms of which 10 ms to minimize.
[2024-05-31 18:17:21] [INFO ] Deduced a trap composed of 55 places in 959 ms of which 11 ms to minimize.
[2024-05-31 18:17:22] [INFO ] Deduced a trap composed of 55 places in 841 ms of which 10 ms to minimize.
[2024-05-31 18:17:23] [INFO ] Deduced a trap composed of 55 places in 793 ms of which 10 ms to minimize.
[2024-05-31 18:17:24] [INFO ] Deduced a trap composed of 55 places in 954 ms of which 12 ms to minimize.
[2024-05-31 18:17:24] [INFO ] Deduced a trap composed of 56 places in 906 ms of which 10 ms to minimize.
[2024-05-31 18:17:25] [INFO ] Deduced a trap composed of 55 places in 832 ms of which 11 ms to minimize.
[2024-05-31 18:17:26] [INFO ] Deduced a trap composed of 55 places in 862 ms of which 10 ms to minimize.
[2024-05-31 18:17:27] [INFO ] Deduced a trap composed of 57 places in 898 ms of which 10 ms to minimize.
[2024-05-31 18:17:28] [INFO ] Deduced a trap composed of 55 places in 842 ms of which 11 ms to minimize.
[2024-05-31 18:17:29] [INFO ] Deduced a trap composed of 56 places in 809 ms of which 11 ms to minimize.
[2024-05-31 18:17:30] [INFO ] Deduced a trap composed of 53 places in 936 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2736 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:17:31] [INFO ] Deduced a trap composed of 56 places in 847 ms of which 10 ms to minimize.
[2024-05-31 18:17:32] [INFO ] Deduced a trap composed of 53 places in 755 ms of which 10 ms to minimize.
[2024-05-31 18:17:32] [INFO ] Deduced a trap composed of 56 places in 657 ms of which 9 ms to minimize.
[2024-05-31 18:17:33] [INFO ] Deduced a trap composed of 55 places in 629 ms of which 9 ms to minimize.
[2024-05-31 18:17:34] [INFO ] Deduced a trap composed of 53 places in 720 ms of which 8 ms to minimize.
[2024-05-31 18:17:35] [INFO ] Deduced a trap composed of 58 places in 740 ms of which 8 ms to minimize.
[2024-05-31 18:17:36] [INFO ] Deduced a trap composed of 59 places in 828 ms of which 10 ms to minimize.
[2024-05-31 18:17:36] [INFO ] Deduced a trap composed of 53 places in 723 ms of which 9 ms to minimize.
[2024-05-31 18:17:37] [INFO ] Deduced a trap composed of 56 places in 825 ms of which 9 ms to minimize.
[2024-05-31 18:17:38] [INFO ] Deduced a trap composed of 53 places in 731 ms of which 9 ms to minimize.
[2024-05-31 18:17:39] [INFO ] Deduced a trap composed of 53 places in 723 ms of which 9 ms to minimize.
[2024-05-31 18:17:40] [INFO ] Deduced a trap composed of 55 places in 682 ms of which 9 ms to minimize.
[2024-05-31 18:17:40] [INFO ] Deduced a trap composed of 56 places in 710 ms of which 9 ms to minimize.
[2024-05-31 18:17:41] [INFO ] Deduced a trap composed of 55 places in 788 ms of which 10 ms to minimize.
[2024-05-31 18:17:42] [INFO ] Deduced a trap composed of 56 places in 805 ms of which 10 ms to minimize.
[2024-05-31 18:17:43] [INFO ] Deduced a trap composed of 53 places in 740 ms of which 10 ms to minimize.
[2024-05-31 18:17:44] [INFO ] Deduced a trap composed of 55 places in 770 ms of which 9 ms to minimize.
[2024-05-31 18:17:44] [INFO ] Deduced a trap composed of 56 places in 667 ms of which 9 ms to minimize.
[2024-05-31 18:17:45] [INFO ] Deduced a trap composed of 59 places in 853 ms of which 10 ms to minimize.
[2024-05-31 18:17:46] [INFO ] Deduced a trap composed of 56 places in 902 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2736 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:17:47] [INFO ] Deduced a trap composed of 53 places in 746 ms of which 10 ms to minimize.
[2024-05-31 18:17:48] [INFO ] Deduced a trap composed of 53 places in 795 ms of which 10 ms to minimize.
[2024-05-31 18:17:49] [INFO ] Deduced a trap composed of 56 places in 686 ms of which 9 ms to minimize.
[2024-05-31 18:17:50] [INFO ] Deduced a trap composed of 55 places in 837 ms of which 10 ms to minimize.
[2024-05-31 18:17:50] [INFO ] Deduced a trap composed of 56 places in 682 ms of which 9 ms to minimize.
[2024-05-31 18:17:51] [INFO ] Deduced a trap composed of 58 places in 754 ms of which 9 ms to minimize.
[2024-05-31 18:17:52] [INFO ] Deduced a trap composed of 53 places in 734 ms of which 9 ms to minimize.
[2024-05-31 18:17:53] [INFO ] Deduced a trap composed of 53 places in 684 ms of which 9 ms to minimize.
[2024-05-31 18:17:53] [INFO ] Deduced a trap composed of 56 places in 617 ms of which 9 ms to minimize.
[2024-05-31 18:17:54] [INFO ] Deduced a trap composed of 53 places in 726 ms of which 10 ms to minimize.
[2024-05-31 18:17:55] [INFO ] Deduced a trap composed of 56 places in 706 ms of which 9 ms to minimize.
[2024-05-31 18:17:56] [INFO ] Deduced a trap composed of 57 places in 776 ms of which 10 ms to minimize.
[2024-05-31 18:17:56] [INFO ] Deduced a trap composed of 56 places in 701 ms of which 10 ms to minimize.
[2024-05-31 18:17:57] [INFO ] Deduced a trap composed of 53 places in 780 ms of which 10 ms to minimize.
[2024-05-31 18:17:58] [INFO ] Deduced a trap composed of 54 places in 664 ms of which 9 ms to minimize.
[2024-05-31 18:17:59] [INFO ] Deduced a trap composed of 61 places in 696 ms of which 9 ms to minimize.
[2024-05-31 18:18:00] [INFO ] Deduced a trap composed of 57 places in 612 ms of which 9 ms to minimize.
[2024-05-31 18:18:00] [INFO ] Deduced a trap composed of 58 places in 816 ms of which 10 ms to minimize.
[2024-05-31 18:18:01] [INFO ] Deduced a trap composed of 53 places in 592 ms of which 8 ms to minimize.
[2024-05-31 18:18:02] [INFO ] Deduced a trap composed of 53 places in 635 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2736 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:18:02] [INFO ] Deduced a trap composed of 56 places in 497 ms of which 7 ms to minimize.
[2024-05-31 18:18:03] [INFO ] Deduced a trap composed of 56 places in 542 ms of which 8 ms to minimize.
[2024-05-31 18:18:03] [INFO ] Deduced a trap composed of 56 places in 507 ms of which 9 ms to minimize.
[2024-05-31 18:18:04] [INFO ] Deduced a trap composed of 56 places in 536 ms of which 7 ms to minimize.
[2024-05-31 18:18:05] [INFO ] Deduced a trap composed of 57 places in 564 ms of which 9 ms to minimize.
[2024-05-31 18:18:05] [INFO ] Deduced a trap composed of 56 places in 584 ms of which 9 ms to minimize.
[2024-05-31 18:18:06] [INFO ] Deduced a trap composed of 57 places in 559 ms of which 8 ms to minimize.
[2024-05-31 18:18:06] [INFO ] Deduced a trap composed of 56 places in 467 ms of which 7 ms to minimize.
[2024-05-31 18:18:07] [INFO ] Deduced a trap composed of 58 places in 596 ms of which 8 ms to minimize.
[2024-05-31 18:18:08] [INFO ] Deduced a trap composed of 56 places in 563 ms of which 8 ms to minimize.
[2024-05-31 18:18:08] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 8 ms to minimize.
[2024-05-31 18:18:09] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 8 ms to minimize.
[2024-05-31 18:18:09] [INFO ] Deduced a trap composed of 55 places in 446 ms of which 7 ms to minimize.
[2024-05-31 18:18:10] [INFO ] Deduced a trap composed of 56 places in 467 ms of which 7 ms to minimize.
[2024-05-31 18:18:10] [INFO ] Deduced a trap composed of 56 places in 438 ms of which 7 ms to minimize.
[2024-05-31 18:18:11] [INFO ] Deduced a trap composed of 58 places in 428 ms of which 7 ms to minimize.
[2024-05-31 18:18:11] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 7 ms to minimize.
[2024-05-31 18:18:12] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 7 ms to minimize.
[2024-05-31 18:18:12] [INFO ] Deduced a trap composed of 56 places in 371 ms of which 7 ms to minimize.
[2024-05-31 18:18:13] [INFO ] Deduced a trap composed of 56 places in 435 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:18:13] [INFO ] Deduced a trap composed of 56 places in 412 ms of which 7 ms to minimize.
[2024-05-31 18:18:13] [INFO ] Deduced a trap composed of 56 places in 375 ms of which 7 ms to minimize.
[2024-05-31 18:18:14] [INFO ] Deduced a trap composed of 53 places in 479 ms of which 9 ms to minimize.
[2024-05-31 18:18:14] [INFO ] Deduced a trap composed of 56 places in 443 ms of which 7 ms to minimize.
[2024-05-31 18:18:15] [INFO ] Deduced a trap composed of 56 places in 447 ms of which 6 ms to minimize.
[2024-05-31 18:18:15] [INFO ] Deduced a trap composed of 56 places in 401 ms of which 7 ms to minimize.
[2024-05-31 18:18:16] [INFO ] Deduced a trap composed of 56 places in 342 ms of which 6 ms to minimize.
[2024-05-31 18:18:16] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 6 ms to minimize.
[2024-05-31 18:18:17] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 6 ms to minimize.
[2024-05-31 18:18:17] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 5 ms to minimize.
[2024-05-31 18:18:17] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 7 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 5 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 56 places in 331 ms of which 6 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 6 ms to minimize.
[2024-05-31 18:18:19] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 5 ms to minimize.
[2024-05-31 18:18:19] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 8 ms to minimize.
[2024-05-31 18:18:19] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 5 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 5 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 5 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 5 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 5 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 4 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 57 places in 360 ms of which 6 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 55 places in 314 ms of which 6 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2736 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2736 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/2750 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:18:24] [INFO ] Deduced a trap composed of 53 places in 1604 ms of which 14 ms to minimize.
SMT process timed out in 78938ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 5235/5235 transitions.
Applied a total of 0 rules in 476 ms. Remains 2800 /2800 variables (removed 0) and now considering 5235/5235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 2800/2800 places, 5235/5235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 5235/5235 transitions.
Applied a total of 0 rules in 227 ms. Remains 2800 /2800 variables (removed 0) and now considering 5235/5235 (removed 0) transitions.
[2024-05-31 18:18:25] [INFO ] Invariant cache hit.
[2024-05-31 18:18:27] [INFO ] Implicit Places using invariants in 1806 ms returned [5, 10, 16, 20, 26, 32, 36, 42, 46, 52, 58, 62, 68, 72, 76, 82, 90, 96, 102, 106, 112, 118, 124, 130, 134, 138, 144, 150, 156, 160, 166, 172, 178, 182, 188, 197, 203, 209, 215, 219, 223, 229, 235, 240, 248, 254, 260, 264, 270]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1817 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2751/2800 places, 5235/5235 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 2751 transition count 5207
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 2723 transition count 5207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 2722 transition count 5206
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 2722 transition count 5206
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 112 place count 2695 transition count 5179
Applied a total of 112 rules in 661 ms. Remains 2695 /2751 variables (removed 56) and now considering 5179/5235 (removed 56) transitions.
// Phase 1: matrix 5179 rows 2695 cols
[2024-05-31 18:18:27] [INFO ] Computed 52 invariants in 59 ms
[2024-05-31 18:18:29] [INFO ] Implicit Places using invariants in 1685 ms returned []
[2024-05-31 18:18:29] [INFO ] Invariant cache hit.
[2024-05-31 18:18:31] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2024-05-31 18:19:01] [INFO ] Performed 1302/2695 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:19:31] [INFO ] Performed 2588/2695 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:19:34] [INFO ] Implicit Places using invariants and state equation in 64753 ms returned []
Implicit Place search using SMT with State Equation took 66440 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2695/2800 places, 5179/5235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69145 ms. Remains : 2695/2800 places, 5179/5235 transitions.
RANDOM walk for 40000 steps (111 resets) in 675 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 85547 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 85547 steps, saw 42602 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-31 18:19:37] [INFO ] Invariant cache hit.
[2024-05-31 18:19:37] [INFO ] State equation strengthened by 4958 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2609/2680 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2680 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2680 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2694 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2694 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5179/7873 variables, 2694/2746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7873 variables, 4958/7704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7873 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/7874 variables, 1/7705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7874 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/7874 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7874/7874 variables, and 7705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2695/2695 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2609/2680 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2680 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:19:42] [INFO ] Deduced a trap composed of 2 places in 1873 ms of which 15 ms to minimize.
[2024-05-31 18:19:43] [INFO ] Deduced a trap composed of 55 places in 1044 ms of which 12 ms to minimize.
[2024-05-31 18:19:44] [INFO ] Deduced a trap composed of 55 places in 1022 ms of which 11 ms to minimize.
[2024-05-31 18:19:46] [INFO ] Deduced a trap composed of 53 places in 975 ms of which 11 ms to minimize.
[2024-05-31 18:19:46] [INFO ] Deduced a trap composed of 55 places in 892 ms of which 11 ms to minimize.
[2024-05-31 18:19:47] [INFO ] Deduced a trap composed of 53 places in 917 ms of which 10 ms to minimize.
[2024-05-31 18:19:48] [INFO ] Deduced a trap composed of 58 places in 858 ms of which 11 ms to minimize.
[2024-05-31 18:19:49] [INFO ] Deduced a trap composed of 54 places in 1020 ms of which 11 ms to minimize.
[2024-05-31 18:19:50] [INFO ] Deduced a trap composed of 56 places in 999 ms of which 11 ms to minimize.
[2024-05-31 18:19:52] [INFO ] Deduced a trap composed of 2 places in 1929 ms of which 15 ms to minimize.
[2024-05-31 18:19:54] [INFO ] Deduced a trap composed of 2 places in 1921 ms of which 15 ms to minimize.
[2024-05-31 18:19:55] [INFO ] Deduced a trap composed of 53 places in 917 ms of which 10 ms to minimize.
[2024-05-31 18:19:56] [INFO ] Deduced a trap composed of 53 places in 807 ms of which 10 ms to minimize.
[2024-05-31 18:19:58] [INFO ] Deduced a trap composed of 2 places in 1761 ms of which 16 ms to minimize.
[2024-05-31 18:19:59] [INFO ] Deduced a trap composed of 55 places in 798 ms of which 13 ms to minimize.
[2024-05-31 18:20:00] [INFO ] Deduced a trap composed of 53 places in 989 ms of which 10 ms to minimize.
[2024-05-31 18:20:01] [INFO ] Deduced a trap composed of 53 places in 873 ms of which 10 ms to minimize.
[2024-05-31 18:20:02] [INFO ] Deduced a trap composed of 55 places in 878 ms of which 10 ms to minimize.
[2024-05-31 18:20:02] [INFO ] Deduced a trap composed of 54 places in 762 ms of which 9 ms to minimize.
[2024-05-31 18:20:03] [INFO ] Deduced a trap composed of 53 places in 835 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:20:04] [INFO ] Deduced a trap composed of 55 places in 849 ms of which 10 ms to minimize.
[2024-05-31 18:20:05] [INFO ] Deduced a trap composed of 55 places in 752 ms of which 9 ms to minimize.
[2024-05-31 18:20:06] [INFO ] Deduced a trap composed of 53 places in 823 ms of which 10 ms to minimize.
[2024-05-31 18:20:07] [INFO ] Deduced a trap composed of 53 places in 762 ms of which 9 ms to minimize.
[2024-05-31 18:20:07] [INFO ] Deduced a trap composed of 55 places in 728 ms of which 9 ms to minimize.
[2024-05-31 18:20:08] [INFO ] Deduced a trap composed of 54 places in 650 ms of which 8 ms to minimize.
[2024-05-31 18:20:09] [INFO ] Deduced a trap composed of 53 places in 744 ms of which 9 ms to minimize.
[2024-05-31 18:20:10] [INFO ] Deduced a trap composed of 54 places in 787 ms of which 9 ms to minimize.
[2024-05-31 18:20:10] [INFO ] Deduced a trap composed of 54 places in 734 ms of which 9 ms to minimize.
[2024-05-31 18:20:11] [INFO ] Deduced a trap composed of 54 places in 678 ms of which 9 ms to minimize.
[2024-05-31 18:20:12] [INFO ] Deduced a trap composed of 55 places in 592 ms of which 8 ms to minimize.
[2024-05-31 18:20:12] [INFO ] Deduced a trap composed of 53 places in 576 ms of which 8 ms to minimize.
[2024-05-31 18:20:13] [INFO ] Deduced a trap composed of 54 places in 660 ms of which 9 ms to minimize.
[2024-05-31 18:20:14] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 8 ms to minimize.
[2024-05-31 18:20:14] [INFO ] Deduced a trap composed of 54 places in 552 ms of which 8 ms to minimize.
[2024-05-31 18:20:15] [INFO ] Deduced a trap composed of 54 places in 502 ms of which 7 ms to minimize.
[2024-05-31 18:20:16] [INFO ] Deduced a trap composed of 54 places in 656 ms of which 7 ms to minimize.
[2024-05-31 18:20:16] [INFO ] Deduced a trap composed of 53 places in 609 ms of which 9 ms to minimize.
[2024-05-31 18:20:17] [INFO ] Deduced a trap composed of 54 places in 501 ms of which 8 ms to minimize.
[2024-05-31 18:20:17] [INFO ] Deduced a trap composed of 53 places in 566 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2680 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:20:18] [INFO ] Deduced a trap composed of 53 places in 700 ms of which 9 ms to minimize.
[2024-05-31 18:20:19] [INFO ] Deduced a trap composed of 53 places in 788 ms of which 11 ms to minimize.
[2024-05-31 18:20:20] [INFO ] Deduced a trap composed of 54 places in 753 ms of which 10 ms to minimize.
[2024-05-31 18:20:21] [INFO ] Deduced a trap composed of 53 places in 726 ms of which 9 ms to minimize.
[2024-05-31 18:20:21] [INFO ] Deduced a trap composed of 53 places in 685 ms of which 8 ms to minimize.
[2024-05-31 18:20:22] [INFO ] Deduced a trap composed of 53 places in 702 ms of which 9 ms to minimize.
[2024-05-31 18:20:23] [INFO ] Deduced a trap composed of 54 places in 766 ms of which 9 ms to minimize.
[2024-05-31 18:20:24] [INFO ] Deduced a trap composed of 55 places in 753 ms of which 9 ms to minimize.
[2024-05-31 18:20:24] [INFO ] Deduced a trap composed of 53 places in 731 ms of which 9 ms to minimize.
[2024-05-31 18:20:25] [INFO ] Deduced a trap composed of 53 places in 787 ms of which 9 ms to minimize.
[2024-05-31 18:20:26] [INFO ] Deduced a trap composed of 53 places in 722 ms of which 9 ms to minimize.
[2024-05-31 18:20:27] [INFO ] Deduced a trap composed of 58 places in 618 ms of which 8 ms to minimize.
[2024-05-31 18:20:27] [INFO ] Deduced a trap composed of 53 places in 664 ms of which 9 ms to minimize.
[2024-05-31 18:20:28] [INFO ] Deduced a trap composed of 54 places in 839 ms of which 9 ms to minimize.
[2024-05-31 18:20:29] [INFO ] Deduced a trap composed of 53 places in 708 ms of which 8 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 53 places in 691 ms of which 9 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 54 places in 669 ms of which 9 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 55 places in 651 ms of which 8 ms to minimize.
[2024-05-31 18:20:32] [INFO ] Deduced a trap composed of 53 places in 660 ms of which 9 ms to minimize.
[2024-05-31 18:20:33] [INFO ] Deduced a trap composed of 53 places in 566 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2680 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:20:34] [INFO ] Deduced a trap composed of 53 places in 841 ms of which 9 ms to minimize.
[2024-05-31 18:20:34] [INFO ] Deduced a trap composed of 53 places in 632 ms of which 9 ms to minimize.
[2024-05-31 18:20:35] [INFO ] Deduced a trap composed of 54 places in 736 ms of which 9 ms to minimize.
[2024-05-31 18:20:36] [INFO ] Deduced a trap composed of 53 places in 606 ms of which 8 ms to minimize.
[2024-05-31 18:20:36] [INFO ] Deduced a trap composed of 53 places in 710 ms of which 9 ms to minimize.
[2024-05-31 18:20:37] [INFO ] Deduced a trap composed of 53 places in 683 ms of which 9 ms to minimize.
[2024-05-31 18:20:38] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 9 ms to minimize.
[2024-05-31 18:20:38] [INFO ] Deduced a trap composed of 54 places in 633 ms of which 8 ms to minimize.
[2024-05-31 18:20:39] [INFO ] Deduced a trap composed of 54 places in 572 ms of which 8 ms to minimize.
[2024-05-31 18:20:40] [INFO ] Deduced a trap composed of 54 places in 528 ms of which 7 ms to minimize.
[2024-05-31 18:20:40] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 7 ms to minimize.
[2024-05-31 18:20:41] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 14 ms to minimize.
[2024-05-31 18:20:41] [INFO ] Deduced a trap composed of 55 places in 495 ms of which 7 ms to minimize.
[2024-05-31 18:20:42] [INFO ] Deduced a trap composed of 55 places in 459 ms of which 7 ms to minimize.
[2024-05-31 18:20:43] [INFO ] Deduced a trap composed of 53 places in 637 ms of which 8 ms to minimize.
[2024-05-31 18:20:43] [INFO ] Deduced a trap composed of 54 places in 610 ms of which 8 ms to minimize.
[2024-05-31 18:20:44] [INFO ] Deduced a trap composed of 55 places in 703 ms of which 9 ms to minimize.
[2024-05-31 18:20:45] [INFO ] Deduced a trap composed of 55 places in 739 ms of which 9 ms to minimize.
[2024-05-31 18:20:46] [INFO ] Deduced a trap composed of 53 places in 704 ms of which 9 ms to minimize.
[2024-05-31 18:20:46] [INFO ] Deduced a trap composed of 55 places in 680 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2680 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:20:47] [INFO ] Deduced a trap composed of 55 places in 700 ms of which 9 ms to minimize.
[2024-05-31 18:20:48] [INFO ] Deduced a trap composed of 55 places in 623 ms of which 8 ms to minimize.
[2024-05-31 18:20:48] [INFO ] Deduced a trap composed of 53 places in 569 ms of which 9 ms to minimize.
[2024-05-31 18:20:49] [INFO ] Deduced a trap composed of 54 places in 530 ms of which 7 ms to minimize.
[2024-05-31 18:20:50] [INFO ] Deduced a trap composed of 55 places in 580 ms of which 8 ms to minimize.
[2024-05-31 18:20:50] [INFO ] Deduced a trap composed of 55 places in 543 ms of which 8 ms to minimize.
[2024-05-31 18:20:51] [INFO ] Deduced a trap composed of 53 places in 750 ms of which 11 ms to minimize.
[2024-05-31 18:20:52] [INFO ] Deduced a trap composed of 55 places in 834 ms of which 10 ms to minimize.
[2024-05-31 18:20:53] [INFO ] Deduced a trap composed of 53 places in 784 ms of which 10 ms to minimize.
[2024-05-31 18:20:53] [INFO ] Deduced a trap composed of 55 places in 642 ms of which 9 ms to minimize.
[2024-05-31 18:20:54] [INFO ] Deduced a trap composed of 55 places in 687 ms of which 9 ms to minimize.
[2024-05-31 18:20:55] [INFO ] Deduced a trap composed of 53 places in 599 ms of which 9 ms to minimize.
[2024-05-31 18:20:55] [INFO ] Deduced a trap composed of 54 places in 587 ms of which 8 ms to minimize.
[2024-05-31 18:20:56] [INFO ] Deduced a trap composed of 53 places in 549 ms of which 8 ms to minimize.
[2024-05-31 18:20:57] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 7 ms to minimize.
[2024-05-31 18:20:57] [INFO ] Deduced a trap composed of 53 places in 488 ms of which 7 ms to minimize.
[2024-05-31 18:20:58] [INFO ] Deduced a trap composed of 53 places in 494 ms of which 8 ms to minimize.
[2024-05-31 18:20:58] [INFO ] Deduced a trap composed of 53 places in 522 ms of which 8 ms to minimize.
[2024-05-31 18:20:59] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 8 ms to minimize.
[2024-05-31 18:20:59] [INFO ] Deduced a trap composed of 53 places in 507 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2680 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 7 ms to minimize.
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 54 places in 507 ms of which 10 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 58 places in 455 ms of which 8 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 58 places in 442 ms of which 7 ms to minimize.
[2024-05-31 18:21:02] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 7 ms to minimize.
[2024-05-31 18:21:02] [INFO ] Deduced a trap composed of 54 places in 442 ms of which 7 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 55 places in 403 ms of which 6 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 57 places in 475 ms of which 9 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 53 places in 412 ms of which 7 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 54 places in 411 ms of which 6 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 55 places in 365 ms of which 6 ms to minimize.
[2024-05-31 18:21:05] [INFO ] Deduced a trap composed of 55 places in 382 ms of which 6 ms to minimize.
[2024-05-31 18:21:05] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 7 ms to minimize.
[2024-05-31 18:21:06] [INFO ] Deduced a trap composed of 53 places in 438 ms of which 7 ms to minimize.
[2024-05-31 18:21:06] [INFO ] Deduced a trap composed of 53 places in 386 ms of which 7 ms to minimize.
[2024-05-31 18:21:07] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 6 ms to minimize.
[2024-05-31 18:21:07] [INFO ] Deduced a trap composed of 53 places in 361 ms of which 5 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 5 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 6 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2680 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:21:09] [INFO ] Deduced a trap composed of 57 places in 342 ms of which 6 ms to minimize.
[2024-05-31 18:21:09] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 6 ms to minimize.
[2024-05-31 18:21:09] [INFO ] Deduced a trap composed of 55 places in 313 ms of which 6 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 55 places in 370 ms of which 5 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 55 places in 313 ms of which 5 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 55 places in 279 ms of which 5 ms to minimize.
SMT process timed out in 93226ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2695/2695 places, 5179/5179 transitions.
Applied a total of 0 rules in 255 ms. Remains 2695 /2695 variables (removed 0) and now considering 5179/5179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 2695/2695 places, 5179/5179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2695/2695 places, 5179/5179 transitions.
Applied a total of 0 rules in 248 ms. Remains 2695 /2695 variables (removed 0) and now considering 5179/5179 (removed 0) transitions.
[2024-05-31 18:21:11] [INFO ] Invariant cache hit.
[2024-05-31 18:21:13] [INFO ] Implicit Places using invariants in 1622 ms returned []
[2024-05-31 18:21:13] [INFO ] Invariant cache hit.
[2024-05-31 18:21:14] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2024-05-31 18:21:44] [INFO ] Performed 1294/2695 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:22:14] [INFO ] Performed 2534/2695 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:22:19] [INFO ] Implicit Places using invariants and state equation in 66260 ms returned []
Implicit Place search using SMT with State Equation took 67906 ms to find 0 implicit places.
[2024-05-31 18:22:19] [INFO ] Redundant transitions in 363 ms returned []
Running 5129 sub problems to find dead transitions.
[2024-05-31 18:22:19] [INFO ] Invariant cache hit.
[2024-05-31 18:22:19] [INFO ] State equation strengthened by 4958 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2694 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5129 unsolved
SMT process timed out in 35243ms, After SMT, problems are : Problem set: 0 solved, 5129 unsolved
Search for dead transitions found 0 dead transitions in 35303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103861 ms. Remains : 2695/2695 places, 5179/5179 transitions.
[2024-05-31 18:22:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2024-05-31 18:22:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2695 places, 5179 transitions and 20464 arcs took 33 ms.
[2024-05-31 18:22:55] [INFO ] Flatten gal took : 474 ms
Total runtime 420458 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 : CANConstruction-PT-050-ReachabilityCardinality-2024-01
Could not compute solution for formula : CANConstruction-PT-050-ReachabilityCardinality-2024-03
BK_STOP 1717179776187
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-050-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1419/inv_0_
rfs formula name CANConstruction-PT-050-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1419/inv_1_
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="CANConstruction-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;