About the Execution of GreatSPN+red for ShieldRVt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 800.804 | 163098.00 | 340784.00 | 420.50 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r364-tall-171683778300628.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 greatspnxred
Input is ShieldRVt-PT-030B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683778300628
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1716917161110
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:26:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-28 17:26:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:26:02] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-28 17:26:02] [INFO ] Transformed 1503 places.
[2024-05-28 17:26:02] [INFO ] Transformed 1503 transitions.
[2024-05-28 17:26:02] [INFO ] Found NUPN structural information;
[2024-05-28 17:26:02] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 263 ms.
Structural test allowed to assert that 601 places are NOT stable. Took 15 ms.
RANDOM walk for 40000 steps (8 resets) in 3118 ms. (12 steps per ms) remains 586/902 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 16 ms. (7 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 586/586 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 586/586 properties
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-28 17:26:03] [INFO ] Computed 121 invariants in 22 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/3006 variables, and 586 constraints, problems are : Problem set: 0 solved, 586 unsolved in 5150 ms.
Refiners :[Domain max(s): 586/1503 constraints, Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1503 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/3006 variables, and 586 constraints, problems are : Problem set: 0 solved, 586 unsolved in 5016 ms.
Refiners :[Domain max(s): 586/1503 constraints, Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1503 constraints, PredecessorRefiner: 0/586 constraints, Known Traps: 0/0 constraints]
After SMT, in 10390ms problems are : Problem set: 0 solved, 586 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 586 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1503 transition count 1179
Reduce places removed 324 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 326 rules applied. Total rules applied 650 place count 1179 transition count 1177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 651 place count 1178 transition count 1177
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 651 place count 1178 transition count 1133
Deduced a syphon composed of 44 places in 8 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 739 place count 1134 transition count 1133
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 810 place count 1063 transition count 1062
Iterating global reduction 3 with 71 rules applied. Total rules applied 881 place count 1063 transition count 1062
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 881 place count 1063 transition count 1033
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 939 place count 1034 transition count 1033
Performed 251 Post agglomeration using F-continuation condition.Transition count delta: 251
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1441 place count 783 transition count 782
Renaming transitions due to excessive name length > 1024 char.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1497 place count 755 transition count 806
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1498 place count 755 transition count 805
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1502 place count 755 transition count 801
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1506 place count 751 transition count 801
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1507 place count 751 transition count 800
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1508 place count 750 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1509 place count 749 transition count 799
Applied a total of 1509 rules in 504 ms. Remains 749 /1503 variables (removed 754) and now considering 799/1503 (removed 704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 749/1503 places, 799/1503 transitions.
RANDOM walk for 4000000 steps (974 resets) in 99615 ms. (40 steps per ms) remains 113/586 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 190 ms. (209 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (9 resets) in 187 ms. (212 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 151 ms. (263 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 154 ms. (258 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 163 ms. (243 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 170 ms. (233 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (9 resets) in 176 ms. (226 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 135 ms. (294 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 142 ms. (279 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (10 resets) in 145 ms. (274 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 150 ms. (264 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (9 resets) in 173 ms. (229 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 147 ms. (270 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 167 ms. (238 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (9 resets) in 152 ms. (261 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (9 resets) in 183 ms. (217 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (9 resets) in 145 ms. (274 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 113/113 properties
// Phase 1: matrix 799 rows 749 cols
[2024-05-28 17:26:46] [INFO ] Computed 120 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 78/191 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 193/384 variables, 191/214 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 34/418 variables, 15/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 28/446 variables, 5/234 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 31/477 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 12/489 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (OVERLAPS) 22/511 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 14/525 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 20/545 variables, 18/304 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 19 (OVERLAPS) 12/557 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 21 (OVERLAPS) 22/579 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/579 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 23 (OVERLAPS) 14/593 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/593 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 25 (OVERLAPS) 20/613 variables, 18/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/613 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 27 (OVERLAPS) 12/625 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/625 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 29 (OVERLAPS) 22/647 variables, 16/360 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/647 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 31 (OVERLAPS) 14/661 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/661 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 33 (OVERLAPS) 20/681 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/681 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 35 (OVERLAPS) 12/693 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/693 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 37 (OVERLAPS) 22/715 variables, 16/398 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 39 (OVERLAPS) 14/729 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/729 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 41 (OVERLAPS) 20/749 variables, 18/418 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/749 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 43 (OVERLAPS) 12/761 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/761 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 45 (OVERLAPS) 22/783 variables, 16/436 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/783 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 47 (OVERLAPS) 14/797 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/797 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 49 (OVERLAPS) 20/817 variables, 18/456 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/817 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 51 (OVERLAPS) 12/829 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/829 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 53 (OVERLAPS) 22/851 variables, 16/474 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/851 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 55 (OVERLAPS) 14/865 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 57 (OVERLAPS) 20/885 variables, 18/494 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/885 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 59 (OVERLAPS) 12/897 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/897 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 61 (OVERLAPS) 22/919 variables, 16/512 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/919 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 63 (OVERLAPS) 14/933 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/933 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 65 (OVERLAPS) 20/953 variables, 18/532 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/953 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 67 (OVERLAPS) 12/965 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/1548 variables, and 534 constraints, problems are : Problem set: 0 solved, 113 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/120 constraints, State Equation: 476/749 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 78/191 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 12 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:27:32] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-05-28 17:27:33] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:34] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 2 ms to minimize.
[2024-05-28 17:27:35] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:35] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:27:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:27:35] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:27:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 193/384 variables, 191/271 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 113/384 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 17:27:39] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:27:39] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:27:39] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:27:39] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (OVERLAPS) 34/418 variables, 15/403 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 28/446 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 31/477 variables, 32/440 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 19 (OVERLAPS) 12/489 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 21 (OVERLAPS) 22/511 variables, 16/458 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/511 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 23 (OVERLAPS) 14/525 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/525 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 25 (OVERLAPS) 20/545 variables, 18/478 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/545 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 27 (OVERLAPS) 12/557 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/557 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 29 (OVERLAPS) 22/579 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/579 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 31 (OVERLAPS) 14/593 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/593 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 33 (OVERLAPS) 20/613 variables, 18/516 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/613 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 35 (OVERLAPS) 12/625 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/625 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 37 (OVERLAPS) 22/647 variables, 16/534 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/1548 variables, and 534 constraints, problems are : Problem set: 0 solved, 113 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 38/120 constraints, State Equation: 322/749 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 61/61 constraints]
After SMT, in 90065ms problems are : Problem set: 0 solved, 113 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 799/799 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 749 transition count 670
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 258 place count 620 transition count 670
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 258 place count 620 transition count 606
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 386 place count 556 transition count 606
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 426 place count 516 transition count 566
Iterating global reduction 2 with 40 rules applied. Total rules applied 466 place count 516 transition count 566
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 466 place count 516 transition count 526
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 546 place count 476 transition count 526
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 722 place count 388 transition count 438
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 816 place count 341 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 817 place count 341 transition count 482
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 818 place count 341 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 819 place count 340 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 820 place count 340 transition count 480
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 822 place count 340 transition count 480
Applied a total of 822 rules in 185 ms. Remains 340 /749 variables (removed 409) and now considering 480/799 (removed 319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 340/749 places, 480/799 transitions.
RANDOM walk for 4000000 steps (1082 resets) in 83839 ms. (47 steps per ms) remains 12/113 properties
BEST_FIRST walk for 3452815 steps (117 resets) in 11062 ms. (312 steps per ms) remains 0/12 properties
Able to resolve query StableMarking after proving 903 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 161888 ms.
ITS solved all properties within timeout
BK_STOP 1716917324208
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
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="ShieldRVt-PT-030B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is ShieldRVt-PT-030B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r364-tall-171683778300628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;