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-171683761600670.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-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 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 762K 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-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717259364167

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-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:29:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:29:25] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 16:29:25] [INFO ] Transformed 3123 places.
[2024-06-01 16:29:25] [INFO ] Transformed 2843 transitions.
[2024-06-01 16:29:25] [INFO ] Found NUPN structural information;
[2024-06-01 16:29:25] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2341 ms. (17 steps per ms) remains 7/13 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
// Phase 1: matrix 2843 rows 3123 cols
[2024-06-01 16:29:27] [INFO ] Computed 441 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2051/2100 variables, 289/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2100 variables, 2051/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2100 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1023/3123 variables, 152/2541 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3123 variables, 1023/3564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3123 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2843/5966 variables, 3123/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5966/5966 variables, and 6687 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3684 ms.
Refiners :[Domain max(s): 3123/3123 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 3123/3123 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/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2051/2100 variables, 289/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2100 variables, 2051/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 46 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 5 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2100 variables, 20/2409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2100/5966 variables, and 2409 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5013 ms.
Refiners :[Domain max(s): 2100/3123 constraints, Positive P Invariants (semi-flows): 289/441 constraints, State Equation: 0/3123 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 20/20 constraints]
After SMT, in 8842ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 728 transitions
Trivial Post-agglo rules discarded 728 transitions
Performed 728 trivial Post agglomeration. Transition count delta: 728
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 3123 transition count 2115
Reduce places removed 728 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 730 rules applied. Total rules applied 1458 place count 2395 transition count 2113
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 1468 place count 2394 transition count 2104
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1477 place count 2385 transition count 2104
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 1477 place count 2385 transition count 1936
Deduced a syphon composed of 168 places in 6 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1813 place count 2217 transition count 1936
Discarding 267 places :
Symmetric choice reduction at 4 with 267 rule applications. Total rules 2080 place count 1950 transition count 1669
Iterating global reduction 4 with 267 rules applied. Total rules applied 2347 place count 1950 transition count 1669
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2347 place count 1950 transition count 1556
Deduced a syphon composed of 113 places in 10 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2573 place count 1837 transition count 1556
Performed 654 Post agglomeration using F-continuation condition.Transition count delta: 654
Deduced a syphon composed of 654 places in 4 ms
Reduce places removed 654 places and 0 transitions.
Iterating global reduction 4 with 1308 rules applied. Total rules applied 3881 place count 1183 transition count 902
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 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4083 place count 1082 transition count 902
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 4111 place count 1068 transition count 902
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4112 place count 1068 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4113 place count 1067 transition count 901
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 5 with 117 rules applied. Total rules applied 4230 place count 1067 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4231 place count 1066 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4232 place count 1065 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4232 place count 1065 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4236 place count 1063 transition count 898
Applied a total of 4236 rules in 1490 ms. Remains 1063 /3123 variables (removed 2060) and now considering 898/2843 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1504 ms. Remains : 1063/3123 places, 898/2843 transitions.
RANDOM walk for 40000 steps (8 resets) in 643 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/7 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
// Phase 1: matrix 898 rows 1063 cols
[2024-06-01 16:29:38] [INFO ] Computed 440 invariants in 6 ms
[2024-06-01 16:29:38] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 652/680 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 77/757 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 679/1436 variables, 757/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1436 variables, 167/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1436 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 171/1607 variables, 96/1327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1607 variables, 34/1361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1607 variables, 2/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1607 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1619 variables, 10/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1619 variables, 8/1381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1619 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1633 variables, 7/1388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1633 variables, 0/1388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 152/1785 variables, 88/1476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1785 variables, 24/1500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1785 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1785 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 9/1794 variables, 10/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1794 variables, 7/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1794 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1804 variables, 5/1524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1804 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 115/1919 variables, 79/1603 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1919 variables, 26/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1919 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1922 variables, 5/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1922 variables, 3/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1922 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1948 variables, 16/1653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1948 variables, 6/1659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1948 variables, 0/1659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1949 variables, 2/1661 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1949 variables, 1/1662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1949 variables, 0/1662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1961 variables, 8/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1961 variables, 4/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1961 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1961 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 1674 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3693 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1063/1063 constraints, ReadFeed: 171/171 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 652/680 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 4 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 6 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 77/757 variables, 32/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:29:45] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 679/1436 variables, 757/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1436 variables, 167/1263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1436 variables, 4/1267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1436 variables, 2/1269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1436 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 171/1607 variables, 96/1365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1607 variables, 34/1399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1607 variables, 2/1401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1607 variables, 2/1403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1607 variables, 5/1408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1607 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 12/1619 variables, 10/1418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1619 variables, 8/1426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1619 variables, 1/1427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1619 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 14/1633 variables, 7/1434 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1633 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 152/1785 variables, 88/1522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1785 variables, 24/1546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1785 variables, 2/1548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1785 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1785 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 9/1794 variables, 10/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1794 variables, 7/1566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1794 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 10/1804 variables, 5/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1804 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 115/1919 variables, 79/1650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1919 variables, 26/1676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1919 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 3/1922 variables, 5/1681 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1922 variables, 3/1684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1922 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 26/1948 variables, 16/1700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1948 variables, 6/1706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1948 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 1/1949 variables, 2/1708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1949 variables, 1/1709 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1949 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 12/1961 variables, 8/1717 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1961 variables, 4/1721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:29:53] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1961 variables, 1/1722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1961 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 0/1961 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 1722 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12857 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1063/1063 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 42/42 constraints]
After SMT, in 16582ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5556 ms.
Support contains 28 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 898/898 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 1063 transition count 893
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 1058 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 1057 transition count 892
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 1057 transition count 889
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 1054 transition count 889
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 1041 transition count 876
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 46 place count 1040 transition count 876
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 1040 transition count 874
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 1038 transition count 874
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 1038 transition count 874
Applied a total of 55 rules in 146 ms. Remains 1038 /1063 variables (removed 25) and now considering 874/898 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 1038/1063 places, 874/898 transitions.
RANDOM walk for 40000 steps (8 resets) in 519 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 139665 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 6
Probabilistic random walk after 139665 steps, saw 117045 distinct states, run finished after 3010 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 874 rows 1038 cols
[2024-06-01 16:30:04] [INFO ] Computed 440 invariants in 5 ms
[2024-06-01 16:30:04] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 636/664 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/664 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 74/738 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 660/1398 variables, 738/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1398 variables, 174/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1398 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 170/1568 variables, 97/1316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1568 variables, 37/1353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1568 variables, 2/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1568 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1575 variables, 7/1362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1575 variables, 7/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1575 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1589 variables, 7/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1589 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 148/1737 variables, 84/1460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1737 variables, 25/1485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1737 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1737 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 7/1744 variables, 9/1496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1744 variables, 7/1503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1744 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1754 variables, 5/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1754 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 116/1870 variables, 77/1585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1870 variables, 26/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1870 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1873 variables, 5/1616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1873 variables, 3/1619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1873 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1899 variables, 16/1635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1899 variables, 6/1641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1899 variables, 0/1641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1900 variables, 2/1643 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1900 variables, 1/1644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1900 variables, 0/1644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1912 variables, 8/1652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1912 variables, 4/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1912 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1912 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1912/1912 variables, and 1656 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1038/1038 constraints, ReadFeed: 178/178 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 636/664 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:07] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/664 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/664 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 74/738 variables, 32/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 660/1398 variables, 738/1046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1398 variables, 174/1220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1398 variables, 4/1224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1398 variables, 3/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1398 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 170/1568 variables, 97/1324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1568 variables, 37/1361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1568 variables, 2/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1568 variables, 2/1365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:09] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1568 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1568 variables, 3/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1568 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 7/1575 variables, 7/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1575 variables, 7/1383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1575 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 14/1589 variables, 7/1390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1589 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 148/1737 variables, 84/1474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1737 variables, 25/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1737 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1737 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 7/1744 variables, 9/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1744 variables, 7/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1744 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 10/1754 variables, 5/1522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1754 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 116/1870 variables, 77/1599 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1870 variables, 26/1625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1870 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 3/1873 variables, 5/1630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1873 variables, 3/1633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1873 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 26/1899 variables, 16/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1899 variables, 6/1655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1899 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 1/1900 variables, 2/1657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1900 variables, 1/1658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1900 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 12/1912 variables, 8/1666 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1912 variables, 4/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1912 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 0/1912 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1912/1912 variables, and 1670 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7033 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1038/1038 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 10559ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1722 ms.
Support contains 28 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 23 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1038/1038 places, 874/874 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 22 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-06-01 16:30:16] [INFO ] Invariant cache hit.
[2024-06-01 16:30:17] [INFO ] Implicit Places using invariants in 517 ms returned [1021, 1025]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 531 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1036/1038 places, 874/874 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 872
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 872
Applied a total of 4 rules in 37 ms. Remains 1034 /1036 variables (removed 2) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 1034 cols
[2024-06-01 16:30:17] [INFO ] Computed 438 invariants in 8 ms
[2024-06-01 16:30:17] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-01 16:30:17] [INFO ] Invariant cache hit.
[2024-06-01 16:30:18] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-06-01 16:30:20] [INFO ] Implicit Places using invariants and state equation in 2918 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1034/1038 places, 872/874 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3989 ms. Remains : 1034/1038 places, 872/874 transitions.
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 143334 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 6
Probabilistic random walk after 143334 steps, saw 119620 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 16:30:23] [INFO ] Invariant cache hit.
[2024-06-01 16:30:23] [INFO ] State equation strengthened by 177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 634/662 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 74/736 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 659/1395 variables, 736/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1395 variables, 174/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1395 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 170/1565 variables, 97/1313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1565 variables, 37/1350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1565 variables, 2/1352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1565 variables, 0/1352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1572 variables, 7/1359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1572 variables, 7/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1586 variables, 7/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1586 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 147/1733 variables, 84/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1733 variables, 25/1482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1733 variables, 1/1483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1733 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 7/1740 variables, 9/1492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1740 variables, 7/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1740 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1750 variables, 5/1504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1750 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 114/1864 variables, 75/1579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1864 variables, 25/1604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1864 variables, 0/1604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1867 variables, 5/1609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1867 variables, 3/1612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1867 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1893 variables, 16/1628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1893 variables, 6/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1893 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1894 variables, 2/1636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1894 variables, 1/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1894 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1906 variables, 8/1645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1906 variables, 4/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1906 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1906 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1906/1906 variables, and 1649 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1034/1034 constraints, ReadFeed: 177/177 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 634/662 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 74/736 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 659/1395 variables, 736/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1395 variables, 174/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1395 variables, 4/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1395 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1395 variables, 3/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1395 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 170/1565 variables, 97/1327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1565 variables, 37/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1565 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1565 variables, 2/1368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:30:30] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1565 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1565 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 7/1572 variables, 7/1377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1572 variables, 7/1384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 14/1586 variables, 7/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1586 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 147/1733 variables, 84/1475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1733 variables, 25/1500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1733 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1733 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 7/1740 variables, 9/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1740 variables, 7/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1740 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 10/1750 variables, 5/1523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1750 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 114/1864 variables, 75/1598 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1864 variables, 25/1623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1864 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 3/1867 variables, 5/1628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1867 variables, 3/1631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1867 variables, 0/1631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 26/1893 variables, 16/1647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1893 variables, 6/1653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1893 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 1/1894 variables, 2/1655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1894 variables, 1/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1894 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 12/1906 variables, 8/1664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1906 variables, 4/1668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1906 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (OVERLAPS) 0/1906 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1906/1906 variables, and 1668 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7744 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1034/1034 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 10990ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2573 ms.
Support contains 28 out of 1034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 29 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1034/1034 places, 872/872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 21 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-06-01 16:30:37] [INFO ] Invariant cache hit.
[2024-06-01 16:30:38] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-01 16:30:38] [INFO ] Invariant cache hit.
[2024-06-01 16:30:38] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-06-01 16:30:41] [INFO ] Implicit Places using invariants and state equation in 2981 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2024-06-01 16:30:41] [INFO ] Redundant transitions in 51 ms returned []
Running 859 sub problems to find dead transitions.
[2024-06-01 16:30:41] [INFO ] Invariant cache hit.
[2024-06-01 16:30:41] [INFO ] State equation strengthened by 177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1023 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-06-01 16:31:01] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:31:02] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:31:02] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:31:02] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-06-01 16:31:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1023 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1906 variables, and 141 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/438 constraints, State Equation: 0/1034 constraints, ReadFeed: 0/177 constraints, PredecessorRefiner: 859/859 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 859 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1023 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1023 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 3 (OVERLAPS) 11/1034 variables, 302/443 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-06-01 16:31:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-06-01 16:31:37] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:31:38] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:31:38] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 60372ms, After SMT, problems are : Problem set: 0 solved, 859 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63974 ms. Remains : 1034/1034 places, 872/872 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 249 times.
Drop transitions (Partial Free agglomeration) removed 249 transitions
Iterating global reduction 0 with 249 rules applied. Total rules applied 249 place count 1034 transition count 872
Applied a total of 249 rules in 46 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 872 rows 1034 cols
[2024-06-01 16:31:41] [INFO ] Computed 438 invariants in 7 ms
[2024-06-01 16:31:41] [INFO ] [Real]Absence check using 438 positive place invariants in 58 ms returned sat
[2024-06-01 16:31:41] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 16:31:42] [INFO ] [Nat]Absence check using 438 positive place invariants in 60 ms returned sat
[2024-06-01 16:31:42] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 16:31:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 16:31:43] [INFO ] After 738ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 16:31:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:31:43] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2104 ms
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
TRAPS : Iteration 1
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 639 ms
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1778 ms
TRAPS : Iteration 2
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2381 ms
TRAPS : Iteration 3
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1845 ms
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
TRAPS : Iteration 4
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
TRAPS : Iteration 5
[2024-06-01 16:32:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:32:00] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1356 ms
TRAPS : Iteration 6
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:32:03] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:32:03] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:32:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1234 ms
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 7
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:32:05] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:32:05] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:32:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1064 ms
[2024-06-01 16:32:06] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
TRAPS : Iteration 8
[2024-06-01 16:32:07] [INFO ] After 24519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 16:32:08] [INFO ] After 26578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 26938 ms.
[2024-06-01 16:32:08] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 16:32:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1034 places, 872 transitions and 3944 arcs took 9 ms.
[2024-06-01 16:32:08] [INFO ] Flatten gal took : 126 ms
Total runtime 163488 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
Could not compute solution for formula : ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13

BK_STOP 1717259529078

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-040B-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1335/inv_0_
rfs formula name ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1335/inv_1_
rfs formula name ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1335/inv_2_
rfs formula name ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1335/inv_3_
rfs formula name ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1335/inv_4_
rfs formula name ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1335/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-040B"
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-040B, 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-171683761600670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;