fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399800592
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BusinessProcesses-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.483 2318592.00 2375054.00 2729.40 [undef] Cannot compute

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.r048-tajo-171620399800592.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 itstools
Input is BusinessProcesses-PT-18, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800592
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716337346385

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 00:22:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:22:28] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-22 00:22:28] [INFO ] Transformed 717 places.
[2024-05-22 00:22:28] [INFO ] Transformed 642 transitions.
[2024-05-22 00:22:28] [INFO ] Found NUPN structural information;
[2024-05-22 00:22:28] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 273 ms.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 702/702 places, 627/627 transitions.
[2024-05-22 00:22:28] [INFO ] Redundant transitions in 33 ms returned []
Running 626 sub problems to find dead transitions.
// Phase 1: matrix 627 rows 702 cols
[2024-05-22 00:22:28] [INFO ] Computed 114 invariants in 59 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/693 variables, 693/693 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/693 variables, 41/734 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (OVERLAPS) 9/702 variables, 73/807 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 13 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 172 places in 505 ms of which 6 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 188 places in 268 ms of which 5 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 195 places in 239 ms of which 15 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 195 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 163 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 194 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 181 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 191 places in 376 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 189 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 174 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 16 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 198 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 192 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 163 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 195 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 183 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 174 places in 158 ms of which 8 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 153 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 187 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 186 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 192 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 180 places in 197 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 1.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 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.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 1.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 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.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 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 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.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 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.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 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.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 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 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 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.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 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.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 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/856 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1329 variables, and 856 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30031 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/693 variables, 693/693 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/693 variables, 41/734 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (OVERLAPS) 9/702 variables, 73/807 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 40/856 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 188 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 195 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 190 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 175 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 193 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 159 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 186 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 201 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 193 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 189 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 9 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 187 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 163 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 191 places in 136 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/876 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 190 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 192 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 179 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 197 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 187 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 191 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 195 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 184 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 189 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 197 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 200 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 190 places in 193 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/896 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 4 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 193 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 191 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 190 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 4 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 195 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 4 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 172 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 201 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 193 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 176 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 145 places in 242 ms of which 4 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 190 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/916 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 150 places in 229 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 140 places in 205 ms of which 4 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 4 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 4 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 4 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 4 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 167 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 154 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 176 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 20/936 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 4 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 4 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 5 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 184 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 194 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 192 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 191 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 188 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 197 places in 147 ms of which 2 ms to minimize.
SMT process timed out in 60482ms, After SMT, problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60685 ms. Remains : 702/702 places, 627/627 transitions.
Final net has 702 places and 627 transitions.
[2024-05-22 00:23:29] [INFO ] Flatten gal took : 111 ms
[2024-05-22 00:23:29] [INFO ] Applying decomposition
[2024-05-22 00:23:29] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16680368652418753887.txt' '-o' '/tmp/graph16680368652418753887.bin' '-w' '/tmp/graph16680368652418753887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16680368652418753887.bin' '-l' '-1' '-v' '-w' '/tmp/graph16680368652418753887.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:23:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:23:29] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-22 00:23:30] [INFO ] Flatten gal took : 316 ms
[2024-05-22 00:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 51 ms.
[2024-05-22 00:23:30] [INFO ] Time to serialize gal into /tmp/StateSpace9867522075169773962.gal : 63 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace9867522075169773962.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Detected timeout of ITS tools.
[2024-05-22 00:43:50] [INFO ] Applying decomposition
[2024-05-22 00:43:50] [INFO ] Flatten gal took : 58 ms
[2024-05-22 00:43:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:43:50] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 00:43:50] [INFO ] Flatten gal took : 62 ms
[2024-05-22 00:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-22 00:43:50] [INFO ] Time to serialize gal into /tmp/StateSpace15790372144010252739.gal : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace15790372144010252739.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
ITS-tools command line returned an error code 137
[2024-05-22 00:50:11] [INFO ] Flatten gal took : 51 ms
[2024-05-22 00:50:11] [INFO ] Input system was already deterministic with 627 transitions.
[2024-05-22 00:50:11] [INFO ] Transformed 702 places.
[2024-05-22 00:50:11] [INFO ] Transformed 627 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:50:41] [INFO ] Time to serialize gal into /tmp/StateSpace6958140012337799478.gal : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace6958140012337799478.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 2317029 ms.

BK_STOP 1716339664977

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-18"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 itstools"
echo " Input is BusinessProcesses-PT-18, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800592"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;