Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r056-tajo-171620408600323.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tajo-171620408600323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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 1716534381237

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 07:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-24 07:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:06:22] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 07:06:22] [INFO ] Transformed 403 places.
[2024-05-24 07:06:22] [INFO ] Transformed 374 transitions.
[2024-05-24 07:06:22] [INFO ] Found NUPN structural information;
[2024-05-24 07:06:22] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 257 ms.
Graph (trivial) has 227 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Structural test allowed to assert that 124 places are NOT stable. Took 33 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (473 resets) in 1962 ms. (20 steps per ms) remains 157/279 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 157/157 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 157/157 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 157/157 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 157/157 properties
// Phase 1: matrix 367 rows 397 cols
[2024-05-24 07:06:23] [INFO ] Computed 65 invariants in 19 ms
[2024-05-24 07:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/168 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 142/299 variables, 23/191 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 142/333 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 50/349 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 50/395 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 48/397 variables, 19/414 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 48/462 constraints. Problems are: Problem set: 0 solved, 157 unsolved
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 (/ 1.0 124.0))
(s19 (/ 30.0 31.0))
(s20 (/ 1.0 124.0))
(s21 (/ 1.0 124.0))
(s22 (/ 1.0 124.0))
(s23 0.0)
(s24 (/ 1.0 124.0))
(s25 (/ 1.0 124.0))
(s26 (/ 1.0 124.0))
(s27 (/ 59.0 62.0))
(s28 (/ 1.0 124.0))
(s29 (/ 1.0 62.0))
(s30 0.0)
(s31 (/ 1.0 124.0))
(s32 (/ 30.0 31.0))
(s33 (/ 1.0 124.0))
(s34 (/ 1.0 124.0))
(s35 (/ 1.0 124.0))
(s36 0.0)
(s37 (/ 1.0 124.0))
(s38 (/ 1.0 124.0))
(s39 (/ 1.0 124.0))
(s40 0.0)
(s41 (/ 1.0 124.0))
(s42 (/ 30.0 31.0))
(s43 0.0)
(s44 (/ 30.0 31.0))
(s45 (/ 1.0 124.0))
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.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 (/ 30.0 31.0))
(s69 (/ 1.0 124.0))
(s70 (/ 1.0 124.0))
(s71 (/ 1.0 124.0))
(s72 (/ 1.0 124.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 (/ 1.0 124.0))
(s82 (/ 1.0 124.0))
(s83 (/ 1.0 124.0))
(s84 (/ 1.0 124.0))
(s85 (/ 1.0 124.0))
(s86 (/ 1.0 124.0))
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 (/ 1.0 124.0))
(s91 (/ 1.0 124.0))
(s92 (/ 1.0 124.0))
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 (/ 1.0 2.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 0.0)
(s108 (/ 1.0 124.0))
(s109 (/ 45.0 124.0))
(s110 (/ 1.0 124.0))
(s111 (/ 1.0 124.0))
(s112 (/ 1.0 124.0))
(s113 (/ 45.0 124.0))
(s114 (/ 1.0 124.0))
(s115 (/ 1.0 124.0))
(s116 (/ 1.0 124.0))
(s117 (/ 1.0 124.0))
(s118 (/ 1.0 124.0))
(s119 (/ 1.0 124.0))
(s120 (/ 1.0 124.0))
(s121 (/ 1.0 124.0))
(s122 (/ 1.0 124.0))
(s123 (/ 1.0 124.0))
(s124 (/ 1.0 124.0))
(s125 (/ 1.0 124.0))
(s126 0.0)
(s127 (/ 30.0 31.0))
(s128 (/ 1.0 124.0))
(s129 (/ 1.0 124.0))
(s130 (/ 1.0 124.0))
(s131 (/ 1.0 124.0))
(s132 (/ 119.0 124.0))
(s133 (/ 1.0 124.0))
(s134 (/ 1.0 124.0))
(s135 (/ 1.0 124.0))
(s136 (/ 1.0 124.0))
(s137 (/ 1.0 124.0))
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 (/ 119.0 124.0))
(s145 (/ 1.0 124.0))
(s146 (/ 1.0 124.0))
(s147 (/ 1.0 124.0))
(s148 (/ 1.0 124.0))
(s149 (/ 1.0 124.0))
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 (/ 1.0 124.0))
(s164 (/ 1.0 124.0))
(s165 (/ 61.0 62.0))
(s166 0.0)
(s167 0.0)
(s168 1.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 (/ 1.0 124.0))
(s189 (/ 1.0 124.0))
(s190 (/ 61.0 62.0))
(s191 0.0)
(s192 0.0)
(s193 (/ 1.0 124.0))
(s194 (/ 1.0 124.0))
(s195 (/ 61.0 62.0))
(s196 0.0)
(s197 0.0)
(s198 (/ 123.0 124.0))
(s199 (/ 1.0 124.0))
(s200 0.0)
(s201 0.0)
(s202 (/ 61.0 62.0))
(s203 (/ 1.0 124.0))
(s204 (/ 1.0 124.0))
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 (/ 1.0 124.0))
(s209 (/ 1.0 124.0))
(s210 (/ 61.0 62.0))
(s211 0.0)
(s212 0.0)
(s213 (/ 1.0 124.0))
(s214 (/ 1.0 31.0))
(s215 0.0)
(s216 (/ 119.0 124.0))
(s217 0.0)
(s218 (/ 123.0 124.0))
(s219 (/ 1.0 124.0))
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 (/ 1.0 124.0))
(s224 0.0)
(s225 (/ 123.0 124.0))
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 (/ 1.0 124.0))
(s249 (/ 1.0 124.0))
(s250 (/ 61.0 62.0))
(s251 0.0)
(s252 (/ 123.0 124.0))
(s253 (/ 1.0 124.0))
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 (/ 123.0 124.0))
(s258 (/ 1.0 124.0))
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.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 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 (/ 1.0 124.0))
(s279 (/ 1.0 124.0))
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 (/ 1.0 124.0))
(s286 (/ 1.0 124.0))
(s287 (/ 1.0 124.0))
(s288 (/ 1.0 124.0))
(s289 (/ 1.0 124.0))
(s290 (/ 1.0 62.0))
(s291 (/ 1.0 124.0))
(s292 (/ 1.0 124.0))
(s293 (/ 1.0 124.0))
(s294 (/ 1.0 124.0))
(s295 (/ 1.0 124.0))
(s296 (/ 1.0 124.0))
(s297 (/ 1.0 124.0))
(s298 (/ 1.0 124.0))
(s299 (/ 1.0 124.0))
(s300 (/ 1.0 62.0))
(s301 (/ 1.0 124.0))
(s302 (/ 1.0 124.0))
(s303 (/ 1.0 124.0))
(s304 (/ 1.0 124.0))
(s305 (/ 1.0 124.0))
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 (/ 1.0 124.0))
(s314 (/ 1.0 124.0))
(s315 (/ 1.0 124.0))
(s316 (/ 1.0 124.0))
(s317 0.0)
(s318 0.0)
(s319 (/ 1.0 124.0))
(s320 (/ 1.0 124.0))
(s321 (/ 1.0 124.0))
(s322 (/ 1.0 124.0))
(s323 (/ 1.0 124.0))
(s324 (/ 1.0 124.0))
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 (/ 1.0 124.0))
(s329 (/ 1.0 124.0))
(s330 (/ 1.0 124.0))
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 124.0))
(s337 (/ 1.0 124.0))
(s338 (/ 1.0 62.0))
(s339 (/ 1.0 124.0))
(s340 (/ 1.0 124.0))
(s341 (/ 1.0 124.0))
(s342 (/ 1.0 62.0))
(s343 (/ 1.0 124.0))
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 (/ 1.0 124.0))
(s349 (/ 1.0 124.0))
(s350 (/ 1.0 62.0))
(s351 (/ 1.0 124.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 (/ 1.0 124.0))
(s380 (/ 1.0 124.0))
(s381 (/ 1.0 124.0))
(s382 (/ 1.0 124.0))
(s383 (/ 1.0 124.0))
(s384 (/ 1.0 124.0))
(s385 (/ 1.0 124.0))
(s386 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/764 variables, and 462 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5049 ms.
Refiners :[Domain max(s): 397/397 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/397 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/168 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 142/299 variables, 23/191 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 142/333 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 22 ms to minimize.
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 2 ms to minimize.
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-24 07:06:29] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 2 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:06:30] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 2 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 2 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-05-24 07:06:31] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 97 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 5 ms to minimize.
[2024-05-24 07:06:32] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 107 places in 85 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-24 07:06:33] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 10225ms, After SMT, problems are : Problem set: 0 solved, 157 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 367/367 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 395 transition count 318
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 348 transition count 318
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 96 place count 348 transition count 291
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 5 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 155 place count 316 transition count 291
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 172 place count 299 transition count 274
Iterating global reduction 2 with 17 rules applied. Total rules applied 189 place count 299 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 189 place count 299 transition count 273
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 298 transition count 273
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 311 place count 237 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 236 transition count 217
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 315 place count 236 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 317 place count 234 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 234 transition count 215
Applied a total of 319 rules in 122 ms. Remains 234 /397 variables (removed 163) and now considering 215/367 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 234/397 places, 215/367 transitions.
RANDOM walk for 90326 steps (2399 resets) in 1010 ms. (89 steps per ms) remains 0/157 properties
Able to resolve query StableMarking after proving 281 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 11903 ms.
ITS solved all properties within timeout

BK_STOP 1716534394391

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BusinessProcesses-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-09, 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 r056-tajo-171620408600323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;