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-174881266700264.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-S02J04T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700264
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 17K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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 9.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K 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 717K 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 Liveness

=== Now, execution of the tool begins

BK_START 1748899404121

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:23:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:23:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:23:25] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2025-06-02 21:23:25] [INFO ] Transformed 614 places.
[2025-06-02 21:23:25] [INFO ] Transformed 1242 transitions.
[2025-06-02 21:23:25] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 235 ms.
Discarding 128 transitions out of 1242. Remains 1114
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.26808KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 84 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-02 21:23:25] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2025-06-02 21:23:26] [INFO ] Computed 50 invariants in 62 ms
[2025-06-02 21:23:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 31 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 3 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 1 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 6 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 1 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 15 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 3 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 184 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 334 places in 267 ms of which 7 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 372 places in 237 ms of which 3 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 349 places in 252 ms of which 3 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 422 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 395 places in 276 ms of which 3 ms to minimize.
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 339 places in 242 ms of which 4 ms to minimize.
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 395 places in 239 ms of which 3 ms to minimize.
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 330 places in 233 ms of which 4 ms to minimize.
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 330 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:23:46] [INFO ] Deduced a trap composed of 295 places in 249 ms of which 3 ms to minimize.
[2025-06-02 21:23:46] [INFO ] Deduced a trap composed of 318 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 68 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:24:01] [INFO ] Deduced a trap composed of 310 places in 248 ms of which 4 ms to minimize.
[2025-06-02 21:24:01] [INFO ] Deduced a trap composed of 319 places in 245 ms of which 3 ms to minimize.
[2025-06-02 21:24:02] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 3 ms to minimize.
[2025-06-02 21:24:06] [INFO ] Deduced a trap composed of 342 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 72 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 26/26 constraints]
After SMT, in 41672ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41717ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41845 ms. Remains : 614/614 places, 1114/1114 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 35 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2025-06-02 21:24:07] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 21:24:07] [INFO ] Invariant cache hit.
[2025-06-02 21:24:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 21:24:07] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 21:24:07] [INFO ] Invariant cache hit.
[2025-06-02 21:24:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:24:08] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2025-06-02 21:24:09] [INFO ] Redundant transitions in 71 ms returned []
Running 1112 sub problems to find dead transitions.
[2025-06-02 21:24:09] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 21:24:09] [INFO ] Invariant cache hit.
[2025-06-02 21:24:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 0 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 0 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:24:22] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:24:22] [INFO ] Deduced a trap composed of 184 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:24:22] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2025-06-02 21:24:22] [INFO ] Deduced a trap composed of 303 places in 240 ms of which 4 ms to minimize.
[2025-06-02 21:24:23] [INFO ] Deduced a trap composed of 295 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:24:23] [INFO ] Deduced a trap composed of 328 places in 237 ms of which 5 ms to minimize.
[2025-06-02 21:24:23] [INFO ] Deduced a trap composed of 327 places in 240 ms of which 3 ms to minimize.
[2025-06-02 21:24:24] [INFO ] Deduced a trap composed of 353 places in 236 ms of which 4 ms to minimize.
[2025-06-02 21:24:24] [INFO ] Deduced a trap composed of 315 places in 237 ms of which 3 ms to minimize.
[2025-06-02 21:24:24] [INFO ] Deduced a trap composed of 364 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:24:24] [INFO ] Deduced a trap composed of 315 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:24:25] [INFO ] Deduced a trap composed of 395 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:24:29] [INFO ] Deduced a trap composed of 310 places in 255 ms of which 4 ms to minimize.
[2025-06-02 21:24:29] [INFO ] Deduced a trap composed of 330 places in 257 ms of which 3 ms to minimize.
[2025-06-02 21:24:30] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 3 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 286 places in 263 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 0.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 6.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 2.0 3.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 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 (/ 1.0 3.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 (/ 7.0 4.0))
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.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 0.0)
(s180 0.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 0.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 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 4.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.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 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 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 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 9.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 71 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 25/71 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2025-06-02 21:24:54] [INFO ] Deduced a trap composed of 295 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:25:00] [INFO ] Deduced a trap composed of 322 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:25:01] [INFO ] Deduced a trap composed of 337 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:25:01] [INFO ] Deduced a trap composed of 345 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 75 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 29/29 constraints]
After SMT, in 61377ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 61391ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62781 ms. Remains : 614/614 places, 1114/1114 transitions.
Finished random walk after 3229 steps, including 0 resets, run found a deadlock after 21 ms. (steps per millisecond=153 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 105091 ms.
ITS solved all properties within timeout

BK_STOP 1748899510503

--------------------
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 Liveness -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-S02J04T08"
export BK_EXAMINATION="Liveness"
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-S02J04T08, examination is Liveness"
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-174881266700264"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;