fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r560-tall-171734905900178
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
601.607 144435.00 363929.00 171.30 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.r560-tall-171734905900178.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 FireWire-PT-15, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 1717352085161

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:14:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:14:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:46] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 18:14:46] [INFO ] Transformed 248 places.
[2024-06-02 18:14:46] [INFO ] Transformed 383 transitions.
[2024-06-02 18:14:46] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:46] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 188 ms.
Graph (trivial) has 192 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 4 ms
Free SCC test removed 9 places
Structural test allowed to assert that 39 places are NOT stable. Took 20 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (1138 resets) in 2556 ms. (15 steps per ms) remains 157/209 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
[2024-06-02 18:14:47] [INFO ] Flow matrix only has 371 transitions (discarded 2 similar events)
// Phase 1: matrix 371 rows 239 cols
[2024-06-02 18:14:47] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 18:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 82/239 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 82/244 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 370/609 variables, 239/483 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 1/610 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/610 variables, and 484 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5128 ms.
Refiners :[Domain max(s): 239/239 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 239/239 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 82/239 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 82/244 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 20 ms to minimize.
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 136 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 115 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 126 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 127 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 127 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 137 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 18/262 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/610 variables, and 264 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5010 ms.
Refiners :[Domain max(s): 239/239 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/239 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/157 constraints, Known Traps: 20/20 constraints]
After SMT, in 10224ms problems are : Problem set: 0 solved, 157 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 373/373 transitions.
Graph (complete) has 667 edges and 239 vertex of which 237 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 237 transition count 351
Reduce places removed 19 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 21 rules applied. Total rules applied 44 place count 218 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 217 transition count 349
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 45 place count 217 transition count 345
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 213 transition count 345
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 209 transition count 341
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 209 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 209 transition count 340
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 84 place count 198 transition count 329
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 92 place count 194 transition count 331
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 194 transition count 322
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 110 place count 185 transition count 322
Applied a total of 110 rules in 72 ms. Remains 185 /239 variables (removed 54) and now considering 322/373 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 185/239 places, 322/373 transitions.
RANDOM walk for 4000000 steps (407975 resets) in 36085 ms. (110 steps per ms) remains 143/157 properties
BEST_FIRST walk for 40003 steps (1282 resets) in 150 ms. (264 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1304 resets) in 190 ms. (209 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1292 resets) in 204 ms. (195 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1275 resets) in 227 ms. (175 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1269 resets) in 203 ms. (196 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1277 resets) in 179 ms. (222 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1261 resets) in 124 ms. (320 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1278 resets) in 121 ms. (327 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1290 resets) in 114 ms. (347 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1270 resets) in 158 ms. (251 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1266 resets) in 136 ms. (291 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1280 resets) in 115 ms. (344 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1269 resets) in 117 ms. (339 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1280 resets) in 113 ms. (350 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1270 resets) in 113 ms. (350 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1276 resets) in 117 ms. (339 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1265 resets) in 120 ms. (330 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1257 resets) in 115 ms. (344 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1278 resets) in 116 ms. (341 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1284 resets) in 114 ms. (347 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1278 resets) in 116 ms. (341 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1274 resets) in 117 ms. (339 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1278 resets) in 114 ms. (347 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (1270 resets) in 114 ms. (347 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1268 resets) in 112 ms. (354 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (1289 resets) in 115 ms. (344 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40000 steps (1278 resets) in 119 ms. (333 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (1255 resets) in 114 ms. (347 steps per ms) remains 142/143 properties
BEST_FIRST walk for 40004 steps (1297 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1278 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1261 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1286 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1294 resets) in 110 ms. (360 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1274 resets) in 114 ms. (347 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1270 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (1259 resets) in 120 ms. (330 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1270 resets) in 116 ms. (341 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (1277 resets) in 117 ms. (338 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1278 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1272 resets) in 114 ms. (347 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1286 resets) in 121 ms. (327 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (1286 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1292 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1300 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1278 resets) in 119 ms. (333 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1293 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1265 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1260 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1273 resets) in 128 ms. (310 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1288 resets) in 125 ms. (317 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1269 resets) in 120 ms. (330 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1259 resets) in 119 ms. (333 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1274 resets) in 112 ms. (354 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1299 resets) in 112 ms. (354 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1284 resets) in 116 ms. (341 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1281 resets) in 126 ms. (314 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1251 resets) in 123 ms. (322 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1276 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1287 resets) in 127 ms. (312 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1279 resets) in 120 ms. (330 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1275 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1277 resets) in 114 ms. (347 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1277 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1284 resets) in 121 ms. (327 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1274 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1273 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1287 resets) in 112 ms. (354 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1283 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (1290 resets) in 116 ms. (341 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1260 resets) in 116 ms. (341 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (1278 resets) in 114 ms. (347 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1286 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1282 resets) in 112 ms. (354 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1282 resets) in 118 ms. (336 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (1267 resets) in 113 ms. (350 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1281 resets) in 115 ms. (344 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (1264 resets) in 116 ms. (341 steps per ms) remains 142/142 properties
// Phase 1: matrix 322 rows 185 cols
[2024-06-02 18:15:11] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 40/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 322/504 variables, 182/186 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 3/507 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 190 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4990 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 185/185 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 40/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 117 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 143 places in 68 ms of which 6 ms to minimize.
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 133 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 116 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 119 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 322/504 variables, 182/215 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 142/358 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:15:24] [INFO ] Deduced a trap composed of 119 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 3/507 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 16 (OVERLAPS) 0/507 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 362 constraints, problems are : Problem set: 0 solved, 142 unsolved in 33541 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 185/185 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 30/30 constraints]
After SMT, in 38564ms problems are : Problem set: 0 solved, 142 unsolved
Parikh walk visited 41 properties in 11860 ms.
Support contains 101 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 322/322 transitions.
Graph (complete) has 584 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 184 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 176 transition count 313
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 169 transition count 306
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 169 transition count 306
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 52 place count 169 transition count 286
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 166 transition count 283
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 166 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 68 place count 161 transition count 278
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 157 transition count 288
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 77 place count 157 transition count 287
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 83 place count 157 transition count 281
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 89 place count 151 transition count 281
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 90 place count 151 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 151 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 150 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 94 place count 150 transition count 282
Applied a total of 94 rules in 51 ms. Remains 150 /185 variables (removed 35) and now considering 282/322 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 150/185 places, 282/322 transitions.
RANDOM walk for 4000000 steps (402128 resets) in 28552 ms. (140 steps per ms) remains 86/101 properties
BEST_FIRST walk for 400003 steps (13064 resets) in 883 ms. (452 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (13141 resets) in 891 ms. (448 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (13090 resets) in 912 ms. (438 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (13063 resets) in 902 ms. (442 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (13140 resets) in 898 ms. (444 steps per ms) remains 85/86 properties
BEST_FIRST walk for 400003 steps (13088 resets) in 893 ms. (447 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (13084 resets) in 898 ms. (444 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (13129 resets) in 891 ms. (448 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13060 resets) in 883 ms. (452 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13074 resets) in 874 ms. (457 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (13104 resets) in 884 ms. (451 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (13092 resets) in 878 ms. (455 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (13140 resets) in 916 ms. (436 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13086 resets) in 906 ms. (441 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13179 resets) in 890 ms. (448 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13119 resets) in 886 ms. (450 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (13110 resets) in 883 ms. (452 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (13071 resets) in 888 ms. (449 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (13095 resets) in 929 ms. (430 steps per ms) remains 80/85 properties
BEST_FIRST walk for 400002 steps (13137 resets) in 898 ms. (444 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (13132 resets) in 879 ms. (454 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13129 resets) in 851 ms. (469 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (13030 resets) in 836 ms. (477 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (13134 resets) in 843 ms. (473 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13154 resets) in 840 ms. (475 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13135 resets) in 883 ms. (452 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13050 resets) in 857 ms. (466 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13082 resets) in 844 ms. (473 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (13068 resets) in 837 ms. (477 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (13086 resets) in 828 ms. (482 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13118 resets) in 867 ms. (460 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13084 resets) in 879 ms. (454 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13088 resets) in 853 ms. (468 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (13084 resets) in 836 ms. (477 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (13120 resets) in 834 ms. (479 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13049 resets) in 839 ms. (476 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13123 resets) in 841 ms. (475 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (13103 resets) in 833 ms. (479 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (13060 resets) in 848 ms. (471 steps per ms) remains 78/80 properties
BEST_FIRST walk for 400003 steps (13105 resets) in 834 ms. (479 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (13088 resets) in 824 ms. (484 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13148 resets) in 828 ms. (482 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13064 resets) in 822 ms. (486 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13107 resets) in 818 ms. (488 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13103 resets) in 820 ms. (487 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13094 resets) in 828 ms. (482 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (13084 resets) in 834 ms. (479 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13137 resets) in 837 ms. (477 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13058 resets) in 831 ms. (480 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13044 resets) in 832 ms. (480 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13100 resets) in 839 ms. (476 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13084 resets) in 828 ms. (482 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13105 resets) in 842 ms. (474 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13116 resets) in 859 ms. (465 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13095 resets) in 838 ms. (476 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13081 resets) in 844 ms. (473 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13087 resets) in 846 ms. (472 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13121 resets) in 823 ms. (485 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13116 resets) in 852 ms. (468 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13115 resets) in 838 ms. (476 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13112 resets) in 826 ms. (483 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (13076 resets) in 832 ms. (480 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13074 resets) in 818 ms. (488 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13055 resets) in 829 ms. (481 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13086 resets) in 833 ms. (479 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13065 resets) in 838 ms. (476 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13069 resets) in 827 ms. (483 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13090 resets) in 824 ms. (484 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13143 resets) in 832 ms. (480 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13152 resets) in 820 ms. (487 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13139 resets) in 873 ms. (457 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13157 resets) in 835 ms. (478 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13118 resets) in 827 ms. (483 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13115 resets) in 832 ms. (480 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (13042 resets) in 915 ms. (436 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (13022 resets) in 837 ms. (477 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (13099 resets) in 813 ms. (491 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400003 steps (13084 resets) in 837 ms. (477 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (13096 resets) in 842 ms. (474 steps per ms) remains 77/77 properties
// Phase 1: matrix 282 rows 150 cols
[2024-06-02 18:16:27] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:16:27] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 68/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 281/426 variables, 145/149 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 16/165 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 6/432 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 170 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 68/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 5 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 0 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 281/426 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 77/259 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 18:16:33] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 6/432 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/432 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 265 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9675 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 18/18 constraints]
After SMT, in 11863ms problems are : Problem set: 0 solved, 77 unsolved
Parikh walk visited 1 properties in 4617 ms.
Support contains 76 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 282/282 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 274
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 142 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 140 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 140 transition count 271
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 135 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 133 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 133 transition count 264
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 130 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 130 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 130 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 130 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 128 transition count 270
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 128 transition count 270
Applied a total of 60 rules in 54 ms. Remains 128 /150 variables (removed 22) and now considering 270/282 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 128/150 places, 270/282 transitions.
RANDOM walk for 4000000 steps (401988 resets) in 25276 ms. (158 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13163 resets) in 938 ms. (425 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400000 steps (13068 resets) in 832 ms. (480 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13133 resets) in 833 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (13059 resets) in 826 ms. (483 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (13093 resets) in 833 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (13043 resets) in 835 ms. (478 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (13114 resets) in 834 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (13060 resets) in 823 ms. (485 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (13101 resets) in 830 ms. (481 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (13039 resets) in 844 ms. (473 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13155 resets) in 836 ms. (477 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13128 resets) in 839 ms. (476 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13097 resets) in 837 ms. (477 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13057 resets) in 833 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13094 resets) in 822 ms. (486 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13117 resets) in 829 ms. (481 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13093 resets) in 839 ms. (476 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (13110 resets) in 834 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (13048 resets) in 826 ms. (483 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13120 resets) in 826 ms. (483 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13078 resets) in 819 ms. (487 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13146 resets) in 1142 ms. (349 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13122 resets) in 834 ms. (479 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (13112 resets) in 822 ms. (486 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13079 resets) in 824 ms. (484 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (13139 resets) in 826 ms. (483 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13111 resets) in 816 ms. (489 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13107 resets) in 819 ms. (487 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (13135 resets) in 831 ms. (480 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (13072 resets) in 833 ms. (479 steps per ms) remains 75/76 properties
BEST_FIRST walk for 400003 steps (13084 resets) in 824 ms. (484 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13066 resets) in 830 ms. (481 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13136 resets) in 835 ms. (478 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13032 resets) in 831 ms. (480 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (13091 resets) in 837 ms. (477 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13149 resets) in 839 ms. (476 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13101 resets) in 829 ms. (481 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13122 resets) in 820 ms. (487 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13155 resets) in 820 ms. (487 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13172 resets) in 841 ms. (475 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13077 resets) in 830 ms. (481 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13096 resets) in 837 ms. (477 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13082 resets) in 834 ms. (479 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400000 steps (13111 resets) in 826 ms. (483 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13069 resets) in 828 ms. (482 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13103 resets) in 841 ms. (475 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13069 resets) in 828 ms. (482 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13052 resets) in 839 ms. (476 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (13087 resets) in 837 ms. (477 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13098 resets) in 869 ms. (459 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13010 resets) in 868 ms. (460 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13045 resets) in 832 ms. (480 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13054 resets) in 818 ms. (488 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13116 resets) in 821 ms. (486 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13106 resets) in 809 ms. (493 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (13025 resets) in 1244 ms. (321 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13073 resets) in 815 ms. (490 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13128 resets) in 811 ms. (492 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13087 resets) in 805 ms. (496 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13068 resets) in 802 ms. (498 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13117 resets) in 801 ms. (498 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13078 resets) in 820 ms. (487 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13116 resets) in 835 ms. (478 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (13113 resets) in 820 ms. (487 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13123 resets) in 827 ms. (483 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13038 resets) in 828 ms. (482 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13080 resets) in 836 ms. (477 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13003 resets) in 823 ms. (485 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13063 resets) in 814 ms. (490 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13077 resets) in 825 ms. (484 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (13078 resets) in 817 ms. (489 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13095 resets) in 822 ms. (486 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13114 resets) in 816 ms. (489 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13107 resets) in 812 ms. (492 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (13097 resets) in 807 ms. (495 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (13070 resets) in 814 ms. (490 steps per ms) remains 75/75 properties
Finished probabilistic random walk after 85394 steps, run visited all 75 properties in 674 ms. (steps per millisecond=126 )
Probabilistic random walk after 85394 steps, saw 24136 distinct states, run finished after 678 ms. (steps per millisecond=125 ) properties seen :75
Able to resolve query StableMarking after proving 211 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 143206 ms.
ITS solved all properties within timeout

BK_STOP 1717352229596

--------------------
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="FireWire-PT-15"
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 FireWire-PT-15, 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 r560-tall-171734905900178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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