About the Execution of LTSMin+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 761.796 | 302301.00 | 394345.00 | 539.50 | ??T??TFTFT?F?TFF | 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-171683761600686.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 ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600686
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717260283163
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:44:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:44:44] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-01 16:44:44] [INFO ] Transformed 3903 places.
[2024-06-01 16:44:44] [INFO ] Transformed 3553 transitions.
[2024-06-01 16:44:44] [INFO ] Found NUPN structural information;
[2024-06-01 16:44:44] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2022 ms. (19 steps per ms) remains 7/11 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1053 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
// Phase 1: matrix 3553 rows 3903 cols
[2024-06-01 16:44:46] [INFO ] Computed 551 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2925/3077 variables, 421/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3077 variables, 2925/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3077 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 826/3903 variables, 130/3628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3903 variables, 826/4454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3903 variables, 0/4454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3553/7456 variables, 3903/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7456 variables, 0/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/7456 variables, 0/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7456/7456 variables, and 8357 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4743 ms.
Refiners :[Domain max(s): 3903/3903 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3903/3903 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/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2925/3077 variables, 421/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3077 variables, 2925/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:44:52] [INFO ] Deduced a trap composed of 34 places in 652 ms of which 77 ms to minimize.
[2024-06-01 16:44:53] [INFO ] Deduced a trap composed of 23 places in 553 ms of which 10 ms to minimize.
[2024-06-01 16:44:54] [INFO ] Deduced a trap composed of 22 places in 518 ms of which 10 ms to minimize.
[2024-06-01 16:44:54] [INFO ] Deduced a trap composed of 18 places in 498 ms of which 10 ms to minimize.
[2024-06-01 16:44:55] [INFO ] Deduced a trap composed of 43 places in 464 ms of which 10 ms to minimize.
[2024-06-01 16:44:55] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 8 ms to minimize.
[2024-06-01 16:44:56] [INFO ] Deduced a trap composed of 42 places in 461 ms of which 8 ms to minimize.
[2024-06-01 16:44:56] [INFO ] Deduced a trap composed of 45 places in 459 ms of which 8 ms to minimize.
SMT process timed out in 10287ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 844 place count 3903 transition count 2709
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 846 rules applied. Total rules applied 1690 place count 3059 transition count 2707
Reduce places removed 1 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 41 rules applied. Total rules applied 1731 place count 3058 transition count 2667
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1771 place count 3018 transition count 2667
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1771 place count 3018 transition count 2468
Deduced a syphon composed of 199 places in 7 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 2169 place count 2819 transition count 2468
Discarding 330 places :
Symmetric choice reduction at 4 with 330 rule applications. Total rules 2499 place count 2489 transition count 2138
Iterating global reduction 4 with 330 rules applied. Total rules applied 2829 place count 2489 transition count 2138
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 129 Pre rules applied. Total rules applied 2829 place count 2489 transition count 2009
Deduced a syphon composed of 129 places in 15 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 3087 place count 2360 transition count 2009
Performed 780 Post agglomeration using F-continuation condition.Transition count delta: 780
Deduced a syphon composed of 780 places in 4 ms
Reduce places removed 780 places and 0 transitions.
Iterating global reduction 4 with 1560 rules applied. Total rules applied 4647 place count 1580 transition count 1229
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4849 place count 1479 transition count 1229
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 4891 place count 1458 transition count 1229
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4901 place count 1458 transition count 1219
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 4911 place count 1448 transition count 1219
Partial Free-agglomeration rule applied 128 times.
Drop transitions (Partial Free agglomeration) removed 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 5039 place count 1448 transition count 1219
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 5041 place count 1448 transition count 1219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5042 place count 1447 transition count 1218
Applied a total of 5042 rules in 1466 ms. Remains 1447 /3903 variables (removed 2456) and now considering 1218/3553 (removed 2335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1475 ms. Remains : 1447/3903 places, 1218/3553 transitions.
RANDOM walk for 40000 steps (8 resets) in 624 ms. (64 steps per ms) remains 6/7 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 481 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 455 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
// Phase 1: matrix 1218 rows 1447 cols
[2024-06-01 16:44:59] [INFO ] Computed 551 invariants in 10 ms
[2024-06-01 16:44:59] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 473/599 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 682/1281 variables, 297/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1120/2401 variables, 1281/1760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2401 variables, 215/1975 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2401 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 129/2530 variables, 80/2055 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2530 variables, 29/2084 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2530 variables, 2/2086 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2530 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/2537 variables, 9/2095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2537 variables, 7/2102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2537 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 23/2560 variables, 10/2112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2560 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 82/2642 variables, 60/2172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2642 variables, 11/2183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2642 variables, 2/2185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2642 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 5/2647 variables, 6/2191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2647 variables, 3/2194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2647 variables, 0/2194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/2649 variables, 1/2195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2649 variables, 0/2195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 16/2665 variables, 16/2211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2665 variables, 6/2217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2665 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/2665 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2665/2665 variables, and 2217 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4213 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1447/1447 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 473/599 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:45:04] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/599 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 682/1281 variables, 297/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:45:05] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 5 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:45:06] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:45:08] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:45:08] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:08] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:45:08] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1120/2401 variables, 1281/1809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2401 variables, 215/2024 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2401 variables, 2/2026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:09] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:45:09] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:45:10] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:45:10] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:45:10] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:45:10] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 5 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 7 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:45:12] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:45:12] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:45:12] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2401 variables, 13/2039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:12] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2401 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2401 variables, 0/2040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 129/2530 variables, 80/2120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2530 variables, 29/2149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2530 variables, 2/2151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2530 variables, 4/2155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:15] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:45:15] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:45:15] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 4 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 4 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:45:17] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 4 ms to minimize.
[2024-06-01 16:45:17] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:45:17] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 4 ms to minimize.
[2024-06-01 16:45:18] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 4 ms to minimize.
[2024-06-01 16:45:18] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2530 variables, 13/2168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2530 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 7/2537 variables, 9/2177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2537 variables, 7/2184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:20] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:45:20] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2537 variables, 2/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2537 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 23/2560 variables, 10/2196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2560 variables, 0/2196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 82/2642 variables, 60/2256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2642 variables, 11/2267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2642 variables, 2/2269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2642 variables, 0/2269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 5/2647 variables, 6/2275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2647 variables, 3/2278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2647 variables, 0/2278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 2/2649 variables, 1/2279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2649 variables, 0/2279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 16/2665 variables, 16/2295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2665 variables, 6/2301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:25] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2665 variables, 1/2302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2665 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/2665 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2665/2665 variables, and 2302 constraints, problems are : Problem set: 0 solved, 6 unsolved in 23853 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1447/1447 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 79/79 constraints]
After SMT, in 28133ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1690 ms.
Support contains 126 out of 1447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1447 transition count 1213
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 1442 transition count 1210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 1439 transition count 1210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 1439 transition count 1206
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 1435 transition count 1206
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 58 place count 1418 transition count 1189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1417 transition count 1189
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 1417 transition count 1189
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 1414 transition count 1186
Applied a total of 67 rules in 179 ms. Remains 1414 /1447 variables (removed 33) and now considering 1186/1218 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1414/1447 places, 1186/1218 transitions.
RANDOM walk for 40000 steps (8 resets) in 603 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 106223 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 6
Probabilistic random walk after 106223 steps, saw 64324 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1186 rows 1414 cols
[2024-06-01 16:45:32] [INFO ] Computed 551 invariants in 4 ms
[2024-06-01 16:45:32] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 459/585 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 650/1235 variables, 289/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1235 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1080/2315 variables, 1235/1706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2315 variables, 220/1926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2315 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 127/2442 variables, 80/2006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2442 variables, 32/2038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2442 variables, 1/2039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2442 variables, 0/2039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/2448 variables, 6/2045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2448 variables, 6/2051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2448 variables, 0/2051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 12/2460 variables, 6/2057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2460 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 92/2552 variables, 59/2116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2552 variables, 15/2131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2552 variables, 0/2131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 5/2557 variables, 7/2138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2557 variables, 5/2143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2557 variables, 0/2143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 6/2563 variables, 3/2146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2563 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 26/2589 variables, 22/2168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2589 variables, 7/2175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2589 variables, 0/2175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 1/2590 variables, 1/2176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2590 variables, 1/2177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2590 variables, 0/2177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 2/2592 variables, 1/2178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2592 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 8/2600 variables, 6/2184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2600 variables, 2/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2600 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 0/2600 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2186 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5439 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1414/1414 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 459/585 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 650/1235 variables, 289/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1235 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1235 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1235 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 16:45:43] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1235 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1235 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1080/2315 variables, 1235/1759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2315 variables, 220/1979 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2315 variables, 2/1981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:44] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:45:44] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 4 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:45:46] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:45:46] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 4 ms to minimize.
[2024-06-01 16:45:46] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:45:46] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 4 ms to minimize.
[2024-06-01 16:45:47] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:45:47] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:45:47] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:45:47] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2315 variables, 14/1995 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2315 variables, 3/1998 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:49] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2315 variables, 1/1999 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:49] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:45:50] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2315 variables, 2/2001 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:50] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2315 variables, 1/2002 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2315 variables, 3/2005 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:52] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2315 variables, 1/2006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:53] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2315 variables, 1/2007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2315 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 127/2442 variables, 80/2087 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2442 variables, 32/2119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2442 variables, 1/2120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2442 variables, 4/2124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:45:55] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:45:55] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2442 variables, 2/2126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2442 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 6/2448 variables, 6/2132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2448 variables, 6/2138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2448 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 12/2460 variables, 6/2144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2460 variables, 0/2144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 92/2552 variables, 59/2203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2552 variables, 15/2218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2552 variables, 0/2218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 5/2557 variables, 7/2225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2557 variables, 5/2230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:00] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2557 variables, 1/2231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2557 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 6/2563 variables, 3/2234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2563 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 26/2589 variables, 22/2256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2589 variables, 7/2263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/2589 variables, 1/2264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2589 variables, 0/2264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 1/2590 variables, 1/2265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2590 variables, 1/2266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2590 variables, 0/2266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 2/2592 variables, 1/2267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2592 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (OVERLAPS) 8/2600 variables, 6/2273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2600 variables, 2/2275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2600 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 0/2600 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2275 constraints, problems are : Problem set: 0 solved, 6 unsolved in 28708 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1414/1414 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 83/83 constraints]
After SMT, in 34187ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3054 ms.
Support contains 126 out of 1414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1414/1414 places, 1186/1186 transitions.
Applied a total of 0 rules in 31 ms. Remains 1414 /1414 variables (removed 0) and now considering 1186/1186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1414/1414 places, 1186/1186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1414/1414 places, 1186/1186 transitions.
Applied a total of 0 rules in 32 ms. Remains 1414 /1414 variables (removed 0) and now considering 1186/1186 (removed 0) transitions.
[2024-06-01 16:46:10] [INFO ] Invariant cache hit.
[2024-06-01 16:46:10] [INFO ] Implicit Places using invariants in 724 ms returned [1403]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 733 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1413/1414 places, 1186/1186 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1413 transition count 1184
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1411 transition count 1184
Applied a total of 4 rules in 39 ms. Remains 1411 /1413 variables (removed 2) and now considering 1184/1186 (removed 2) transitions.
// Phase 1: matrix 1184 rows 1411 cols
[2024-06-01 16:46:10] [INFO ] Computed 550 invariants in 8 ms
[2024-06-01 16:46:11] [INFO ] Implicit Places using invariants in 673 ms returned [1390, 1394]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 675 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1409/1414 places, 1184/1186 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1408 transition count 1183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1408 transition count 1183
Applied a total of 2 rules in 57 ms. Remains 1408 /1409 variables (removed 1) and now considering 1183/1184 (removed 1) transitions.
// Phase 1: matrix 1183 rows 1408 cols
[2024-06-01 16:46:11] [INFO ] Computed 548 invariants in 3 ms
[2024-06-01 16:46:12] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-06-01 16:46:12] [INFO ] Invariant cache hit.
[2024-06-01 16:46:12] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-06-01 16:46:16] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1408/1414 places, 1183/1186 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6065 ms. Remains : 1408/1414 places, 1183/1186 transitions.
RANDOM walk for 40000 steps (8 resets) in 561 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 315 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 103265 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 6
Probabilistic random walk after 103265 steps, saw 62180 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 16:46:19] [INFO ] Invariant cache hit.
[2024-06-01 16:46:19] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 457/583 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 646/1229 variables, 287/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1077/2306 variables, 1229/1697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2306 variables, 218/1915 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 0/1915 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 127/2433 variables, 80/1995 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2433 variables, 32/2027 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2433 variables, 1/2028 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2433 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/2439 variables, 6/2034 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2439 variables, 6/2040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2439 variables, 0/2040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 12/2451 variables, 6/2046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2451 variables, 0/2046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 92/2543 variables, 59/2105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2543 variables, 15/2120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2543 variables, 0/2120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 5/2548 variables, 7/2127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2548 variables, 5/2132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2548 variables, 0/2132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 6/2554 variables, 3/2135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2554 variables, 0/2135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 26/2580 variables, 22/2157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2580 variables, 7/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2580 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 1/2581 variables, 1/2165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2581 variables, 1/2166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2581 variables, 0/2166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 2/2583 variables, 1/2167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2583 variables, 0/2167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 8/2591 variables, 6/2173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2591 variables, 2/2175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2591 variables, 0/2175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 0/2591 variables, 0/2175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2591/2591 variables, and 2175 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5542 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1408/1408 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 457/583 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 14/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 646/1229 variables, 287/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:46:27] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:46:28] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 20/508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1229 variables, 3/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1229 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1077/2306 variables, 1229/1741 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2306 variables, 218/1959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2306 variables, 2/1961 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2306 variables, 6/1967 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2306 variables, 2/1969 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2306 variables, 1/1970 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2306 variables, 0/1970 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 127/2433 variables, 80/2050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2433 variables, 32/2082 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2433 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2433 variables, 4/2087 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 4 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2433 variables, 13/2100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2433 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 6/2439 variables, 6/2106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2439 variables, 6/2112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2439 variables, 1/2113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2439 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 12/2451 variables, 6/2119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2451 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 92/2543 variables, 59/2178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2543 variables, 15/2193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2543 variables, 1/2194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2543 variables, 0/2194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 5/2548 variables, 7/2201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2548 variables, 5/2206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2548 variables, 0/2206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 6/2554 variables, 3/2209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2554 variables, 0/2209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 26/2580 variables, 22/2231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2580 variables, 7/2238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2580 variables, 0/2238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 1/2581 variables, 1/2239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2581 variables, 1/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2581 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 2/2583 variables, 1/2241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2583 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (OVERLAPS) 8/2591 variables, 6/2247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2591 variables, 2/2249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2591 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (OVERLAPS) 0/2591 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2591/2591 variables, and 2249 constraints, problems are : Problem set: 0 solved, 6 unsolved in 27049 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1408/1408 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 68/68 constraints]
After SMT, in 32630ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10190 ms.
Support contains 126 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1183/1183 transitions.
Applied a total of 0 rules in 32 ms. Remains 1408 /1408 variables (removed 0) and now considering 1183/1183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1408/1408 places, 1183/1183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1183/1183 transitions.
Applied a total of 0 rules in 31 ms. Remains 1408 /1408 variables (removed 0) and now considering 1183/1183 (removed 0) transitions.
[2024-06-01 16:47:02] [INFO ] Invariant cache hit.
[2024-06-01 16:47:03] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 16:47:03] [INFO ] Invariant cache hit.
[2024-06-01 16:47:03] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-06-01 16:47:07] [INFO ] Implicit Places using invariants and state equation in 3907 ms returned []
Implicit Place search using SMT with State Equation took 4601 ms to find 0 implicit places.
[2024-06-01 16:47:07] [INFO ] Redundant transitions in 104 ms returned []
Running 1173 sub problems to find dead transitions.
[2024-06-01 16:47:07] [INFO ] Invariant cache hit.
[2024-06-01 16:47:07] [INFO ] State equation strengthened by 219 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1398 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1398/2591 variables, and 102 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 102/548 constraints, State Equation: 0/1408 constraints, ReadFeed: 0/219 constraints, PredecessorRefiner: 1173/1173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1398 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1398 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1398/2591 variables, and 104 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 102/548 constraints, State Equation: 0/1408 constraints, ReadFeed: 0/219 constraints, PredecessorRefiner: 0/1173 constraints, Known Traps: 2/2 constraints]
After SMT, in 60452ms problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65225 ms. Remains : 1408/1408 places, 1183/1183 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 255 times.
Drop transitions (Partial Free agglomeration) removed 255 transitions
Iterating global reduction 0 with 255 rules applied. Total rules applied 255 place count 1408 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 256 place count 1408 transition count 1182
Applied a total of 256 rules in 92 ms. Remains 1408 /1408 variables (removed 0) and now considering 1182/1183 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1182 rows 1408 cols
[2024-06-01 16:48:07] [INFO ] Computed 548 invariants in 7 ms
[2024-06-01 16:48:08] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 16:48:08] [INFO ] [Nat]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-06-01 16:48:09] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 16:48:09] [INFO ] State equation strengthened by 215 read => feed constraints.
[2024-06-01 16:48:10] [INFO ] After 1314ms SMT Verify possible using 215 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 4 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 4 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 4 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 4 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 9 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 8592 ms
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 4 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 4 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 4 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4789 ms
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 5 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 5 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 5 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3355 ms
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 5 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1226 ms
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 5 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
TRAPS : Iteration 1
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4510 ms
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 4 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 4 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 4 ms to minimize.
[2024-06-01 16:48:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 943 ms
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 4 ms to minimize.
[2024-06-01 16:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
TRAPS : Iteration 2
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 5 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:48:41] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:48:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1869 ms
[2024-06-01 16:48:41] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 5 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 654 ms
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:48:44] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:48:44] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:48:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1332 ms
[2024-06-01 16:48:45] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
TRAPS : Iteration 3
[2024-06-01 16:48:45] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 5 ms to minimize.
[2024-06-01 16:48:46] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:48:46] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:48:46] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:48:46] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:48:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1466 ms
[2024-06-01 16:48:47] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:48:47] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:48:48] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:48:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 924 ms
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 4 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 4 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 4 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2105 ms
TRAPS : Iteration 4
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2682 ms
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 4 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1247 ms
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1082 ms
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 729 ms
TRAPS : Iteration 5
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 866 ms
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1084 ms
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
TRAPS : Iteration 6
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1424 ms
[2024-06-01 16:49:11] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
TRAPS : Iteration 7
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
TRAPS : Iteration 8
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 4 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 4 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1358 ms
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 5 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 710 ms
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 5 ms to minimize.
[2024-06-01 16:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 882 ms
TRAPS : Iteration 9
[2024-06-01 16:49:26] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-06-01 16:49:26] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1073 ms
[2024-06-01 16:49:28] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
TRAPS : Iteration 10
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 5 ms to minimize.
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1485 ms
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
TRAPS : Iteration 11
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 753 ms
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-06-01 16:49:38] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-06-01 16:49:39] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
TRAPS : Iteration 12
[2024-06-01 16:49:41] [INFO ] After 91826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 16:49:44] [INFO ] After 96612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 97050 ms.
[2024-06-01 16:49:44] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2024-06-01 16:49:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1408 places, 1183 transitions and 5003 arcs took 9 ms.
[2024-06-01 16:49:45] [INFO ] Flatten gal took : 150 ms
Total runtime 300827 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 : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
BK_STOP 1717260585464
--------------------
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 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/2008/inv_0_
rfs formula name ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/2008/inv_1_
rfs formula name ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/2008/inv_2_
rfs formula name ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/2008/inv_3_
rfs formula name ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/2008/inv_4_
rfs formula name ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/2008/inv_5_
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r528-tall-171683761600686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 ;