About the Execution of 2024-gold for PolyORBLF-PT-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15685.580 | 525050.00 | 842773.00 | 1227.70 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S02J06T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 20K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 217K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:32 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 1748899746133
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:29:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:29:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:29:07] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-06-02 21:29:07] [INFO ] Transformed 844 places.
[2025-06-02 21:29:07] [INFO ] Transformed 1812 transitions.
[2025-06-02 21:29:07] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 252 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (11 resets) in 1988 ms. (20 steps per ms) remains 22/844 properties
BEST_FIRST walk for 4001 steps (8 resets) in 111 ms. (35 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 120 ms. (33 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
[2025-06-02 21:29:08] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2025-06-02 21:29:08] [INFO ] Computed 58 invariants in 93 ms
[2025-06-02 21:29:09] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/841 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/842 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1632/2474 variables, 842/899 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2474 variables, 120/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2474 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2476 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2476 variables, 1/1022 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2476 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 1022 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:29:17] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 30 ms to minimize.
[2025-06-02 21:29:17] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 3 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 10 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 159 places in 410 ms of which 5 ms to minimize.
[2025-06-02 21:29:18] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2025-06-02 21:29:19] [INFO ] Deduced a trap composed of 432 places in 405 ms of which 5 ms to minimize.
SMT process timed out in 10665ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 5 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 273 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2025-06-02 21:29:19] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2025-06-02 21:29:19] [INFO ] Computed 56 invariants in 30 ms
[2025-06-02 21:29:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2025-06-02 21:29:36] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2025-06-02 21:29:37] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:29:37] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 3 ms to minimize.
[2025-06-02 21:29:37] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 4 ms to minimize.
[2025-06-02 21:29:38] [INFO ] Deduced a trap composed of 186 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
(s299 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 10)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 10)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 5)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 14/14 constraints]
After SMT, in 43205ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43518 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 4000000 steps (1435 resets) in 58285 ms. (68 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (39 resets) in 2088 ms. (191 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 2078 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (56 resets) in 1619 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (39 resets) in 1590 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (43 resets) in 1568 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (65 resets) in 1621 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 1617 ms. (247 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (53 resets) in 1610 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (55 resets) in 1587 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 1610 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 1622 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 2852 ms. (140 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 2079 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 2149 ms. (186 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (64 resets) in 2224 ms. (179 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (48 resets) in 1635 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (51 resets) in 1599 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (53 resets) in 1623 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 1608 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (57 resets) in 1613 ms. (247 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 1622 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 1608 ms. (248 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 2424300 steps, run timeout after 81001 ms. (steps per millisecond=29 ) properties seen :0 out of 22
Probabilistic random walk after 2424300 steps, saw 1521374 distinct states, run finished after 81007 ms. (steps per millisecond=29 ) properties seen :0
[2025-06-02 21:31:51] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2025-06-02 21:31:51] [INFO ] Invariant cache hit.
[2025-06-02 21:31:51] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 11/540 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 10/550 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1342/1892 variables, 550/605 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1892 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 2/1894 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 728 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4443 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:32:17] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:32:17] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 1 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2025-06-02 21:32:18] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2025-06-02 21:32:19] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 1 ms to minimize.
[2025-06-02 21:32:19] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 3 ms to minimize.
[2025-06-02 21:32:20] [INFO ] Deduced a trap composed of 205 places in 292 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 11/540 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:32:23] [INFO ] Deduced a trap composed of 82 places in 275 ms of which 4 ms to minimize.
[2025-06-02 21:32:23] [INFO ] Deduced a trap composed of 255 places in 292 ms of which 3 ms to minimize.
[2025-06-02 21:32:23] [INFO ] Deduced a trap composed of 241 places in 292 ms of which 3 ms to minimize.
[2025-06-02 21:32:24] [INFO ] Deduced a trap composed of 99 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:32:24] [INFO ] Deduced a trap composed of 96 places in 251 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:32:25] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 4 ms to minimize.
[2025-06-02 21:32:26] [INFO ] Deduced a trap composed of 231 places in 268 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 10/550 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 1342/1892 variables, 550/624 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1892 variables, 120/744 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1892/1894 variables, and 766 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 550/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 19/19 constraints]
After SMT, in 49486ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 46 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 92 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2025-06-02 21:32:40] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2025-06-02 21:32:40] [INFO ] Invariant cache hit.
[2025-06-02 21:32:41] [INFO ] Implicit Places using invariants in 1131 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 50 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2025-06-02 21:32:42] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2025-06-02 21:32:42] [INFO ] Computed 46 invariants in 22 ms
[2025-06-02 21:32:43] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2025-06-02 21:32:43] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:32:43] [INFO ] Invariant cache hit.
[2025-06-02 21:32:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:32:57] [INFO ] Implicit Places using invariants and state equation in 13939 ms returned []
Implicit Place search using SMT with State Equation took 15017 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16322 ms. Remains : 533/552 places, 1353/1362 transitions.
RANDOM walk for 4000000 steps (1431 resets) in 75066 ms. (53 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 2795 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (56 resets) in 3018 ms. (132 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (52 resets) in 2888 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (39 resets) in 2631 ms. (151 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (40 resets) in 2573 ms. (155 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (51 resets) in 2090 ms. (191 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (58 resets) in 2299 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (51 resets) in 2000 ms. (199 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 1729 ms. (231 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (55 resets) in 2174 ms. (183 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 2219 ms. (180 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 2107 ms. (189 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (57 resets) in 1610 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (54 resets) in 1515 ms. (263 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (43 resets) in 1547 ms. (258 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (58 resets) in 1536 ms. (260 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 1563 ms. (255 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1583 ms. (252 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (44 resets) in 1565 ms. (255 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 2008 ms. (199 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (60 resets) in 2744 ms. (145 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (52 resets) in 2184 ms. (183 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 3072083 steps, run timeout after 99001 ms. (steps per millisecond=31 ) properties seen :0 out of 22
Probabilistic random walk after 3072083 steps, saw 1761842 distinct states, run finished after 99001 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-02 21:35:10] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:35:10] [INFO ] Invariant cache hit.
[2025-06-02 21:35:10] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3893 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:35:15] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2025-06-02 21:35:15] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:35:15] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:35:15] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:35:17] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem smplace_81 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 17793ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 7421 ms.
Support contains 22 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 30 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 25 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2025-06-02 21:35:35] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:35:35] [INFO ] Invariant cache hit.
[2025-06-02 21:35:35] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-06-02 21:35:35] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:35:35] [INFO ] Invariant cache hit.
[2025-06-02 21:35:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:35:50] [INFO ] Implicit Places using invariants and state equation in 14513 ms returned []
Implicit Place search using SMT with State Equation took 15160 ms to find 0 implicit places.
[2025-06-02 21:35:50] [INFO ] Redundant transitions in 69 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-06-02 21:35:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:35:50] [INFO ] Invariant cache hit.
[2025-06-02 21:35:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2025-06-02 21:36:04] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 3 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 21:36:05] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 2 ms to minimize.
[2025-06-02 21:36:06] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 3 ms to minimize.
[2025-06-02 21:36:08] [INFO ] Deduced a trap composed of 186 places in 258 ms of which 3 ms to minimize.
[2025-06-02 21:36:13] [INFO ] Deduced a trap composed of 332 places in 280 ms of which 3 ms to minimize.
[2025-06-02 21:36:17] [INFO ] Deduced a trap composed of 178 places in 271 ms of which 3 ms to minimize.
[2025-06-02 21:36:18] [INFO ] Deduced a trap composed of 188 places in 272 ms of which 3 ms to minimize.
[2025-06-02 21:36:19] [INFO ] Deduced a trap composed of 243 places in 276 ms of which 3 ms to minimize.
[2025-06-02 21:36:19] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2025-06-02 21:36:20] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 3.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 7.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 9.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 3.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 9.0)
(s463 0.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2025-06-02 21:36:47] [INFO ] Deduced a trap composed of 199 places in 319 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 62959ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 62975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78250 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 400000 steps (138 resets) in 9803 ms. (40 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2025-06-02 21:36:56] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2025-06-02 21:36:56] [INFO ] Invariant cache hit.
[2025-06-02 21:36:56] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-02 21:36:56] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 28 ms returned sat
[2025-06-02 21:36:58] [INFO ] After 2059ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2025-06-02 21:36:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:36:58] [INFO ] After 626ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2025-06-02 21:37:00] [INFO ] After 2176ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2025-06-02 21:37:00] [INFO ] After 4408ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2025-06-02 21:37:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-02 21:37:00] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 25 ms returned sat
[2025-06-02 21:37:32] [INFO ] After 32254ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2025-06-02 21:37:39] [INFO ] After 6177ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :19
TRAPS : Iteration 0
[2025-06-02 21:37:40] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 3 ms to minimize.
[2025-06-02 21:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2025-06-02 21:37:40] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2025-06-02 21:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-02 21:37:43] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2025-06-02 21:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 1
[2025-06-02 21:37:45] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
[2025-06-02 21:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-02 21:37:47] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
TRAPS : Iteration 2
[2025-06-02 21:37:50] [INFO ] After 17255ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
[2025-06-02 21:37:51] [INFO ] After 50606ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 523769 ms.
ITS solved all properties within timeout
BK_STOP 1748900271183
--------------------
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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r168-tall-174881266700283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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.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 ;